Smooth projective hashing and two-message oblivious transfer

Lecture Notes in Computer Science

Volumn 3494, Issue , 2005, Pages 78-95

  Kalai, Yael Tauman ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; CRYPTOGRAPHY; QUADRATIC PROGRAMMING; SECURITY OF DATA;

MESSAGES; SMOOTH PROJECTIVE HASHING; TRANSFER PROTOCOLS; TWO-MESSAGE OBLIVIOUS TRANSFER;

NETWORK PROTOCOLS;

EID: 24944473997     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11426639_5     Document Type: Conference Paper

References (21)

1. [AIR01] William Aiello, Yuval Ishai, Omer Reingold. Priced Oblivious Transfer: How to Sell Digital Goods. In EUROCRYPT 2001, pages 119-135, 2001.
2. [BS96] E.Bach and J. Shallit. Algorithmic Number Theory, Vol. 1: Efficient Algorithms. MIT Press, 1996.
3. [BM89] M. Bellare and S. Micali. Non-Interactive Oblivious Transfer and Applications. In CRYPTO '89, pages-547-557, 1989.
4. [CS98] R. Cramer and V.Shoup. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack. In CRYPTO 1998, pages 13-25, 1998.
5. [CS02] R. Cramer and V.Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In Eurocrypt 2002, Springer-Verlag (LNCS 2332), pages 45-64, 2002.
6. [Cre87] C. Crépeau. Equivalence between two flavours of oblivious transfers. In CRYPTO 1987, pages 350-354, 1987.
7. [CCM98] C. Cachin, C. Crépeau, Julien Marcil. Oblivious Transfer with a Memory-Bounded Receiver. In FOCS 1998, pages 493-502, 1998.
8. [DHRS04] Y. Z. Ding, D. Harnik, A. Rosen, R. Shaltiel. Constant-Round Oblivious Transfer in the Bounded Storage Model. In TCC 2004, pages 446-472,2004.
9. [Pr98] John B. Fraleigh. A first course in abstract algebra , 7th edition, Addison-Wesley 1998.
10. [EGL85] S. Even and O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. In Communications of the ACM 28:6, pages 637-647, 1985.
11. [GL03] R. Gennaro and Y. Lindell. A Framework for Password-Based Authenticated Key Exchange. In EUROCRYPT 2003, pages 524-543, 2003.
12. [Gol04] O. Goldreich. Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, 2004.
13. [GMW87] O. Goldreich and S. Micali and A. Wigderson. How to Play any Mental Game - A completeness Theorem for Protocols with Honest Majority. In STOC 1987, pages 218-229, 1987.
14. [Hai04] Iftach Haitner. Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations. In TCC 2004, pages 394-409, 2004.
15. [IR89] R. Impagliazzo and S. Rudich. Limits on the Provable Consequences of One-Way Permutations. In STOC 89, pages 44-61, 1989.
16. [KOY01] J. Katz, R. Ostrovsky, M. Yung. Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. In EUROCRYPT 2001, pages 475-494, 2001.
17. [Kil88] J. Kilian. Founding Cryptography on Oblivious Transfer. 20th ACM Symposium on the Theory of Computing, pages 20-31, 1988.
18. [NP01] M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In SODA 2001, pages 448-457,2001
19. [Pa99] P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT 1999, pages 223-238, 1999.
20. [Rab81] M. O. Rabin. How to Exchange Secrets by Oblivious Transfer. TR-81, Harvard, 1981.
21. [Y86] A. C. Yao. How to Generate and Exchange Secrets. In FOCS 1986, pages 162-167, 1986.