Practical oblivious transfer protocols

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

Volumn 2578, Issue , 2003, Pages 415-426

  Tobias, Christian ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CRYPTOGRAPHIC PROTOCOLS; DECISIONAL DIFFIE HELLMAN ASSUMPTION; OBLIVIOUS TRANSFER; OBLIVIOUS TRANSFER PROTOCOLS;

COMPUTATIONAL COMPLEXITY;

EID: 35248831111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36415-3_27     Document Type: Article

References (17)

1. B. Aiello, Y. Ishai, O. Reingold, "Priced Oblivious Transfer: How to Sell Digital Goods", Advances in Cryptology - Eurocrypt 2001, LNCS 2045, pp. 119-135
2. D. Beaver, "How to Break a 'Secure' Oblivious Transfer Protocol", Advances in Cryptology - Crypto '92, LNCS 658, pp. 285-296
3. M. Bellare, P. Rogaway, "Random Oracles are Practical: a paradigm for designing efficient protocols", Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62-73, Fairfax (Virginia) USA, 1993, ACM Press
4. R. Canetti, "Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information", Proceedings of Advances in Cryptology - Crypto '97, pp. 455-469
5. R. Canetti, O. Goldreich, S. Halevi, "The Random Oracle Methodology, Revisited", Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC) 1998, pp. 209-218, ACM Press
6. C. Dwork, M. Naor, O. Reingold, L. Stockmeyer, "Magic Functions", Proceedings of the 40th Symposium of Foundations of Computer Science (FOCS) 1999, pp. 523-534
7. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms", Advances in Cryptology - Crypto '84, LNCS 196
8. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms" IEEE Transactions on Information Theory, 31 (1985), An earlier version appeared in [7]
9. O. Goldreich, "Secure Multi-Party Computation", Working Draft, Version 1.2, March 2000
10. O. Goldreich, M. Micali, A. Widgerson, "How to Play any Mental Game", Proceedings of the 19th ACM symposium on Theory of Computing (STOC), 1987, pp. 218-299
11. J. Kilian, "Founding Cryptography on Oblivious Transfer", Proceedings of the 20th ACM Symposium on Theory of Computing, 1988, pp. 20-31
12. M. Naor, B. Pinkas, "Oblivious Transfer and Polynomial Evaluation", Proceedings of the 31st ACM symposium on Theory of Computing (STOC), 1999, pp. 245-254
13. M. Naor, B. Pinkas, "Privacy Preserving Auctions and Mechanism Design", Proceedings of the 1st ACM Conference on Electronic Commerce, 1999, pp 129-139
14. M. Naor, B. Pinkas, "Efficient Oblivious Transfer Protocols", Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2001, pp. 448-457
15. M. Naor, O. Reingold, "Number-Theoretic Constructions of Efficient Pseudo-Random Functions", Proceedings of the 38th Symposium of Foundations of Computer Science (FOCS) 1997, pp. 458-467
16. W. Tzeng, "Efficient 1-out-n oblivious transfer schemes", Workshop on Practice and Theory in Public-Key Cryptography (PKC 02), LNCS, 2002
17. A.C. Yao, "How to Generate and Exchange Secrets", Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 162-167