Efficient dynamic-resharing “verifiable secret sharing” against mobile adversary

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

Volumn 979, Issue , 1995, Pages 523-537

  Alon, Noga ^a   Galil, Zvi ^b   Yung, Moti ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b Columbia University and Tel Aviv University ^*  (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VIRUSES; CRYPTOGRAPHY; VIRUSES;

DIRECT METHOD; DYNAMIC SHARING; KEY ESCROW; MOBILE ADVERSARY; NETWORK VIRUS; PUBLIC KEYS; TIME-PERIODS; VERIFIABLE SECRET SHARING;

RHENIUM COMPOUNDS;

EID: 84947770625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60313-1_168     Document Type: Conference Paper

References (26)

1. N. Alon, and D. Spencer, The Probabilistic Method, (1991),.John Wiley and Sons.
2. M. Bellare, S. Micli, and R. Ostrovsky, Perfect Zero Knowledge in Constant Rounds, Proceedings of tile 22th Annual Symposiunl on the Theory of Computing, 1990, pp. 482-493.
3. J. C. Benaloh and M. Yung, Distributing the Power of a Government to Enhance the Privacy of Voters.Proc. of the 5th ACM Symposium on the Principles in Distributed Computing, 1986, pp. 52-62.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," ACM STOC 1988, 1-9.
5. G.R. Blakley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48), 1979, pp 313-317.
6. G. Bracha, An O(log N) Expected Round Randomized Byzantine Generals Protocol, Proc. of CM STOC 1985.
7. R. Canetti and A. Herzberg, Maintaining Security in the Presence of Transient Faults, Crypto 94.
8. D. C. haum, C. Crépeau, and I. Damgård "Multiparty unconditionally secure protocols," ACM STOC,1988, 11-19.
9. B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Verifiable Secret Sharing and Achieving Simultaeous Broadcast, Proc. of IEEE Focs 198,5, pp. 335-344.
10. J. Cohen and M. Fischer, A robust and verifiable cryptographically secure election scheme, Proc. 26th Annual Symposium on the Foundations of Computer Science, 1985, pp 372-382.
11. W. Diffie and M. Helhnan, New Directions in Cryptography, IEEE Trans. on Information Theory 22 (6), 1976, pp. 644-654.
12. P. Feldmaal, A Practical Scheme for Non.Interactive Verifiable Secret Sharing, Proc. of the 28th IEEE Symposium on the Foundations of C, omputer Science, 1987, 427-437
13. Z. Galil, S. Haber and M. Yung, Minimum-Knowledge Interactive Proof. for Decision Problems, SIAM J. Comp., 18, 1989, pp 711-739.
14. Z. Galil, S. Haber, and M. Yung, "Cryptographic computation: secure faulttolerant protocols and the public-key model," Crypto 87.
15. O. Goldreichl, S. Micali, and A. Wigderson, How to play any mental game, Proceedings of the Nineteenth annual ACM Syrup. Theory of C, omputing, 1987, pp 218-229.
16. S. Goldwasser and S. Micafi, Probabilistie Encryption, J. C, om. Sys. Sci. 28 (1984), pp 270-299.
17. S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Siam J. on Computing, 18(1) (1989), pp 186-208.
18. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, Proactive Secret Sharing, or how to cope with perpetual leakage, Crypto 95.
19. A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk, M. Yung, Proactive Public-Key and Signature Schemes, Manuscript.
20. S. Micafi, Fair public-key cryptosystems, Crypto '92.
21. R. Ostrovsky and M Yung, How to withstand mobile virus attacks, Proc. of the 10th AC, M Symposium on the Principles in Distributed Coinputing, 1991, pp. 51-61.
22. T. P. Pedersen, Distributed Provers with Applications to Undeniable Signature, Eurocrypt '91. 1991.
23. R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. Of AC.M, 21 (1978), pp 120-126.
24. A. Shamir. How to share a secret, Commun. ACM, 22 (1979), pp 612-613.
25. T. Rabin and M. Ben-Or, Verifiable Secret Sharing and Multiparty Protocols with Hone.st Majority, STOC 1989, ACM, pp. 73-85.
26. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application, In G..I. Simmons, editor, Contemporary Cryptology, pp. 441-497. IEEE Press, 1992.