Oblivious-transfer amplification

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

Volumn 4515 LNCS, Issue , 2007, Pages 555-572

  Wullschleger, Jürg ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Computational weak oblivious transfer; Distributed leftover hash lemma; Hard core lemma; Oblivious transfer amplification; Universal oblivious transfer; Weak oblivious transfer

Indexed keywords

DATA TRANSFER; INFORMATION THEORY; SECURITY OF DATA; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE; THEOREM PROVING;

COMPUTATIONAL WEAK OBLIVIOUS TRANSFER; DISTRIBUTED LEFTOVER HASH LEMMA; HARD CORE LEMMA; OBLIVIOUS TRANSFER AMPLIFICATION; UNIVERSAL OBLIVIOUS TRANSFER; WEAK OBLIVIOUS TRANSFER;

CRYPTOGRAPHY;

EID: 38049160265     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_32     Document Type: Conference Paper

References (43)

1. D. Beaver. Foundations of secure interactive computing. In Advances in Cryptology - CRYPTO '91, volume 1233 of LNCS, pages 377-391. Springer-Verlag, 1992.
2. D. Beaver. Precomputing oblivious transfer. In Advances in Cryptology - EUROCRYPT '95, volume 963 of LNCS, pages 97-109. Springer-Verlag, 1995.
3. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41, 1995.
4. C. H. Bennett, G. Brassard, C. Crépeau, and H. Skubiszewska. Practical quantum oblivious transfer. In Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pages 351-366. Springer, 1992.
5. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
6. G. Brassard and C. Crépeau. Oblivious transfers and privacy amplification. In Advances in Cryptology -EUROCRYPT '97, volume 1233 of LNCS, pages 334-347. Springer-Verlag, 1997.
7. G. Brassard, C. Crépeau, and S. Wolf. Oblivious transfers and privacy amplification. Journal of Cryptology, 16(4):219-237, 2003.
8. C. Cachin. On the foundations of oblivious transfer. In Advances in Cryptology -EUROCRYPT '98, volume 1403 of LNCS, pages 361-374. Springer-Verlag, 1998.
9. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
10. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
11. C. Crépeau. Efficient cryptographic protocols based on noisy channels. In Advances in Cryptology - CRYPTO '97, volume 1233 of LNCS, pages 306-317. Springer-Verlag, 1997.
12. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions (extended abstract). In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS '88), pages 42-52, 1988.
13. C. Crépeau, K. Morozov, and S. Wolf. Efficient unconditional oblivious transfer from almost any noisy channel. In Proceedings of Fourth Conference on Security in Communication Networks (SCN), volume 3352 of LNCS, pages 47-59. Springer-Verlag, 2004.
14. C. Crépeau, G. Savvides, C. Schaffner, and J. Wullschleger. Information-theoretic conditions for two-party secure function evaluation. In Advances in Cryptology - EUROCRYPT '06, volume 4004 of LNCS, pages 538-554. Springer-Verlag, 2006. Full version available at http://eprint.iacr. org/2006/183.
15. I. Damgård, S. Fehr, K. Morozov, and L. Salvail. Unfair noisy channels and oblivious transfer. In Theory of Cryptography Conference - TCC '04, volume 2951 of LNCS, pages 355-373. Springer-Verlag, 2004.
16. I. Damgard, S. Fehr, L. Salvail, and C. Schaffner. Cryptography in the bounded quantum-storage model. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS '05), pages 449-458. IEEE Computer Society, 2005.
17. I. Damgård, J. Kilian, and L. Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Advances in Cryptology - EUROCRYPT '99, volume 1592 of LNCS, pages 56-73. Springer-Verlag, 1999.
18. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Commun. ACM, 28(6):637-647, 1985.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '87), pages 218-229. ACM Press, 1987.
20. I. Haitner. Implementing oblivious transfer using collection of dense trapdoor permutations. In Theory of Cryptography Conference - TCC '04, volume 2951 of LNCS, pages 394-409. Springer-Verlag, 2004.
21. I. Haitner, D. Harnik, and O. Reingold. On the power of the randomized iterate. In Advances in Cryptology - CRYPTO '06, volume 4117 of LNCS, pages 21-40. Springer-Verlag, 2006.
22. D. Harnik, J. Kilian, M. Naor, O. Reingold, and A. Rosen. On robust combiners for oblivious transfer and other primitives. In Advances in Cryptology - EUROCRYPT '05, volume 3494 of LNCS, pages 96-113, 2005.
23. D. Harnik, M. Naor, O. Reingold, and A. Rosen. Completeness in two-party secure computation: a computational view. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pages 252-261. ACM Press, 2004.
24. J. Håstad. Pseudo-random generators under uniform assumptions. In Proceedings of the 22st Annual ACM Symposium on Theory of Computing (STOC '90), pages 395-404. ACM Press, 1990.
25. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364-1396, 1999.
26. T. Holenstein. Key agreement from weak bit agreement. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC '05), pages 664-673. ACM Press, 2005.
27. T. Holenstein. Strengthening key agreement using hard-core sets. PhD thesis, ETH Zurich, Switzerland, 2006
28. . Reprint as vol. 7 of ETH Series in Information Security and Cryptography, Hartung-Gorre Verlag.
29. T. Holenstein and R. Renner. One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In Advances in Cryptology - CRYPTO '05, volume 3621 of LNCS, pages 478-493. Springer-Verlag, 2005.
30. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS '95), pages 538-545. IEEE Computer Society, 1995.
31. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from oneway functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), pages 12-24. ACM Press, 1989.
32. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS '89), pages 230-235, 1989.
33. J. Kilian. Founding cryptography on oblivious transfer. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC '88), pages 20-31. ACM Press, 1988.
34. R. Meier, B. Przydatek, and J. Wullschleger. Robuster combiners for oblivious transfer. In Theory of Cryptography Conference - TCC '07, LNCS. Springer-Verlag, 2007.
35. S. Micali and P. Rogaway. Secure computation (abstract). In Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pages 392-404. Springer-Verlag, 1992.
36. A. Nascimento and A. Winter. On the oblivious transfer capacity of noisy correlations. In Proceedings of the IEEE International Symposium on Information Theory (ISIT '06), 2006.
37. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
38. A. Sahai and S. Vadhan. Manipulating statistical difference. In Randomization Methods in Algorithm Design (DIMACS Workshop '97), volume 43 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 251-270. American Mathematical Society, 1999.
39. S. Vadhan. A study of statistical zero-knowledge proofs. PhD thesis, Massachusets Institute of Technology, USA, 1999.
40. S. Wiesner. Conjugate coding. SIGACT News, 15(1):78-88, 1983.
41. S. Wolf and J. Wullschleger. Zero-error information and applications in cryptography. In Proceedings of 2004 IEEE Information Theory Workshop (ITW '04), 2004.
42. J. Wullschleger. Oblivious-Transfer Amplification. PhD thesis, ETH Zurich, Switzerland, 2007.
43. A. C. Yao. Protocols for secure computations. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS '82), pages 160-164, 1982.