The size of a share must be large-Reference-Cited by-同舟云学术

The size of a share must be large

Published:1995 Issue: Volume: Page:13-22
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT'94
language:
Short-container-title:

Author:

Csirmaz László

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0053420

Reference13 articles.

1. G. R. Blakley and C. Meadows, Security of Ramp Schemes, Proceeding of Crypto'84 — Advances in Cryptology, Lecture Notes in Computer Science, Vol 196, G. R. Blakley and D. Chaum, eds. Springer-Verlag, Berlin, 1985, pp. 411–431.

2. C. Blundo, A. De Santis, L. Gargano, U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in Advances in Cryptology — CRYPTO '92, Lecture Notes in Computer Science, Vol 740, E. Brickell ed, Springer-Verlag, Berlin, 1993, pp. 149–169.

3. C. Blundo, A. De Santis, A. G. Gaggia, U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, Preprint, 1993

4. R. M. Capocelli, A. De Santis, U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Vol 6(1993) pp. 157–167.

5. M. Carpentieri, A. De Santis, U. Vaccaro, Size of Shares and Probability of Cheating in Threshold Schemes, Proceeding of Eurocrypt'93.

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

1. Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage;IEEE Transactions on Information Theory;2024-05

2. Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Evolving Conditional Disclosure of Secrets;Lecture Notes in Computer Science;2023

4. Secret Sharing Lower Bound: Either Reconstruction is Hard or Shares are Long;Lecture Notes in Computer Science;2020

5. Secret-Sharing Schemes for General and Uniform Access Structures;Advances in Cryptology – EUROCRYPT 2019;2019