Unconditionally secure proactive secret sharing scheme with combinatorial structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1758, Issue , 2000, Pages 200-214

  Stinson, Douglas R ^a   Wei, R ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMBINATORIAL METHOD; COMBINATORIAL STRUCTURES; PROACTIVE SECRET SHARING SCHEMES; SECRET SHARING SCHEMES; TIME-PERIODS; UNCONDITIONALLY SECURE; VERIFIABLE SECRET SHARING SCHEME;

CRYPTOGRAPHY;

EID: 84944048103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46513-8_15     Document Type: Conference Paper

References (26)

1. N. Alon, Z. Galil and M. Yung, Eficient dynamic-resharing “verifiable secret shar-ing" against mobile adversary, European Symposium on Algorithms (ESA) 95, LNCS 979, 523-537.
2. J. C. Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret, Advances in Cryptology-Crypto'86, LNCS 263, 1987, 251-260.
3. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations, Proc. 20th Annual Symp. on the Theory of Computing, ACM, 1988, 1-10.
4. G.R. Blackley, Safeguarding cryptographic keys. Proc. Nat. Computer Conf. AFIPS Conf. Proc., 1979, 313-317.
5. R. Blom, An optimal class of symmetric key generation systems, Eurocrypt'84, LNCS 209, (1985), 335-338.
6. R. Canetti and A. Herzberg, Maintaining security in the presence of transient faults, Crypto'94, LNCS 839, 1994.
7. D. Chaum, C. Crepeau and I. Damgard, Multiparty Unconditionally Secure Pro-tocols, Proc. 20th Annual Symp. on the Theory of Computing, ACM, 1988, 11-19.
8. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Veri_able Secret Sharing and Achieving Simultaneity in Presence of Faults, Proc. 26th Annual Symp. on the Foundations of Computing Science, IEEE, 1985, 383-395.
9. P. Feldman, A Practical Scheme for Non-Interactive Veri_able Secret sharing, Proc. 28th Annual Symp. on the Foundations of Computing Science, IEEE, 1987, 427-437.
10. P. Feldman and S. Micali, An Optimal Algorithm for Synchronous Byzantine Agreement, Proc. 20th Annual Symp. on Theory of Computing, ACM, 1988, 148-161.
11. Y. Frankel, P. Gemmel, P. D. MacKenzie and M. Yung, Proactive RSA, Crypto'97, LNCS 1294, 440-452.
12. R. Gennaro, M. O. Rabin and T. Rabin, Simpli_ed VSS and fast-track multiparty computations with applications to threshold cryptography, Proc. of 17th ACM Symp. on Principles of Distributed Computing, (1998), 101-111.
13. O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, 38(1991), 691-729.
14. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung, Proactive public key and signature systems, The 4th ACM Symp. on Comp. and Comm. Security, April 1997.
15. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung, Proactive secret sharing or: How to cope with perpetual leakage, Crypto'95, LNCS 963339-352.
16. I. Ingemarsson and G. J. Simmons, A protocol to set up shared secret schemes without the assistance of a mutually trusted party, Eurocrypt'90, LNCS 473, 1990, 266-282.
17. R. J. McEliece and D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, 24(1981), 583-584.
18. R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, ACM Sympo-sium on principles of distributed computing, 1991, 51-59.
19. T. P. Pedersen, Non-interactive and information-theoretic secret sharing, Advances in Cryptology - Crypto'91, LNCS 576, 1991, 129-140.
20. T. Rabin, Robust sharing of secrets when the dealer is honest or faulty, Journal of the ACM, 41(1994), 1089-1109.
21. T. Rabin, A simplified approach to threshold and proactive RSA, Crypto'98, LNCS 1462, 1998, 89-104.
22. T. Rabin and M. Ben-Or, Veri_able secret sharing and multiparty protocols with honest majority, Proc. 21st Annual Sympo. on the Theory of Computing, ACM, 1989, 73-85.
23. A. Shamir, How to share a secret, Commun. ACM, 22(1979), 612-613.
24. R. S. Rees, D. R. Stinson, R. Wei and G. H. J. van Rees, An application of covering designs: determining the maximum consistent set of shares in a threshold scheme, Ars Combin., to appear.
25. D. R. Stinson, Cryptography Theory and Practice, CRC Press, 1995.
26. M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology, 1(1988), 133-138.