Who Pays for Open Review? Visible Author Reputation and Its Effect on Ratings
研究通过分析ICLR 2026的18,000多篇投稿,探讨了从匿名评审转为开放评审对作者声誉与评分关系的影响,发现开放评审下高声誉作者更受益。
研究通过分析ICLR 2026的18,000多篇投稿,探讨了从匿名评审转为开放评审对作者声誉与评分关系的影响,发现开放评审下高声誉作者更受益。
Existing disjunctive hierarchical secret sharing (DHSS) schemes struggle to simultaneously achieve small share size, computational security, and asymptotic ideality. This work proposes the first explicit construction that reconciles small share size with asymptotic ideality while maintaining computational security. The scheme leverages polynomial-based techniques, multilinear homogeneous recurrence relations, and one-way functions, ensuring that the dealer operates in polynomial time. By doing so, it significantly advances the trade-off between efficiency and security in DHSS, offering a practical and theoretically sound solution that improves upon prior approaches which typically sacrifice one of these critical properties.
研究通过分析ICLR 2026的18,000多篇投稿,探讨了从匿名评审转为开放评审对作者声誉与评分关系的影响,发现开放评审下高声誉作者更受益。
Existing disjunctive hierarchical secret sharing (DHSS) schemes struggle to simultaneously achieve small share size, computational security, and asymptotic ideality. This work proposes the first explicit construction that reconciles small share size with asymptotic ideality while maintaining computational security. The scheme leverages polynomial-based techniques, multilinear homogeneous recurrence relations, and one-way functions, ensuring that the dealer operates in polynomial time. By doing so, it significantly advances the trade-off between efficiency and security in DHSS, offering a practical and theoretically sound solution that improves upon prior approaches which typically sacrifice one of these critical properties.