A quantitative approach to reductions in secure computation

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

Volumn 2951, Issue , 2004, Pages 238-257

  Beimel, Amos ^a   Malkin, Tal ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY;

COMPLETE FUNCTIONS; DETERMINISTIC PROTOCOLS; EFFICIENT PROTOCOLS; INHERENT COMPLEXITY; MINIMIZING THE NUMBER OF; QUANTITATIVE APPROACH; RANDOMIZED PROTOCOLS; UPPER AND LOWER BOUNDS;

BOOLEAN FUNCTIONS;

EID: 35048856983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_14     Document Type: Article

References (25)

1. D. Beaver. Perfect privacy for two-party protocols. Technical Report TR-11-89, Computer Science, Harvard University, 1989.
2. D. Beaver. Correlated pseudorandomness and the complexity of private computations. In the 28th Symp. on the Theory of Computing, pages 479-488, 1996.
3. A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In CRYPTO '99, volume 1666 of LNCS, pages 80-97. Springer, 1999.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computations. In the 20th Symp. on the Theory of Computing, pages 1-10, 1988.
5. G. Brassard and C. Crepeau. Oblivious transfers and privacy amplification. In EUROCRYPT '97, volume 1233 of LNCS, pages 334-347. Springer, 1997.
6. G. Brassard, C. Crépeau, and J.-M. Robert. Information theoretic reductions among disclosure problems. In the 27th Symp. on Foundations of Computer Science, pages 168-173, 1986.
7. G. Brassard, C. Crépeau, and M. Sántha. Oblivious transfers and intersecting codes. IEEE Trans, on Information Theory, 42(6):1769-1780, 1996.
8. R. Canetti. Security and composition of multiparty cryptographic protocols. J. of Cryptology, 13(1):143-202, 2000.
9. D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditionally secure protocols. In the 20th Symp. on the Theory of Computing, pages 11-19, 1988.
10. B. Chor and E. Kushilevitz. A zero-one law for Boolean privacy. SIAM J. on Discrete Mathematics, 4(l):36-47, 1991.
11. C. Crépeau. Equivalence between two flavors of oblivious transfers. In CRYPTO '87, volume 293 of LNCS, pages 350-354. Springer, 1988.
12. C. Crépeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In 29th Symp. on Found, of Computer Science, pp. 42-52, 1988.
13. I. Damgard, J. Kilian, and L. Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In EUROCRYPT '99, volume.1592 of LNCS, pages 56-73. Springer, 1999.
14. Y. Dodis and S. Micali. Lower bounds for oblivious transfer reductions. In EUROCRYPT '99, volume 1592 of LNCS, pages 42-55, 1999.
15. J. Forster. A linear lower bound on the unbounded error probabilistic communication complexity. In 16th Conf. on Comput. Complexity, pp. 100-106, 2001.
16. O. Goldreich and R. Vainish. How to solve any protocol problem-an efficiency improvement. In CRYPTO '87, vol. 293 of LNCS, pages 73-86. Springer, 1988.
17. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently. In CRYPTO 2003, volume 2729 of LNCS, pages 145-161, Springer, 2003.
18. J. Kilian. Basing cryptography on oblivious transfer. In Proc. of the 20th Symp. on the Theory of Computing, pages 20-31, 1988.
19. J. Kilian. A general completeness theorem for two-party games. In Proc. of the 23th Symp. on the Theory of Computing, pages 553-560, 1991.
20. J. Kilian. More general completeness theorems for two-party games. In Proc. of the 32nd Symp. on the Theory of Computing, pages 316-324, 2000.
21. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM J. on Computing, 28(4):1189-1208, 2000.
22. E. Kushilevitz. Privacy and communication complexity. SIAM J. on Discrete Mathematics, 5(2):273-284, 1992.
23. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
24. U. Maurer. Information-theoretic cryptography. In CRYPTO '99, volume 1666 of LNCS, pages 47-64. Springer, 1999.
25. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. of the 33th Symp. on the Theory of Computing, 2001.