Implementing oblivious transfer using collection of dense trapdoor permutations

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

Volumn 2951, Issue , 2004, Pages 394-409

  Haitner, Iftach ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHIC PRIMITIVES; HEIDELBERG; NON-INTERACTIVE ZERO KNOWLEDGE; OBLIVIOUS TRANSFER; PUBLIC-KEY ENCRYPTION; SECURITY PROOFS; TRAPDOOR PERMUTATIONS;

CRYPTOGRAPHY;

EID: 24944508356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_22     Document Type: Article

References (17)

1. Manuel Blum, How to exchange (secret) keys, ACM Transactions on Computer Systems 1 (1983), no. 2, 175-193.
2. G. Brassard, C. Crepeau, and J.-M. Robert, Information theoretic reductions among disclosure problems, 27th Annual Symp. on Foundations of Computer Science (FOGS '86) (Los Angeles, Ca., USA), IEEE, October 1986, pp. 168-173.
3. C. Crépeau and J. Kilian, Weakening security assumptions and oblivious transfer, Advances in Cryptology (CRYPTO '88) (Berlin - Heidelberg - New York), Springer, August 1990, pp. 2-7.
4. C. Crépeau and M. Sántha, On the reversibility of oblivious transfer, Proceedings of Advances in Cryptology (EUROCRYPT '91) (Berlin, Germany) (Donald W. Davies, ed.), LNCS, vol. 547, Springer, April 1991, pp. 106-113.
5. Claude Crépeau, Equivalence between two flavours of oblivious transfers, Advances in Cryptology - CRYPTO '87 (Carl Pomerance, ed.), Lecture Notes in Computer Science, vol. 293, Springer-Verlag, 1988, 16-20 August 1987, pp. 350-354.
6. Ivan Damgård, Joe Kilian, and Louis Salvail, On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions, Lecture Notes in Computer Science 1592 (1999), 56-??
7. S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM 28 (1985), no. 6, 637-647.
8. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan, The relationship between public key encryption and oblivious transfer, 41st Annual Symp. on Foundations of Computer Science: proceedings: 12-14 November, 2000, Redondo Beach, California (IEEE, ed.), IEEE, 2000, pp. 325-335.
9. O. Goldreich and L. A. Levin, A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM Symp. on Theory of Computing, Seattle, Washington, May 15-17, 1989 (New York, NY, USA) (ACM, ed.), ACM Press, 1989, pp. 25-32.
10. O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game or A completeness theorem for protocols with honest majority, Proc. 19th Ann. ACM Symp. on Theory of Computing, 1987, pp. 218-229.
11. Oded Goldreich, Foundations of cryptography: Basic tools, Cambridge University Press, Cambridge, UK, 2001.
12. _, Foundations of cryptography - volume 2, Working Draft, available at www.wisdom.weizmann.ac.il/oded/foc-vol2.html, 2002.
13. Iftach Haitner, Implementing oblivious transfer using collection of dense trapdoor permutations, MSc thesis, available at www.wisdom.weizmann.ac.il/ ~iftachh/papers/msc.html, 2003.
14. Joe Kilian, Founding crytpography on oblivious transfer, Proceedings of the 20th Annual ACM Symp. on the Theory of Computing (Chicago, IL) (Richard Cole, ed.), ACM Press, May 1988, pp. 20-31.
15. M. O. Rabin, How to exchange secrets by oblivious transfer, TR-81, Harvard, 1981.
16. A. De Santis and G. Persiano, Zero-knowledge proofs of knowledge without interaction, 33rd Annual Symp. on Foundations of Computer Science: October 24-27, 1992, Pittsburgh, Pennsylvania: proceedings [papers] (Silver Spring, MD 20910, USA) (IEEE, ed.), IEEE, 1992, pp. 427-436.
17. Andrew C. Yao, How to generate and exchange secrets, Proceedings of the 27th Symp. on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1986, pp. 162-167.