Secure computation without authentication

Journal of Cryptology

Volumn 24, Issue 4, 2011, Pages 720-760

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

^a MICROSOFT RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c BAR ILAN UNIVERSITY   (Israel)

^d Department of Obstetrics Gynecology   (United States)

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

Author keywords

Man in the middle attacks; Multiparty computations; Partially authenticated networks; Password authentication; Unauthenticated channels; Universal composability (UC)

Indexed keywords

MAN IN THE MIDDLE ATTACKS; MULTIPARTY COMPUTATION; PASSWORD AUTHENTICATION; UNAUTHENTICATED CHANNELS; UNIVERSAL COMPOSABILITY;

AUTHENTICATION; CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 80053053264     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-010-9075-9     Document Type: Article

References (28)

1. M. Ben-Or, S. Goldwasser, A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computations, in 20th STOC, pp. 1-10, 1988
2. J. Camenisch, N. Casati, T. Gross, V. Shoup, Credential authenticated identification and key exchange, in Crypto'10, 2010
3. R. Canetti 2000 Security and composition of multiparty cryptographic protocols J. Cryptol. 13 1 143 202 1732900 0957.68040 10.1007/s001459910006
4. R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd FOCS, pp. 136-145, 2001. The full version is available for download from http://eprint.iacr.org/2000/067 (Pubitemid 33068374)
5. R. Canetti, Y. Dodis, R. Pass, S. Walfish, Universally composable security with pre-existing setup, in The Fourth Theory of Cryptology Conference (TCC). LNCS, vol. 4392 (Springer, Berlin, 2007), pp. 61-85
6. R. Canetti, M. Fischlin, Universally composable commitments, in CRYPTO 2001. LNCS, vol. 2139 (Springer, Berlin, 2001), pp. 19-40 (Pubitemid 33317906)
7. R. Canetti S. Halevi A. Herzberg 2000 Maintaining authenticated communication J. Cryptol. 13 1 61 105 1732898 0957.68043 10.1007/s001459910004
8. R. Canetti, S. Halevi, J. Katz, Y. Lindell, P. MacKenzie, Universally composable password-based key exchange, in EUROCRYPT 2005. LNCS, vol. 3494 (Springer, Berlin, 2005), pp. 404-421 (Pubitemid 41313966)
9. R. Canetti, E. Kushilevitz, Y. Lindell, On the limitations of universally composable two-party computation without set-up assumptions, in EUROCRYPT '03. LNCS, vol. 2656 (Springer, Berlin, 2003), pp. 68-86
10. R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in 34th STOC, pp. 494-503, 2002 (Pubitemid 35009410)
11. R. Canetti, T. Rabin, Universal composition with joint state, in CRYPTO 2003. LNCS, vol. 2729 (Springer, Berlin, 2003), pp. 265-281 (Pubitemid 137636947)
12. D. Chaum, C. Crepeau, I. Damgard, Multiparty unconditionally secure protocols, in 20th STOC, pp. 11-19, 1988
13. D. Dolev C. Dwork 2000 Non-malleable cryptography SIAM J. Comput. 30 2 391 437 1769364 0963.68067 10.1137/S0097539795291562
14. C. Dwork, M. Naor, Pricing via processing or combating junk mail, in CRYPTO'92. LNCS, vol. 740 (Springer, Berlin, 1992), pp. 139-147
15. M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, A. Smith, Detectable byzantine agreement secure against faulty majorities, in 21st PODC, pp. 118-126, 2002
16. O. Goldreich, Foundations of Cryptography, vol. 2 (Cambridge University Press, Cambridge, 2004)
17. O. Goldreich, Y. Lindell, Session-key generation using human passwords only, in CRYPTO 2001. LNCS, vol. 2139 (Springer, Berlin, 2001), pp. 408-432 (Pubitemid 33317928)
18. S. Goldwasser S. Micali 1988 A digital signature scheme secure against adaptive chosen-message attacks SIAM J. Comput. 17 2 281 308 935341 0644.94012 10.1137/0217017
19. S. Goldwasser S. Micali C. Rackoff 1989 The knowledge complexity of interactive proof-systems SIAM J. Comput. 18 1 186 208 978174 0677.68062 10.1137/0218012
20. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in 19th STOC, pp. 218-229, 1987
21. S. Halevi H. Krawczyk 1999 Public-key cryptography and password protocols ACM Trans. Inf. Syst. Secur. 2 3 230 268 10.1145/322510.322514
22. Y. Lindell, Bounded-concurrent secure two-party computation without setup assumptions, in 35th STOC, pp. 683-692, 2003
23. Y. Lindell, Lower bounds for concurrent self composition, in 1st TCC. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 203-222
24. M. Nguyen, S. Vadhan, Simpler session-key generation from short random passwords, in 1st TCC. LNCS, vol. 2951 (Springer, Berlin, 2004), pp. 428-445
25. R. Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in 36th STOC (Springer, Berlin, 2004), pp. 232-241
26. R. Pass, A. Rosen, Bounded-concurrent secure two-party computation in a constant number of rounds, in 44th FOCS, pp. 404-413, 2003
27. V. Shoup, On formal models for secure key exchange. IBM Research Report RZ 3120 (April 1999). Revised version appears at www.shoup.net
28. A.C. Yao, How to generate and exchange secrets, in 27th FOCS, pp. 162-167, 1986