Optimal reductions between oblivious transfers using Interactive Hashing

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

Volumn 4004 LNCS, Issue , 2006, Pages 201-221

  Crépeau, Claude ^a   Savvides, George ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Interactive hashing; Oblivious transfer; Privacy amplification

Indexed keywords

DATA PRIVACY; INTERACTIVE COMPUTER SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA;

INTERACTIVE HASHING; OBLIVIOUS TRANSFER; PRIVACY AMPLIFICATION;

CRYPTOGRAPHY;

EID: 33746042169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11761679_13     Document Type: Conference Paper

References (14)

1. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Generalized privacy amplification. IEEE Trans. on Info. Theory, 41(6):1915-1923, November 1995.
2. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM J. Comput., 17(2):210-229, 1988.
3. G. Brassard, C. Crépeau, and S. Wolf. Oblivious transfers and privacy amplificar tion. IEEE Transaction on Information Theory, 16(4):219-237, 2003.
4. G. Brassard, C. Crépeau, and M. Santha. Oblivious transfers and intersecting codes. IEEETIT: IEEE Transactions on Information Theory, 42, 1996.
5. C. Cachin, C. Crépeau, and J. Maxell. Oblivious transfer with a memory-bounded receiver. In IEEE Symposium on Foundations of Computer Science, 1998.
6. Y. Zong Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In TCC, pages 446-472, 2004.
7. Y. Dodis and S. Micali. Lower bounds for oblivious transfer reductions. Lecture Notes in Computer Science, 1592, 1999.
8. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6):637-647, 1985.
9. Joe Kilian. Founding crytpography on oblivious transfer. In STOC '88: Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 20-31, New York, NY, USA, 1988. ACM Press.
10. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology, 11(2), 1998.
11. R. Ostrovsky, R. Venkatesan, and M. Yung. Fair games against an all-powerful adversary. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 13, 1993.
12. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
13. D.R. Stinson. Some results on nonlinear zigzag functions. Journal of Combinatorial Mathematics and Combinatorial Computing, 29:127-138, 1999.
14. S. Wiesner. Conjugate coding. SIGACT News, 15(1):78-88, 1983.