On the oblivious transfer capacity of the erasure channel

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1428-1431

  Imai, Hideki ^a,b   Morozov, Kirill ^b   Nascimento, Anderson C A ^c  

^a CHUO UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c UNIVERSITY OF BRASILIA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

MALICIOUS PLAYERS; NOISY CHANNELS; OBLIVIOUS TRANSFER;

CHANNEL CAPACITY; COMPUTATIONAL METHODS; COMPUTER CRIME;

CRYPTOGRAPHY;

EID: 39049108276     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.262082     Document Type: Conference Paper

References (26)

1. Y. Aumann, Y.Z. Ding, and M. O. Rabin, "Everlasting security in the bounded storage model," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1668-1680, 2002.
2. C. H. Bennett, G. Brassard, C. Crépeau, U. Maurer, "Generalized Privacy Amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, 1995.
3. G. Brassard, C. Crépeau, and S. Wolf, "Oblivious transfers and privacy amplification," J. of Cryptol. vol. 16, no. 4, pp. 219-237, 2003.
4. C. Crépeau, "Equivalence between two flavours of oblivious transfers," Proc. CRYPTO '87. LNCS, vol. 293, pp. 350-354, 1988.
5. C. Crépeau, "Efficient Cryptographic Protocols Based on Noisy Channels," Proc. EUROCRYPT '97. LNCS, vol. 1233, pp. 306-317, 1997.
6. C. Cachin, C. Crépeau, and J. Marcil, "Oblivious Transfer with a Memory-Bounded Receiver," Proc. 39th IEEE FOCS. pp. 493-502, 1998.
7. C. Crépeau, J. Kilian, "Achieving oblivious transfer using weakened security assumptions," Proc. 29th IEEE FOCS. pp. 42-52, 1988.
8. C. Crépeau, K. Morozov, S. Wolf, "Efficient Unconditional Oblivious Transfer from Almost any Noisy Channel," Proc. SCN '04. LNCS, vol. 3352, pp. 47-59, 2005.
9. C. Crépeau, G. Savvides, "Optimal Reductions Between Oblivious Transfers Using Interactive Hashing," Appears in Proc. EUROCRYPT '06. LNCS, 2006.
10. Y.Z. Ding, "Oblivious transfer in the bounded storage model," CRYPTO '01. LNCS, vol. 2139, pp. 155-170, 2001.
11. I. Damgård, S. Fehr, K. Morozov, L. Salvail, "Unfair Noisy Channels and Oblivious Transfer," Proc. TCC '04, LNCS, vol. 2951, pp. 355-373, 2004. (Full version is available from: http://www.brics.dk/RS/03/ 36)
12. I. Damgård, S. Fehr, R. Renner, L. Salvail, C. Schaffner, "A Tight High-Order Entropic Relation with Application in the Bounded Quantum-Storage Model", Submitted to 47th IEEE FOCS, 2006.
13. I. Damgård, S. Fehr, L. Salvail, C. Schaffner, "Cryptography In the Bounded Quantum-Storage Model", Proc. 46th IEEE FOCS. pp. 449-458, 2005.
14. Y.Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel, "Constant round oblivious transfer in the bounded storage model," Proc. TCC '04, LNCS, vol. 2951, pp. 446-472, 2004.
15. I. Damgård, J. Kilian, L. Salvail, "On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions," Proc. EUROCRYPT '99, LNCS, vol. 1592, pp. 56-73, 1999.
16. Y. Dodis, S. Micali, "Lower bounds for Oblivious Transfer Reduction," EUROCRYPT '99, LNCS, vol. 1592, pp. 42-54, 1999.
17. S. Even, O. Goldreich, A. Lempel, "A Randomized Protocol for Signing Contracts," Comm. ACM, vol. 28, no. 6, pp. 637-647, 1985.
18. O. Goldreich, S. Micali, A. Wigderson, "How to Play Any Mental Game, or: A completeness theorem for protocols with honest majority," Proc. 19th ACM STOC, pp. 218-229, 1987.
19. D. Harnik and M. Naor, "On Everlasting Security in the Hybrid Bounded Storage Model", To appear in ICALP 2006.
20. J. Kilian, "Founding Cryptography on Oblivious Transfer," Proc. 20th ACM STOC, pp. 20-31, 1988.
21. A. C. A. Nascimento, A. Winter, "OT from any genuine noise," Pre-print, 2004.
22. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, "Perfect Zero-Knowledge Arguments for NP using any one-way permutation", J. of Cryptol., vol. 11, no. 2, 1998.
23. M. O. Rabin, "How to exchange secrets by oblivious transfer," Technical Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
24. R. L. Rivest, "Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer," Manuscript, 1999. Available at: http://theory.lcs.mit.edu/~rivest/Rivest- commitment.pdf
25. S. Wiesner, "Conjugate coding," Sigact News, vol. 15, no. 1, 1983, pp. 78-88; original manuscript written circa 1970.
26. S. Wolf, J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation, Proc. CRYPTO '05. LNCS, vol. 3621, pp. 467-477, 2005.