A framework for efficient and composable oblivious transfer

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

Volumn 5157 LNCS, Issue , 2008, Pages 554-571

  Peikert, Chris ^a   Vaikuntanathan, Vinod ^b   Waters, Brent ^a  

^a SRI INTERNATIONAL   (United States)

^b Architecture Machine Group

Author keywords

[No Author keywords available]

Indexed keywords

BIT OPERATIONS; CIPHER TEXTS; CRYPTOLOGY; CRYPTOSYSTEMS; DIFFIE-HELLMAN ASSUMPTIONS; DUAL MODES; ENCRYPTION AND DECRYPTION; GENERAL FRAMEWORK; MULTI-BIT; OBLIVIOUS TRANSFER; PUBLIC KEY; PUBLIC KEYS; RANDOM STRINGS; SECURITY PARAMETERS; SPACE COMPLEXITIES; TECHNICAL CONTRIBUTION; UNIVERSALLY COMPOSABLE;

CHLORINE COMPOUNDS; LAWS AND LEGISLATION; PARAMETER ESTIMATION; STANDARDS;

CRYPTOGRAPHY;

EID: 51849126892     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85174-5_31     Document Type: Conference Paper

References (34)

1. Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119-135. Springer, Heidelberg (2001)
2. Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 13, 1-32 (2004); Preliminary version in STOC 1996
3. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average- case equivalence. In: STOC, pp. 284-293 (1997)
4. Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 573-590. Springer, Heidelberg (2007)
5. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136-145 (2001)
6. Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001)
7. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494-503 (2002)
8. Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265-281. Springer, Heidelberg (2003)
9. Cocks, C.: An identity based encryption scheme based on quadratic residues. In: IMA Int. Conf, pp. 360-363 (2001)
10. Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45-64. Springer, Heidelberg (2002)
11. Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350-354. Springer, Heidelberg (1988)
12. Damgård, I., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247-264. Springer, Heidelberg (2003)
13. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647 (1985)
14. Garay, J.A., MacKenzie, P.D., Yang, K.: Efficient and universally composable committed oblivious transfer and applications. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 297-316. Springer, Heidelberg (2004)
15. Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC (to appear, 2008), http://eprint.iacr.org/2007/432
16. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229 (1987)
17. Green, M., Hohenberger, S.: Blind identity-based encryption and simulatable oblivious transfer. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 265-282. Springer, Heidelberg (2007)
18. Green, M., Hohenberger, S.: Universally composable adaptive oblivious transfer. Cryptology ePrint Archive, Report 2008/163 (2008), http://eprint.iacr.org/
19. Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339-358. Springer, Heidelberg (2006)
20. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
21. Jarecki, S., Shmatikov, V.: Efficient two-party secure computation on committed inputs. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 97-114. Springer, Heidelberg (2007)
22. Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 78-95. Springer, Heidelberg (2005)
23. Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20-31 (1988)
24. Kol, G., Naor, M.: Cryptography and game theory: Designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 320-339. Springer, Heidelberg (2008)
25. Lindell, Y.: Efficient fully simulatable oblivious transfer. In: Malkin, T. (ed.) CTRSA 2008. LNCS, vol. 4964. Springer, Heidelberg (2008)
26. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measures. SIAM J. Comput. 37(1), 267-302 (2007); Preliminary version in FOCS 2004
27. Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: CRYPTO. LNCS, pp. 573-590. Springer, Heidelberg (1999)
28. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448-457 (2001)
29. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC (to appear, 2008), http://eprint.iacr.org/2007/279
30. Rabin, M.O.: How to exchange secrets by oblivious transfer. Technical report, Harvard University (1981)
31. Regev, O.: New lattice-based cryptographic constructions. J. ACM 51(6), 899-942 (2004)
32. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84-93 (2005)
33. Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484-1509 (1997)
34. Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986)