Author:
Jafari Amir,Khazaei Shahram
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference80 articles.
1. Benny Applebaum and Barak Arkis. On the power of amortization in secret sharing: $$d$$-uniform secret sharing and CDS with constant information rate. ACM Trans. Comput. Theory, 12(4):24:1–24:21, 2020.
2. Benny Applebaum, Amos Beimel, Oriol Farràs, Oded Nir, and Naty Peter. Secret-sharing schemes for general and uniform access structures. In Yuval Ishai and Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III, volume 11478 of Lecture Notes in Computer Science, pages 441–471. Springer, 2019.
3. László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, and Avi Wigderson. Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In STOC, pages 603–611, 1996.
4. László Babai, Anna Gál, and Avi Wigderson. Superpolynomial lower bounds for monotone span programs. Combinatorica, 19(3):301–319, 1999.
5. Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, and Carles Padró. Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr., 89(1):143–166, 2021.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Secret Sharing Schemes;IEEE Transactions on Information Theory;2023-08