Oblivious transfer and linear functions

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

Volumn 4117 LNCS, Issue , 2006, Pages 427-444

  Damgård, Ivan B ^a   Fehr, Serge ^b   Salvail, Louis ^a   Schaffner, Christian ^a  

^a AARHUS UNIVERSITY   (Denmark)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; DATA TRANSFER; LOGIC GATES; NETWORK PROTOCOLS; PROBLEM SOLVING;

BINARY LINEAR FUNCTIONS; SHARP CONTRAST; STANDARD SECURITY REQUIREMENT;

SECURITY OF DATA;

EID: 33749565228     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_26     Document Type: Conference Paper

References (29)

1. D. Beaver. Precomputing oblivious transfer. In Advances in CryptologyCRYPTO '95, volume 963 of Lecture Notes in Computer Science. Springer, 1995.
2. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41(6), 1995.
3. G. Brassard and C. Crépeau. Oblivious transfers and privacy amplification. In Advances in Cryptology-CRYPTO '97, volume 1294 of Lecture Notes in Computer Science. Springer, 1997.
4. G. Brassard, C. Crépeau, and S. Wolf. Oblivious transfer and privacy amplification. Journal of Cryptology, 16(4), 2003.
5. C. Cachin. On the foundations of oblivious transfer. In Advances in Cryptology-EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science. Springer, 1998.
6. C. Cachin, C. Crépeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 493-502, 1998.
7. C. Crépeau. Equivalence between two flavours of oblivious transfers. In Advances in Cryptology-CRYPTO '87, volume 293 of Lecture Notes in Computer Science. Springer, 1987.
8. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions (extended abstract). In 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1988.
9. C. Crépeau, K. Morozov, and S. Wolf. Efficient unconditional oblivious transfer from almost any noisy channel. In International Conference on Security in Communication Networks (SCN), volume 4 of Lecture Notes in Computer Science, 2004.
10. C. Crépeau and G. Savvides. Optimal reductions between oblivious transfers using interactive hashing. In Advances in Cryptology-EUROCRYPT '06, Lecture Notes in Computer Science. Springer, 2006.
11. 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, Lecture Notes in Computer Science. Springer, 2006. Full version: http://eprint.iacr.org.
12. I. B. Damgård, S. Fehr, K. Morozov, and L. Salvail. Unfair noisy channels and oblivious transfer. In Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science. Springer, 2004.
13. I. B. Damgård, S. Fehr, R. Renner, L. Salvail, and C. Schaffner. A tight high-order entropic uncertainty relation with applications in the bounded quantum-storage model. In preparation, 2006.
14. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Cryptography in the bounded quantum-storage model. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOGS), 2005.
15. I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner. Oblivious transfer and linear functions (full version). Available at http://eprint.iacr. org/2005/349, 2006.
16. I. B. 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 Lecture Notes in Computer Science. Springer, 1999.
17. Y. Z. Ding. Oblivious transfer in the bounded storage model. In Advances in Cryptology-CRYPTO '01, volume 2139 of Lecture Notes in Computer Science. Springer, 2001.
18. Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In Theory of Cryptography Conference (TCC), volume 2951 of Lecture Notes in Computer Science, pages 446-472. Springer, 2004.
19. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. In Advances in Cryptology: Proceedings of CRYPTO 82. Plenum Press, 1982.
20. J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SI AM Journal on Computing, 28(4), 1999.
21. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In 21st Annual ACM Symposium on Theory of Computing (STOC), 1989.
22. J. Kilian. Founding cryptography on oblivious transfer. In 20th Annual ACM Symposium on Theory of Computing (STOC), 1988.
23. H.-K. Lo and H. F. Chau. Is quantum bit commitment really possible? Physical Review Letters, 78(17):3410-3413, 1997.
24. D. Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78(17):3414-3417, 1997.
25. M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
26. R. Renner and R. Koenig. Universally composable privacy amplification against quantum adversaries. In Theory of Cryptography Conference (TCC), volume 3378 of Lecture Notes in Computer Science, pages 407-425. Springer, 2005. Also available at http://arxiv.org/abs/quant-ph/0403133.
27. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1979.
28. S. Wiesner. Conjugate coding. ACM Special Interest Group on Automata and Computability Theory (SIGACT News), 15, 1983. Original manuscript written circa 1970.
29. S. Wolf. Reducing oblivious string transfer to universal oblivious transfer. In IEEE International Symposium on Information Theory (ISIT), 2000.