On the efficiency of classical and quantum oblivious transfer reductions

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

Volumn 6223 LNCS, Issue , 2010, Pages 707-723

  Winkler, Severin ^a   Wullschleger, Jürg ^b  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Lower Bounds; Oblivious Transfer; Quantum Cryptography; Two Party Computation; Unconditional Security

Indexed keywords

BLACK BOXES; DERIVE BOUNDS; FINITE FUNCTIONS; FINITE NUMBER; KNOW-HOW; LOWER BOUNDS; NOISY CHANNEL; OBLIVIOUS TRANSFER; PROBABILITY OF ERRORS; QUANTUM PROTOCOLS; QUANTUM SETTING; RABIN OT; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOLS; TWO-PARTY COMPUTATION; UNCONDITIONAL SECURITY;

COMPUTATION THEORY; NETWORK PROTOCOLS; NETWORK SECURITY; PROBABILITY DENSITY FUNCTION; QUANTUM CRYPTOGRAPHY; RANDOM PROCESSES;

QUANTUM EFFICIENCY;

EID: 77956992510     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14623-7_38     Document Type: Conference Paper

References (49)

1. Ahlswede, R., Csiszar, I.: On oblivious transfer capacity. In: IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, December 10, pp. 1-3 (2009)
2. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC 1996: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 479-488. ACM Press, New York (1996)
3. Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
4. Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238-257. Springer, Heidelberg (2004)
5. Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM Journal on Computing 17(2), 210-229 (1988)
6. Bennett, C.H., Brassard, G., Crépeau, C., Skubiszewska, M.H.: Practical quantum oblivious transfer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 351-366. Springer, Heidelberg (1992)
7. Brassard, G., Crépeau, C., Robert, J.M.: Information theoretic reductions among disclosure problems. In: Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1986), pp. 168-173 (1986)
8. Brassard, G., Crépeau, C., Wolf, S.: Oblivious transfers and privacy amplification. Journal of Cryptology 16(4), 219-237 (2003)
9. Brassard, G., Crépeau, C., Santha, M.: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory 42(6), 1769-1780 (1996)
10. Cachin, C.: On the foundations of oblivious transfer. In: Nyberg, K. (ed.) EURO-CRYPT 1998. LNCS, vol. 1403, pp. 361-374. Springer, Heidelberg (1998)
11. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136-145 (2001)
12. Crépeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1988), pp. 42-52 (1988)
13. Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350-354. Springer, Heidelberg (1988)
14. Crépeau, C., Morozov, K., Wolf, S.: Efficient unconditional oblivious transfer from almost any noisy channel. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 47-59. Springer, Heidelberg (2005)
15. Crépeau, C., Santha, M.: On the reversibility of oblivious transfer. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 106-113. Springer, Heidelberg (1991)
16. Crépeau, C., Savvides, G.: Optimal reductions between oblivious transfers using interactive hashing. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 201-221. Springer, Heidelberg (2006)
17. Damgård, I., Fehr, S., Lunemann, C., Salvail, L., Schaffner, C.: Improving the security of quantum protocols via commit-and-open. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 408-427. Springer, Heidelberg (2009)
18. Damgård, I., Fehr, S., Morozov, K., Salvail, L.: Unfair noisy channels and oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 355-373. Springer, Heidelberg (2004)
19. Damgård, I., Fehr, S., Salvail, L., Schaffner, C.: Oblivious transfer and linear functions. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 427-444. Springer, Heidelberg (2006)
20. Damgård, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EU-ROCRYPT 1999. LNCS, vol. 1592, pp. 56-73. Springer, Heidelberg (1999)
21. Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 42-55. Springer, Heidelberg (1999)
22. Dowsley, R., van de Graaf, J., Müller-Quade, J., Nascimento, A.C.A.: On the composability of statistically secure bit commitments. Cryptology ePrint Archive, Report 2008/457 (2008)
23. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637-647 (1985)
24. Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. II. Cambridge University Press, Cambridge (2004)
25. Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73-86. Springer, Heidelberg (1988)
26. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
27. Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 20-31. ACM Press, New York (1988)
28. Kurosawa, K., Kishimoto, W., Koshiba, T.: A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions. IEEE Transactions on Information Theory 54(6), 2566-2571 (2008)
29. Lo, H.K.: Insecurity of quantum secure computations. Physical Review A 56, 1154 (1997)
30. Lo, H.K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters 78, 3410-3413 (1997)
31. Maurer, U.: Information-theoretic cryptography. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 47-64. Springer, Heidelberg (1999)
32. Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters 78, 3414-3417 (1997)
33. Nascimento, A., Winter, A.: On the oblivious transfer capacity of noisy correlations. In: Proceedings of the IEEE International Symposium on Information Theory, ISIT 2006 (2006)
34. Prabhakaran, M., Rosulek, M.: Cryptographic complexity of multi-party computation problems: Classifications and separations. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 262-279. Springer, Heidelberg (2008)
35. Rabin, M.O.: How to exchange secrets by oblivious transfer. Tech. Rep. TR-81, Harvard Aiken Computation Laboratory (1981)
36. Salvail, L., Schaffner, C., Sotáková, M.: On the power of Two-party quantum cryptography. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 70-87. Springer, Heidelberg (2009)
37. Savvides, G.: Interactive Hashing and reductions between Oblivious Transfer variants. Ph.D. thesis, McGill University, Montréal (2007)
38. Unruh, D.: Universally composable quantum multi-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 486-505. Springer, Heidelberg (2010)
39. Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78-88 (1983)
40. Winkler, S., Wullschleger, J.: On the efficiency of classical and quantum oblivious transfer reductions. Cryptology ePrint Archive, Report 2009/508 (2009)
41. Winter, A., Nascimento, A.C.A., Imai, H.: Commitment capacity of discrete memoryless channels. In: IMA Int. Conf., pp. 35-51 (2003)
42. Wolf, S., Wullschleger, J.: Zero-error information and applications in cryptography. In: Proceedings of 2004 IEEE Information Theory Workshop, ITW 2004 (2004)
43. Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. IEEE Transactions on Information Theory 54(6), 2792-2797 (2008)
44. Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 467-477. Springer, Heidelberg (2005)
45. Wolf, S., Wullschleger, J.: Oblivious transfer is symmetric. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 222-232. Springer, Heidelberg (2006)
46. Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 555-572. Springer, Heidelberg (2007)
47. Wullschleger, J.: Oblivious transfer from weak noisy channels. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 332-349. Springer, Heidelberg (2009)
48. Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 1982), pp. 160-164 (1982)
49. Yao, A.C.C.: Security of quantum protocols against coherent measurements. In: STOC 1995: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 67-75. ACM Press, New York (1995)