A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2566-2571

  Kurosawa, Kaoru ^a   Kishimoto, Wataru ^b   Koshiba, Takeshi ^c  

^a IBARAKI UNIVERSITY   (Japan)

^b CHIBA UNIVERSITY   (Japan)

^c SAITAMA UNIVERSITY   (Japan)

Author keywords

Combinatorial approach; Lower bound; Oblivious transfer; Reduction

Indexed keywords

BLACK BOXES; COMBINATORIAL APPROACH; LOWER BOUNDS; NEW APPROACHES; OBLIVIOUS TRANSFER (OT);

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

References (15)

1. G. Brassard and C. Crépeau, "Oblivious transfers and privacy amplification," in Advances in Cryptology - EUROCRYPT 1997, B. Kaliski, Ed. Berlin, Germany: Springer, 1997, vol. 1233, Lecture Notes in Computer Science, pp. 334-347.
2. G. Brassard, C. Crépeau, and S. Wolf, "Oblivious transfers and privacy amplification," J. Cryptol., vol. 16, no. 4, pp. 219-237, 2003.
3. G. Brassard, C. Crépeau, and M. Santha, "Oblivious transfers and intersecting codes," IEEE Trans. Inf. Theory, vol. 42, pp. 1769-1780, 1996.
4. K. A. Bush, "Orthogonal arrays of index unity," Ann. Math. Stat. vol. 23, pp. 426-434, 1952.
5. C. Cachin, "On the foundations of oblivious transfer," in Advances in Cryptology-EUROCRYPT 1998, K. Nyberg, Ed. Berlin, Germany: Springer, 1998, vol. 1403, Lecture Notes in Computer Science, pp. 361-374.
6. C. Colbourn and J. Dinitz, The CRC Handbook of Combinatorial Designs Boca Raton, FL: CRC, 1996.
7. C. Crépeau and G. Savvides, "Optimal reductions between oblivious transfers using interactive hashing," in Advances in Cryptology - EU - ROCRYPT 2006, S. Vaudenay, Ed. Berlin, Germany: Springer, 2006, vol. 4004, Lecture Notes in Computer Science, pp. 201-221.
8. C. Crépeau, G. Savvides, C. Schaffner, and J. Wullschleger, "Information-theoretic conditions for two-party secure function evaluation," in Advances in Cryptology - EUROCRYPT 2006, S. Vaudenay, Ed. Berlin, Germany: Springer, 2006, vol. 4004, Lecture Notes in Computer Science, pp. 538-554.
9. Y. Dodis and S. Micali, "Lower bounds for oblivious transfer reductions," in Advances in Cryptology - EUROCRYPT 1999, J. Stern, Ed. Berlin, Germany: Springer, 1999, vol. 1592, Lecture Notes in Computer Science, pp. 42-55.
10. O. Goldreich, S. Nficali, and A. Wigderson, "How to play any mental game or a completeness theorem for protocols with honest majority," in Proc. 19th ACM Symp. Theory Comput., 1987, pp. 218-229.
11. J. Kilian, "Founding cryptography on oblivious transfer," in Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 20-31.
12. M. Naor and B. Pinkas, "Oblivious transfer and polynomial evaluation," in Proc. 31st ACM Symp. Theory Comput., 1999, pp. 245-254.
13. M. Naor and B. Pinkas, "Efficient oblivious transfer protocols," in Proc. 12th ACM/SIAM Symp. Discr. Algor., 2001, pp. 448-457.
14. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation," in Advances in Cryptology - CRYPTO 2005, V. Shoup, Ed. Berlin, Germany: Springer, 2005, vol. 3621, Lecture Notes in Computer Science, pp. 467-477.
15. A. C. Yao, "How to generate and exchange secrets (extended abstract)," in Proc. 27th IEEE Symp. Foundations of Computer Science, 1986, pp. 162-167.