Efficient protocols achieving the commitment capacity of noisy correlations

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1432-1436

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

^a CHUO UNIVERSITY   (Japan)

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

^c UNIVERSITY OF BRASILIA   (Brazil)

^d UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIT COMMITMENT; COMMITMENT CAPACITY; NOISY CHANNELS; NOISY CORRELATIONS;

CHANNEL CAPACITY; CORRELATION METHODS; PHASE NOISE; SECURITY OF DATA;

NETWORK PROTOCOLS;

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

References (18)

1. R. Alicki and M. Fannes, "Continuity of Quantum Conditional Information," J. Phys. A: Math. Gen., vol. 37, no. 5, pp. L55-L57, 2004.
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. M. Blum, "Coin flipping by telephone: a protocol for solving impossible problems," Proc. IEEE Computer Conference, pp. 133-137, 1982.
4. G. Brassard, D. Chaum, C. Crépeau, "Minimum disclosure proofs of knowledge," J. Computer Syst. Sci., vol. 37, pp. 156-189, 1988.
5. C. Crépeau, "Efficient Cryptographic Protocols Based on Noisy Channels," Proc. EUROCRYPT '97. LNCS, vol. 1233, pp. 306-317, 1997.
6. D. Chaum, I. Damgård, and J. van de Graaf, "Multi-party Computations Ensuring Privacy of Each Party's Input and Correctness of the Result," Proc. CRYPTO '87. LNCS, vol. 293, pp. 87-119, 1988.
7. C. Crépeau, J. Kilian, "Achieving oblivious transfer using weakened security assumptions," Proc. 29th FOCS, IEEE, pp. 42-52, 1988.
8. J.L. Carter, M.N. Wegman, "Universal Classes of hash functions," J. of Computer and Syst. Sci., vol. 18, pp. 143-154, 1979.
9. I. B. 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.
10. O. Goldreich, S. Micali, A. Wigderson, "Proofs that Yield Nothing but the Validity of the Assertion, and the Methodology of Cryptographic Protocol Design," Proc. 27th IEEE FOCS. pp. 174-187, 1986.
11. 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.
12. J. Håstad, R. Impagliazzo, L.A. Levin, M. Luby, "A Pseudorandom Generator from any one-way function," SIAM J. on Comp., vol. 28, no. 4., pp. 1364-1396, 1999.
13. H. Imai, J. Müller-Quade, A. C. A. Nascimento, A. Winter, "Rates for Bit Commitment and Coin Tossing from Noisy Correlation," Proc. IEEE ISIT '04. p. 47, 2004.
14. U. Maurer and S. Wolf, "Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free," Proc. EUROCRYPT '00. LNCS, vol. 1807, pp. 351-368, 2000.
15. M. Naor, "Bit commitment using pseudo-randomness", J. Cryptology, vol. 2, no. 2, pp. 151-158, 1991.
16. C. E. Shannon, "A mathematical theory of communication," Bell System Tech. J. vol. 27, pp. 379-423 and 623-656, 1948.
17. A. Winter, A. C. A. Nascimento, H. Imai, "Commitment Capacity of Discrete Memoryless Channels", Proc. 9th IMA International Conf. on Cryptography and Coding, LNCS, vol. 2898, pp. 35-51, 2003.
18. S. Wolf, J. Wullschleger, "Zero-error information and applications in cryptography", Proc. IEEE ITW '04, 2004.