Oblivious transfer is symmetric

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

Volumn 4004 LNCS, Issue , 2006, Pages 222-232

  Wolf, Stefan ^a   Wullschleger, Jürg ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA TRANSFER; SECURITY OF DATA;

OBLIVIOUS TRANSFER; SYMMETRIC FUNCTIONALITY;

CRYPTOGRAPHY;

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

References (26)

1. D. Beaver, Foundations of Secure Interactive Computing, Advances in Cryptology - Proceedings of CRYPTO '91, LNCS, Vol. 576, pp. 377-391, Springer-Verlag, 1992.
2. D. Beaver, Precomputing oblivious transfer, Advances in Cryptology - Proceedings of CRYPTO '95, LNCS, Vol. 963, pp. 97-109, Springer-Verlag, 1995.
3. C. H. Bennett, G. Brassard, C. Crépeau, and H. Skubiszewska, Practical quantum oblivious transfer, Advances in Cryptology - Proceedings of EUROCRYPT '91, LNCS, Vol. 576, pp. 351-366, Springer-Verlag, 1992.
4. G. Brassard, C. Crépeau, and S. Wolf, Oblivious transfers and privacy amplification, Journal of Cryptology, Vol. 16, No. 4, pp. 219-237, 2003.
5. C. Crépeau, Correct and private reductions among oblivious transfers, Ph. D. Thesis, Massachusetts Institute of Technology, 1990.
6. C. Crépeau, Efficient cryptographic protocols based on noisy channels, Advances in Cryptology - Proceedings of CRYPTO '97, LNCS, Vol. 1233, pp. 306-317, Springer-Verlag, 1997.
7. C. Crépeau and J. Kilian, Achieving oblivious transfer using weakened security assumptions, Proceedings of the 28th Symposium on Foundations of Computer Science (FOCS '88), pp. 42-52, IEEE, 1988.
8. C. Crépeau, K. Morozov, and S. Wolf, Efficient unconditional oblivious transfer from almost any noisy channel, Proceedings of Fourth Conference on Security in Communication Networks (SCN) '04, LNCS, Springer-Verlag, 2004.
9. C. Crépeau and M. Sántha, On the reversibility of oblivious transfer, Advances in Cryptology - Proceedings of EUROCRYPT '91, LNCS, Vol. 547, pp. 106-113, Springer-Verlag, 1991.
10. S. Even, O. Goldreich, and A. Lempel, A randomized protocol for signing contracts, Communications of the ACM, Vol. 28, No. 6, pp. 637-647, 1985.
11. O. Goldreich, Foundations of Cryptography, Volume II: Basic Applications, Cambridge University Press, 2004.
12. H. Imai, J. Müller-Quade, A. Nascimetito, and A. Winter, Rates for bit commitment and coin tossing from noisy correlation, Proceedings of the IEEE International Symposium on Information Theory (ISIT) '04, IEEE, 2004.
13. H. Imai, A. Nascimento, and A. Winter, Oblivious transfer from any genuine noise, unpublished manuscript, 2004.
14. J. Kilian, Founding cryptography on oblivious transfer, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88), pp. 20-31, 1988.
15. D. Mayers, Unconditionally secure quantum bit commitment is impossible, Phys. Rev. Lett., Vol. 78, pp. 3414-3417, 1997.
16. S. Micali and P. Rogaway, Secure computation. Advances in Cryptology - Proceedings of CRYPTO '91, LNCS, Vol. 576, pp. 392-404, Springer-Verlag, 1992.
17. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (STOC '99), pp. 245-354, 1999.
18. R. Ostrovsky, R. Venkatesan, and M. Yung, Fair games against an all-powerful adversary, AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, pp. 155-169, 1990.
19. M. Rabin, How to exchange secrets by oblivious transfer, Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
20. R. L. Rivest, Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer, unpublished manuscript, 1999.
21. C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal, Vol. 27, pp. 379-423, 623-656, 1948.
22. A. Winter, A. Nascimento, and H. Imai, Commitment capacity of discrete memoryless channels, Cryptography and Coding, LNCS, Vol. 2898, pp. 35-51, Springer-Verlag, 2003.
23. S. Wolf and J. Wullschleger, Zero-error information and applications in cryptography, Information Theory Workshop (ITW) '04, IEEE, 2004.
24. S. Wolf and J. Wullschleger. New monotones and lower bounds in unconditional two-party computation. In Advances in Cryptology - Proceedings of CRYPTO '05, LNCS, Vol. 3621, pp. 467-477, Springer-Verlag, 2005.
25. A. D. Wyner, The wire-tap channel, Bell System Technical Journal, Vol. 54, No. 8, pp. 1355-1387, 1975.
26. R. W. Yeung, A new outlook on Shannon's information measures, IEEE Transactions on Information Theory, Vol. 37, No. 3, pp. 466-474, 1991.