Secure computation without authentication

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

Volumn 3621 LNCS, Issue , 2006, Pages 361-377

  Barak, Boaz ^a   Canetti, Ran ^b   Lindell, Yehuda ^c   Pass, Rafael ^d   Rabin, Tal ^b  

^a IAS ^*

^b IBM RESEARCH   (United States)

^c BAR ILAN UNIVERSITY   (Israel)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADVERSARY; AUTHENTICATED-CHANNEL SETTING; SECURE MULTIPARTY COMPUTATION; STRING MODELS;

CHANNEL CAPACITY; COMPUTER SIMULATION; CRYPTOGRAPHY; DATA PRIVACY; MATHEMATICAL MODELS; MULTI AGENT SYSTEMS; NETWORK PROTOCOLS;

SECURITY OF DATA;

EID: 33745126318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (25)

1. B. Barak. How to Go Beyond the Black-box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-cryptographic Fault-Tolerant Distributed Computations. In 20th STOC, pages 1-10, 1988.
3. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
4. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001. Full version available at http://eprint.iacr.org/2000/067.
5. R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO 2001, Springer-Verlag (LNCS 2139), pages 19-40, 2001.
6. R. Canetti, S. Halevi, J. Katz, Y. Lindell and P. MacKenzie. Universally Composable Password-Based Key Exchange. In EUROCRYPT 2005, Springer-Verlag (LNCS 3494), pages 404-421, 2005.
7. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. In EUROCRYPT '03, Springer-Verlag (LNCS 2656), pages 68-86, 2003.
8. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Secure Computation. In 34th STOC, pp. 494-503, 2002.
9. R. Canetti and T. Rabin. Universal Composition with Joint State. In CRYPTO 2003, Springer-Verlag (LNCS 2729), pages 265-281, 2003.
10. D. Chaum, C. Crepeau and I. Damgard. Multiparty Unconditionally Secure Protocols. In 20th STOC, pages 11-19, 1988.
11. D. Dolev, C. Dwork and M. Naor. Non-malleable Cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
12. C. Dwork and M. Naor. Pricing via Processing or Combating Junk Mail. In CRYPTO'92, Springer-Verlag (LNCS 740), pages 139-147, 1992.
13. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein and A. Smith. Detectable Byzantine Agreement Secure Against Faulty Majorities. 21st PODC, pp. 118-126, 2002.
14. O. Goldreich and Y. Lindell. Session-Key Generation Using Human Passwords Only. In CRYPTO 2001, Springer-Verlag (LNCS 2139), pages 408-432, 2001.
15. S. Goldwasser, S. Micali and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. on Computing, 17(2):281-308, 1988.
16. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof-Systems. SIAM Journal on Computing, 18(1):186-208, 1989.
17. O. Goldreich, S. Micali and A. Wigderson. How to Play Any Mental Game. In 19th STOC, pages 218-229, 1987.
18. O. Goldreich. Foundations of Cryptography - Vol. 1. Cambridge Univ. Press, 2001.
19. O. Goldreich. Foundations of Cryptography - Vol. 2. Cambridge Univ. Press, 2004.
20. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683-692, 2003.
21. Y. Lindell. Lower Bounds for Concurrent Self Composition. In 1st TCC, Springer-Verlag (LNCS 2951), pages 203-222, 2004.
22. M. Nguyen and S. Vadhan. Simpler Session-Key Generation from Short Random Passwords. In 1st TCC, Springer-Verlag (LNCS 2951), pages 428-445, 2004.
23. R. Pass. Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In 36th STOC, pages 232-241, 2004.
24. R. Pass and A. Rosen Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 44th FOCS, pages 404-413, 2003.
25. A.C. Yao. How to Generate and Exchange Secrets. 27th FOCS, pp. 162-167, 1986.