An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

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

Volumn 1592, Issue , 1999, Pages 90-106

  Goldwasser, Shafi ^b  

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

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; DECISIONAL DIFFIE HELLMAN; MULTIPARTY COMPUTATION; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; RANDOM ORACLE; RANDOM ORACLE MODEL; SINGLE SERVER;

CRYPTOGRAPHY;

EID: 84957712291     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48910-X_7     Document Type: Conference Paper

References (41)

1. D. Beaver, “Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority", J. Cryptology (1991) 4: 75-122.
2. D. Beaver and J. Feigenbaum, “Hiding instances in multi-oracle queries", STACS, 1990.
3. D. Beaver and S. Haber, “Cryptographic Protocols Provably secure Against Dynamic Adversaries", Eurocrypt, 1992.
4. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, “Relations among notions of security for public-key encryption schemes", CRYPTO '98, 1998, pp. 26-40.
5. M. Bellare and P. Rogaway, “Optimal Asymmetric Encryption", Eurocrypt '94 (LNCS 950), 92-111, 1995.
6. M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation", 20th STOC, 1988, pp. 1-10.
7. M. Blaze, J. Feigenbaum and M. Naor, “A formal treatment of remotely keyed encryption", Eurocrypt '98, 1998, pp. 251-165.
8. S. Brands, “An efficient off-line electronic cash system based on the representa- tion problem", CWI TR CS-R9323, 1993.
9. R. Canetti, “Security and composition of multi-party protocols", Available at the Theory of Cryptography Library, http://philby.ucsd.edu, 1998.
10. R. Canetti, U. Feige, O. Goldreich and M. Naor, “Adaptively Secure Computa- tion", 28th STOC, 1996. Fuller version in MIT-LCS-TR #682, 1996.
11. R. Canetti and A. Herzberg, “Maintaining security in the presence of transient faults", CRYPTO'94, 1994.
12. R. Canetti and S. Goldwasser, “A threshold public-key cryptosystem secure against chosen ciphertext attacks", Available at the Theory of Cryptography Library, http://philby.ucsd.edu, 1999.
13. D. Chaum, C. Crepeau, and I. Damgard, “Multi-party Unconditionally Secure Protocols", 20th STOC, 1998, pp. 11-19.
14. D. Chaum, E. Everetse and J. van der Graaf, “An improved protocol for demon- strating possession of discrete logarithms and some generalizations", Eurocrypt '87,, LNCS 304, 1987, pp. 127-141.
15. D. Chaum, A. Fiat and M. Naor, “Untraceable electronic cash", CRYPTO '88, LNCS 403, 1988, pp. 319-327.
16. D. Chaum and T. Pedersen, “Wallet databases with observers", CRYPTO '92, 1992, pp. 89-105.
17. R. Cramer and V. Shoup, “A paractical public-key cryptosystem provably secure against adaptive chosen ciphertext attack", CRYPTO '98, 1998.
18. Y. Desmedt and Y. Frankel, “Threshold cryptosystems", Crypto '89 (LNCS 435), 1989, pages 307-315.
19. D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, 23rd STOC, 1991.
20. P. Feldman, “A practical scheme for non-interactive Veriffiable Secret Sharing", 28th FOCS, 1987, pp. 427-437.
21. A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identiffi- cation and signature problems", CRYPTO'86 (LNCS 263), 186-194, 1986.
22. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Secure Distributed Key Generation for Discrete-Log Based Cryptosystems", these proceedings.
23. J. Garay, R. Gennaro, C. Jutla and T. Rabin, “Secure Distributed Storage and Retrieval" Proceedings of 11th International Workshop on Distributed Algo- rithms (WDAG97) Lecture Notes in Computer Science 1320, pp. 275-289, 1997.
24. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Robust and efficient shar- ing of RSA functions, CRYPTO '96, 1996, pp. 157-172.
25. R. Gennaro and V. Shoup, “Securing threshold cryptosystems against chosen ciphertext attack", Eurocrypt '98, 1998, pp. 1-16.
26. O. Goldreich, S. Micali and A. Wigderson, “How to Play any Mental Game", 19th STOC, 1987, pp. 218-229.
27. S. Goldwasser, and L. Levin, “Fair Computation of General Functions in Pres- ence of Immoral Majority", CRYPTO, 1990.
28. S. Goldwasser and S. Micali, “Probabilistic encryption", JCSS, Vol. 28, No 2, April 1984, pp. 270-299.
29. A. Herzberg, S. Jarecki, H. Krawczyk and M. Yung “Proactive Secret Sharing or: How to Cope with Perpetual Leakage", CRYPTO '95, LNCS 963, 1995. pp. 339-352.
30. F. J. Macwiliams and N. J. A. Sloane, “The Theory of Error Correcting Codes", North-Holland, 1977.
31. S. Micali and P. Rogaway, “Secure Computation", unpublished manuscript, 1992. Preliminary version in CRYPTO 91.
32. M. Naor, B. Pinkas, and O. Reibgold “Distributed Pseudo-random Functions and KDCs", these proceedings.
33. M. Naor and M. Yung, “Public key cryptosystems provably secure against chosen ciphertext attacks", 22nd STOC, 427-437, 1990.
34. R. Ostrovsky and M. Yung. “How to withstand mobile virus attacks". 10th PODC, 1991, pp. 51-59.
35. T. Pedersen, “A threshold cryptosystem without a trusted party", Eurocrypt '91, 1991, pp. 522-526.
36. T. Pedersen. Distributed provers with applications to undeniable signatures. Eurocrypt '91, 1991.
37. T. Rabin and M. Ben-Or, “Veriffiable Secret Sharing and Multi-party Protocols with Honest Majority", 21st STOC, 1989, pp. 73-85.
38. C. Racko_ and D. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack", CRYPTO '91, 1991.
39. A. Shamir. “How to Share a Secret", Communications of the ACM, 22:612-613, 1979.
40. C. Schnorr, “Efficient signature generation by smart cards", J. Cryptology 4:161- 174, 1991.
41. M. Sudan, “Algorithmic issues in coding theorey", 17th Conf. on Foundations of Software Technology and Theoretical Computer Science, Kharapur, India, 1997. Available on-line at theory.lcs.mit.edu/~madhu/