Size of Shares and Probability of Cheating in Threshold Schemes-Reference-Cited by-同舟云学术

Size of Shares and Probability of Cheating in Threshold Schemes

Published:1994 Issue: Volume: Page:118-125
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT ’93
language:
Short-container-title:

Author:

Carpentieri Marco,De Santis Alfredo,Vaccaro Ugo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48285-7_10

Reference20 articles.

1. M. Ben-Or, T. Rabin Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. 21st ACM Symposium on Theory of Computing, pp. 73–85, 1989.

2. G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313–317, 1979.

3. Lect Notes Comput Sci;C. Blundo,1992

4. Lect Notes Comput Sci;C. Blundo,1992

5. E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol.4, 123–134, 1991.

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

1. A Cryptanalysis against the Cheating Detectable Secret Sharing from NISS 2019;2023 Eleventh International Symposium on Computing and Networking (CANDAR);2023-11-28

2. Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing;Cryptology and Network Security;2023

3. Simple Approach to Realizing Verifiable Secret Sharing for Secure Cloud System;IEEE Access;2022

4. Outsourced cheating detection for secret sharing;International Journal of Information Security;2021-01-25

5. Leakage Resilient Cheating Detectable Secret Sharing Schemes;Information Security and Privacy;2021