On the efficiency of classical and quantum secure function evaluation

IEEE Transactions on Information Theory

Volumn 60, Issue 6, 2014, Pages 3123-3143

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

^a ETH ZURICH   (Switzerland)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

lower bounds; oblivious transfer; quantum cryptography; two party computation; Unconditional security

Indexed keywords

EFFICIENCY; QUANTUM CRYPTOGRAPHY; RANDOM PROCESSES;

FINITE FUNCTIONS; LOWER BOUNDS; OBLIVIOUS TRANSFER; QUANTUM PROTOCOLS; SECURE FUNCTION EVALUATION; SECURE PROTOCOLS; TWO-PARTY COMPUTATION; UNCONDITIONAL SECURITY;

QUANTUM EFFICIENCY;

EID: 84901321090     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2014.2314467     Document Type: Article

References (65)

1. S. Winkler and J. Wullschleger, "On the efficiency of classical and quantum oblivious transfer reductions," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 6223. Berlin, Germany: Springer-Verlag, 2010, pp. 707-723.
2. A. C. Yao, "Protocols for secure computations," in Proc. 23rd Annu. IEEE Symp. FOCS, Nov. 1982, pp. 160-164.
3. O. Goldreich and R. Vainish, "How to solve any protocol problem - An efficiency improvement," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science). New York, NY, USA: Springer-Verlag, 1988, pp. 73-86.
4. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. 20th Annu. ACM STOC, 1988, pp. 20-31.
5. M. O. Rabin, "How to exchange secrets by oblivious transfer," Harvard Aiken Comput. Lab., Cambrige, MA, USA, Tech. Rep. TR-81, 1981.
6. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," Commun. ACM, vol. 28, no. 6, pp. 637-647, 1985.
7. C. Crépeau, "Equivalence between two flavours of oblivious transfers," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science). New York, NY, USA: Springer-Verlag, 1988, pp. 350-354.
8. G. Brassard, C. Crépeau, and J.-M. Robert, "Information theoretic reductions among disclosure problems," in Proc. 27th Annu. IEEE Symp. FOCS, Oct. 1986, pp. 168-173. (Pubitemid 17535961)
9. C. Crépeau and M. Sántha, "On the reversibility of oblivious transfer," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 547. New York, NY, USA: Springer-Verlag, 1991, pp. 106-113.
10. G. Brassard, C. Crépeau, and M. Santha, "Oblivious transfers and intersecting codes," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1769-1780, Nov. 1996. (Pubitemid 126769176)
11. Y. Dodis and S. Micali, "Lower bounds for oblivious transfer reductions," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 1592. New York, NY, USA: Springer-Verlag, 1999, pp. 42-55.
12. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 3621. New York, NY, USA: Springer-Verlag, 2005, pp. 467-477.
13. C. Crépeau and J. Kilian, "Achieving oblivious transfer using weakened security assumptions (extended abstract)," in Proc. 29th Annu. IEEE Symp. FOCS, Oct. 1988, pp. 42-52.
14. C. Crépeau, K. Morozov, and S. Wolf, "Efficient unconditional oblivious transfer from almost any noisy channel," in Proc. 4th Conf. SCN, vol. 3352. 2004, pp. 47-59. (Pubitemid 41190996)
15. I. Damgård, S. Fehr, K. Morozov, and L. Salvail, "Unfair noisy channels and oblivious transfer," in Proc. TCC, vol. 2951. 2004, pp. 355-373.
16. J. Wullschleger, "Oblivious transfer from weak noisy channels," in Theory of Cryptography (Lecture Notes in Computer Science), vol. 5444, O. Reingold, Ed. Berlin, Germany: Springer-Verlag, 2009, pp. 332-349.
17. S. Wolf and J. Wullschleger, "Zero-error information and applications in cryptography," in Proc. IEEE ITW, Oct. 2004, pp. 1-6. (Pubitemid 40731287)
18. A. Nascimento and A. Winter, "On the oblivious transfer capacity of noisy correlations," in Proc. IEEE ISIT, Jul. 2006, pp. 1871-1875. (Pubitemid 351244423)
19. C. Cachin, "On the foundations of oblivious transfer," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 1403. New York, NY, USA: Springer-Verlag, 1998, pp. 361-374. (Pubitemid 128081498)
20. 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 (Lecture Notes in Computer Science), vol. 1592. New York, NY, USA: Springer-Verlag, 1999, pp. 56-73.
21. G. Brassard, C. Crépeau, and S. Wolf, "Oblivious transfers and privacy amplification," J. Cryptol., vol. 16, no. 4, pp. 219-237, 2003. (Pubitemid 40877274)
22. I. Damgård, S. Fehr, L. Salvail, and C. Schaffner, "Oblivious transfer and linear functions," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 4117. New York, NY, USA: Springer-Verlag, 2006.
23. J. Wullschleger, "Oblivious-transfer amplification," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 4515, M. Naor, Ed. Berlin, Germany: Springer-Verlag, 2007, pp. 555-572.
24. C. H. Bennett, G. Brassard, C. Crépeau, and H. Skubiszewska, "Practical quantum oblivious transfer," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 576. New York, NY, USA: Springer-Verlag, 1992, pp. 351-366.
25. A. C.-C. Yao, "Security of quantum protocols against coherent measurements," in Proc. 27th Annu. ACM STOC, 1995, pp. 67-75.
26. I. Damgård, S. Fehr, C. Lunemann, L. Salvail, and C. Schaffner, "Improving the security of quantum protocols," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science). New York, NY, USA: Springer-Verlag, 2009.
27. D. Unruh, "Universally composable quantum multi-party computation," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 6110, H. Gilbert, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 486-505.
28. D. Beaver, "Correlated pseudorandomness and the complexity of private computations," in Proc. 28th Annu. ACM STOC, 1996, pp. 479-488.
29. U. Maurer, "Information-theoretic cryptography," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 1666, M. Wiener, Ed. Berlin, Germany: Springer-Verlag, 1999, p. 785.
30. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2792-2797, Jun. 2008.
31. V. Prabhakaran and M. Prabhakaran, "Assisted common information," in Proc. IEEE ISIT, Jun. 2010, pp. 2602-2606.
32. V. Prabhakaran and M. Prabhakaran, "Assisted common information: Further results," in Proc. IEEE ISIT, Aug. 2011, pp. 2861-2865.
33. K. Kurosawa, W. Kishimoto, and T. Koshiba, "A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2566-2571, Jun. 2008.
34. A. Beimel and T. Malkin, "A quantitative approach to reductions in secure computation," in Theory of Cryptography (Lecture Notes in Computer Science), vol. 2951, M. Naor, Ed. Berlin, Germany: Springer-Verlag, 2004, pp. 238-257.
35. C. Crépeau and G. Savvides, "Optimal reductions between oblivious transfers using interactive hashing," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 4004. New York, NY, USA: Springer-Verlag, 2006, pp. 201-221. (Pubitemid 44072241)
36. R. Ahlswede and I. Csiszar, "On oblivious transfer capacity," in Proc. ISIT, 2007, pp. 2061-2064.
37. D. Mayers, "Unconditionally secure quantum bit commitment is impossible," Phys. Rev. Lett., vol. 78, no. 17, pp. 3414-3417, 1997. (Pubitemid 127657375)
38. H. K. Lo and H. F. Chau, "Is quantum bit commitment really possible," Phys. Rev. Lett., vol. 78, no. 17, pp. 3410-3413, 1997. (Pubitemid 127657374)
39. H. K. Lo, "Insecurity of quantum secure computations," Phys. Rev. A, vol. 56, no. 2, p. 1154, 1997.
40. L. Salvail, C. Schaffner, and M. Sotáková, "On the power of two-party quantum cryptography," in ASIACRYPT (Lecture Notes in Computer Science), vol. 5912, M. Matsui, Ed. New York, NY, USA: Springer-Veralg, 2009, pp. 70-87.
41. G. Savvides, "Interactive hashing and reductions between oblivious transfer variants," Ph.D. dissertation, Dept. Comput. Sci., McGill Univ., Montreal, QC, Canada, 2007.
42. Y. Dodis, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," in EUROCRYPT (Lecture Notes in Computer Science), vol. 3027, C. Cachin and J. Camenisch, Eds. New York, NY, USA: Springer-Veralg, 2004, pp. 523-540.
43. R. Renner, "Security of quantum key distribution," Ph.D. dissertation, Dept. Comput. Sci., ETH, Zürich, Switzerland, 2005.
44. N. Nisan and D. Zuckerman, "Randomness is linear in space," J. Comput. Syst. Sci., vol. 52, pp. 43-52, Feb. 1996. (Pubitemid 126340848)
45. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification," in Advances in Cryptology - ASIACRYPT (Lecture Notes in Computer Science), vol. 3788. New York, NY, USA: Springer-Verlag, 2005, pp. 199-216. (Pubitemid 43763476)
46. D. Beaver, "Precomputing oblivious transfer," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 963. New York, NY, USA: Springer-Verlag, 1995, pp. 97-109.
47. O. Goldreich, Foundations of Cryptography, vol. 2. Cambridge, U.K.: Cambridge Univ. Press, 2004.
48. M. Fitzi, S. Wolf, and J. Wullschleger, "Pseudo-signatures, broadcast, and multi-party computation from correlated randomness," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 3152. New York, NY, USA: Springer-Verlag, 2004, pp. 562-578.
49. P. Gacs and J. Körner, "Common information is far less than mutual information," Problems Control Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
50. S. Wolf and J. Wullschleger, "Oblivious transfer is symmetric," in Advances in Cryptology - EUROCRYPT (Lecture Notes in Computer Science), vol. 4004. New York, NY, USA: Springer-Verlag, 2006, pp. 222-232. (Pubitemid 44072242)
51. S. Winkler, "Classical and quantum secure two-party computation," Ph.D. dissertation, Dept. Comput. Sci., ETH, Zürich, Switzerland, 2012.
52. L. Salvail, C. Schaffner, and M. Sotáková, "On the power of two-party quantum cryptography," in Proc. 15th Int. Conf. Theory Appl. Cryptol. Inf. Security, vol. 5912. Tokyo, Japan, 2009, pp. 70-87.
53. R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols," in Proc. 42nd Annu. IEEE Symp. FOCS, Oct. 2001, pp. 136-145. (Pubitemid 33068374)
54. R. Dowsley, J. van de Graaf, J. Müller-Quade, and A. C. A. Nascimento. (2008). On the composability of statistically secure bit commitments. IACR Cryptol. ePrint Archive [Online]. 2008, p. 457. Available: http://eprint.iacr.org/2008/457
55. A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels," in Proc. IMA Int. Conf., 2003, pp. 35-51.
56. R. Alicki and M. Fannes, "Continuity of quantum conditional information," J. Phys. A, Math. General, vol. 37, no. 5, pp. L55-L57, 2004. (Pubitemid 38214163)
57. H. Araki and E. H. Lieb, "Entropy inequalities," Commun. Math. Phys., vol. 18, no. 2, pp. 160-170, 1970.
58. S. Winkler, M. Tomamichel, S. Hengl, and R. Renner, "Impossibility of growing quantum bit commitments," Phys. Rev. Lett., vol. 107, p. 090502, Aug. 2011.
59. S. Fehr and C. Schaffner, "Composing quantum protocols in a classical environment," in Proc. 6th Theory Cryptograph. Conf. Theory Cryptograph., 2009, pp. 350-367.
60. W. F. Stinespring, "Positive functions on C*-algebras," Proc. Amer. Math. Soc., vol. 6, no. 2, pp. 211-216, 1955.
61. R. Konig, S. Wehner, and J. Wullschleger, "Unconditional security from noisy quantum storage," IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1962-1984, Mar. 2012.
62. N. J. Bouman and S. Fehr. (2009, Jul.). Sampling in a quantum population, and applications. ArXiv e-prints [Online]. Available: http://adsabs.harvard. edu/abs/2009arXiv0907.4246B
63. W. Hoeffding, "Probability inequalities for sums of bounded random variables," J. Amer. Statist. Assoc., vol. 58, no. 301, pp. 13-30, 1963.
64. N. J. Bouman and S. Fehr, "Sampling in a quantum population, and applications," in CRYPTO (Lecture Notes in Computer Science), vol. 6223. New York, NY, USA: Springer-Verlag, 2010, pp. 724-741.
65. M. Prabhakaran and M. Rosulek, "Cryptographic complexity of multi-party computation problems: Classifications and separations," in Advances in Cryptology - CRYPTO (Lecture Notes in Computer Science), vol. 5157, D. Wagner, Ed. Berlin, Germany: Springer-Verlag, 2008, pp. 262-279.