An oblivious transfer protocol with log-squared communication

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

Volumn 3650 LNCS, Issue , 2005, Pages 314-328

  Lipmaa, Helger ^a,b  

^a CYBERNETICA AS   (Estonia)

^b UNIVERSITY OF TARTU   (Estonia)

Author keywords

Computationally private information retrieval; Length flexible additively homomorphic public key cryptosystem; Oblivious transfer

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATION THEORY; CRYPTOGRAPHY; INFORMATION RETRIEVAL; SECURITY OF DATA;

ASYMPTOTIC COMMUNICATION; COMPUTATIONALLY-PRIVATE INFORMATION RETRIEVAL; LENGTH-FLEXIBLE ADDITIVELY HOMOMORPHIC PUBLIC-KEY CRYPTOSYSTEM; OBLIVIOUS TRANSFER;

NETWORK PROTOCOLS;

EID: 33645970169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11556992_23     Document Type: Conference Paper

References (12)

1. [AIR01] William Aiello, Yuval Ishai, and Omer Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In Birgit Pfitzmann, editor, Advances in Cryptology - EURO-CRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 119-135, Innsbruck, Austria, May 6-10, 2001. Springer-Verlag.
2. [Cha04] Yan-Cheng Chang. Single Database Private Information Retrieval with Logarithmic Communication. In Josef Pieprzyk and Huaxiong Wang, editors, The 9th Australasian Conference on Information Security and Privacy (ACISP 2004), volume 3108 of Lecture Notes in Computer Science, pages 50-61, Sydney, Australia, July 13-15, 2004. Springer-Verlag.
3. [CMS99] Christian Cachin, Silvio Micali, and Markus Stadler. Computational Private Information Retrieval with Polylogarithmic Communication. In Jacques Stem, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 402-414, Prague, Czech Republic, May 2-6, 1999. Springer-Verlag.
4. [DJ01] Ivan Damgård and Mads Jurik. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Kwangjo Kim, editor, Public Key Cryptography 2001, volume 1992 of Lecture Notes in Computer Science, pages 119-136, Cheju Island, Korea, February 13-15, 2001. Springer-Verlag.
5. [DJ03] Ivan Damgård and Mads Jurik. A Length-Flexible Threshold Cryptosystem with Applications. In Rei Safavi-Naini, editor, The 8th Australasian Conference on Information Security and Privacy, volume 2727 of Lecture Notes in Computer Science, pages 350-364, Wollongong, Australia, July 9-11, 2003. Springer-Verlag.
6. [KO97] Eyal Kushilevitz and Rafail Ostrovsky. Replication is Not Needed: Single Database, Computationally-Private Information Retrieval. In 38th Annual Symposium on Foundations of Computer Science, pages 364-373, Miami Beach, Florida, October 20-22, 1997. IEEE Computer Society.
7. [LAN02] Helger Lipmaa, N. Asokan, and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. In Matt Blaze, editor, Financial Cryptography - Sixth International Conference, volume 2357 of Lecture Notes in Computer Science, pages 87-101, Southampton Beach, Bermuda, March 11-14, 2002. Springer-Verlag.
8. [Lip04] Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Total Communication. Technical Report 2004/063, International Association for Cryptologic Research, February 25, 2004.
9. [NP99] Moni Naor and Benny Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, pages 245-254, Atlanta, Georgia, USA, May 1-4, 1999. ACM Press.
10. [NP01] Moni Naor and Benny Pinkas. Efficient Oblivious Transfer Protocols. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 448-457, Washington, DC, USA, January 7-9, 2001. ACM Press.
11. [Pai99] Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 223-238, Prague, Czech Republic, May 2-6, 1999. Springer-Verlag.
12. [Ste98] Julien P. Stern. A New and Efficient All or Nothing Disclosure of Secrets Protocol. In Kazuo Ohta and Dingyi Pei, editors, Advances on Cryptology - ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pages 357-371, Beijing, China, October 18-22, 1998. Springer-Verlag.