New monotones and lower bounds in unconditional two-party computation

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2792-2797

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

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Lower bounds; Monotones; Oblivious transfer; Two party computation; Unconditional security

Indexed keywords

COMPUTER NETWORKS; INFORMATION THEORY; NETWORK PROTOCOLS;

LOWER BOUNDS; MULTI-PARTY COMPUTATIONS; OBLIVIOUS TRANSFER (OT); TWO-PARTY COMPUTATION;

COMPUTATIONAL METHODS;

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

References (28)

1. D. Beaver, "Precomputing oblivious transfer," in Advances in Cryptology - EUROCRYPT '95 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1995, vol. 963, pp. 97-109.
2. D. Beaver, "Correlated pseudorandomness and the complexity of private computations," in Proc. 28th Annu. ACM Symp. Theory of Computing (STOC '96), Philadelphia, PA, 1996, pp. 479-488.
3. G. Brassard, C. Crépeau, and S. Wolf, "Oblivious transfers and privacy amplification," J. Cryptol., vol. 16, no. 4, pp. 219-237, 2003.
4. C. Cachin, "On the foundations of oblivious transfer," in Advances in Cryptology - EUROCRYPT '98 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1998, vol. 1403, pp. 361-374.
5. N. J. Cerf, S. Massar, and S. Schneider, "Multipartite classical and quantum secrecy monotones," Phys. Rev. A, pp. 66:042309. 1-042309.13, 2002.
6. C. Crépeau, "Correct and Private Reductions Among Oblivious Transfers," Ph.D. dissertation, MIT, Cambridge, MA, 1990.
7. C. Crépeau, "Efficient cryptographic protocols based on noisy channels," in Advances in Cryptology - CRYPTO '97 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1997, vol. 1233, pp. 306-317.
8. C. Crépeau and J. Kilian, "Achieving oblivious transfer using weakened security assumptions (extended abstract)," in Proc. 29th Annu. IEEE Symp. Foundations of Computer Science (FOCS '88), White Plains, NY, 1988, pp. 42-52.
9. C. Crépeau, K. Morozov, and S. Wolf, "Efficient unconditional oblivious transfer from almost any noisy channel," in Proc. 4th Conf. Security in Communication Networks (SCN) (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 3352, pp. 47-59.
10. C. Crépeau and M. Sántha, "On the reversibility of oblivious transfer," in Advances in Cryptology - EUROCRYPT '91 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1991, vol. 547, pp. 106-113.
11. 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). Berlin, Germany: Springer-Verlag, 2006, vol. 4004, pp. 201-221.
12. I. Damgård, S. Fehr, K. Morozov, and L. Salvail, "Unfair noisy channels and oblivious transfer," in Theory of Cryptography Conference - TCC '04 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 2951, pp. 355-373.
13. I. Damgård, S. Fehr, L. Salvail, and C. Schaffner, "Oblivious transfer and linear functions," in Advances in Cryptology - CRYPTO '06 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2006, vol. 4117, pp. 342-359.
14. 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 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1592, pp. 56-73.
15. Y. Dodis and S. Micali, "Lower bounds for oblivious transfer reductions," in Advances in Cryptology - EUROCRYPT '99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1592, pp. 42-55.
16. M. Fitzi, S. Wolf, and J. Wullschleger, "Pseudo-signatures, broadcast, and multi-party computation from correlated randomness," in Advances in Cryptology - CRYPTO '04 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 3152, pp. 562-578.
17. P. Gacs and J. Körner, "Common information is far less than mutual information," Probl. Contr. Inf. Theory, vol. 2, pp. 149-162, 1973.
18. H. Imai, J. Müuller-Quade, A. Nascimento, and A. Winter, "Rates for bit commitment and coin tossing from noisy correlation," in Proc. IEEE Int. Symp. Information Theory (ISIT '04), Chicago, IL, Jun./Jul. 2004, p. 45.
19. U. Maurer, "Information-theoretic cryptography," in Advances in Cryptology - CRYPTO '99 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1666, pp. 47-64.
20. U. Maurer and S. Wolf, "Unconditionally secure key agreement and the intrinsic conditional information," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 499-514, Mar. 1999.
21. A. Nascimento and A. Winter, "On the oblivious transfer capacity of noisy correlations," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2572-2581, Jun. 2008.
22. R. Ostrovsky, R. Venkatesan, and M. Yung, "Fair games against an all-powerful adversary," in Advances in Computational Complexity Theory. New Brunswick, NJ: AMS, 1993, vol. 13, AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 155-169.
23. R. Renner and S. Wolf, "New bounds in secret-key agreement: The gap between formation and secrecy extraction," in Advances in Cryptology - EUROCRYPT '03 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2003, vol. 2656, pp. 562-577.
24. A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels," in Proc. IMA Int. Conf., 2003, pp. 35-51.
25. S. Wolf and J. Wullschleger, "Zero-error information and applications in cryptography," in Proc. 2004 IEEE Information Theory Workshop (ITW '04), San Antonio, TX, Oct. 2004.
26. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation," in Advances in Cryptology - CRYPTO '05 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2005, vol. 3621, pp. 467-477.
27. S. Wolf and J. Wullschleger, "Oblivious transfer is symmetric," in Advances in Cryptology - EUROCRYPT '06 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2006, vol. 4004, pp. 222-232.
28. J. Wullschleger, "Oblivious-transfer amplification," in Advances in Cryptology - EUROCRYPT '07 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2007, vol. 4515, pp. 555-572.