Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing-Reference-Cited by-同舟云学术

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Published:2018 Issue: Volume: Page:597-621
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2018
language:
Short-container-title:

Author:

Farràs Oriol,Kaced Tarik,Martín Sebastià,Padró Carles

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-78381-9_22

Reference66 articles.

1. Ahlswede, R., Körner, J.: On the connection between the entropies of input and output distributions of discrete memoryless channels. In: Proceedings of the 5th Brasov Conference on Probability Theory, Brasov, Editura Academiei, Bucuresti, pp. 13–23 (1977)

2. Lecture Notes in Computer Science;R Ahlswede,2006

3. Babai, L., Gál, A., Wigderson, A.: Superpolynomial lower bounds for monotone span programs. Combinatorica 19, 301–319 (1999)

4. Lecture Notes in Computer Science;A Beimel,2011

5. Beimel, A., Farràs, O., Mintz, Y.: Secret-sharing schemes for very dense graphs. J. Cryptol. 29, 336–362 (2016)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Partial Secret Sharing Schemes;IEEE Transactions on Information Theory;2023-08

2. Succinct Computational Secret Sharing;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. An Automated Theorem Proving Framework for Information-Theoretic Results;IEEE Transactions on Information Theory;2023

4. The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication With a Binary Constraint;IEEE Transactions on Information Theory;2022-12

5. Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning;INFORMS Journal on Computing;2022-09