Commitment capacity of discrete memoryless channels

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

Volumn 2898, Issue , 2003, Pages 35-51

  Winter, Andreas ^a   Nascimento, Anderson C A ^b   Imai, Hideki ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b INSTITUTE OF INDUSTRIAL SCIENCE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY;

BIT COMMITMENT; CHANNEL'S CAPACITY; COIN-TOSSING; DISCRETE MEMORYLESS CHANNELS; LOWER BOUNDS; OPTIMAL RATE; WIRE-TAP CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 23944463739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40974-8_4     Document Type: Article

References (28)

1. R. Ahlswede, I. Csiszár, "Common Randomness in Information Theory and Cryptography - Part I: Secret Sharing", IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, 1993.
2. R. Ahlswede, A. Winter, "Strong converse for identification via quantum channels", IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569-579, 2002.
3. Addendum ibid., vol. 49, no. 1, p. 346, 2003.
4. th Annual ACM Symposium on the Theory of Computing (El Paso, TX, 4-6 May 1997), pp. 446-455, ACM, 1997.
5. C. H. Bennett, G. Brassard, "Quantum Cryptography: Public Key Distribution and Coin Tossing", Proc. IEEE Int. Conf. on Computers Systems and Signal Processing, Bangalore (India), pp. 175-179, 1984.
6. 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.
7. C. H. Bennett, P. W. Shor, "Quantum Information Theory", IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2724-2742, 1998.
8. M. Blum, "Coin fipping by telephone: a protocol for solving impossible problems", Proc. IEEE Computer Conference, pp. 133-137, 1982.
9. G. Brassard, D. Chaum, C. Crepeau, "Minimum disclosure proofs of knowledge", J. Computer Syst. Sci. , vol. 37, pp. 156-189, 1988.
10. G. Brassard, C. Crepeau, M. Yung, "Constant-round perfect zero-knowledge computationally convincing protocols", Theoretical Computer Science, vol. 84, pp. 23-52, 1991.
11. N. Cai, R. W. Yeung, "Quantum Privacy and Quanum Wiretap Channels", manuscript, 2003.
12. H. Chernoff, "A measure of asymptotic eciency for tests of a hypothesis based on the sum of observations", Ann. Math. Statistics, vol. 23, pp. 493-507, 1952.
13. C. Crépeau, "Efficient Cryptographic Protocols Based on Noisy Channels", Advances in Cryptology: Proc. EUROCRYPT 1997 , pp. 306-317, Springer 1997.
14. th FOCS, pp. 42-52. IEEE, 1988.
15. I. Csiszár, J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Channels, Academic Press, NY 1981.
16. I. B. Damgård, J. Kilian, L. Salvail, "On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions", Advances in Cryptology: EUROCRYPT 1999, pp. 56-73, Springer 1999.
17. S. Halevi, "Efficient commitment schemes with bounded sender and unbounded receiver", Proc. CRYPTO 1995, pp. 84-96. LNCS 963, Springer Verlag, 1995.
18. S. Halevi, S. Micali, "Practical and Provably-Secure Commitment Schemes from Collision Free Hashing", Advances in Cryptology: CRYPTO 1996, pp. 201-215, LNCS 1109, Springer Verlag, 1996.
19. A. S. Holevo, "Bounds for the quantity of information transmitted by a quantum channel", Probl. Inf. Transm., vol. 9, no. 3, pp. 177-183, 1973.
20. U. Maurer, "Protocols for Secret Key Agreement by Public Discussion Based on Common Information", Advances in Cryptology: CRYPTO 1992, pp. 461-470,
21. Springer 1993. "Secret Key Agreement by Public Discussion", IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, 1993.
22. D. Mayers, "Unconditionally secure quantum bit commitment is impossible", Phys. Rev. Letters, vol. 78, no. 17, pp. 3414-3417, 1997.
23. M. Naor, "Bit commitment using pseudo-randomness", J. Cryptology, vol. 2, no. 2, pp. 151-158, 1991.
24. M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
25. R. Ostrovsky, R. Venkatesan, M. Yung, "Secure commitments against a powerful adversary", Proc. STAGS 1992, pp. 439-448, LNCS 577, Springer Verlag, 1992.
26. R. L. Rivest, "Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer", unpublished manuscript, 1999.
27. C. E. Shannon, "A mathematical theory of communication", Bell System Tech. Journal, vol. 27, pp. 379-423 and 623-656, 1948.
28. A. Wyner, "The Wire Tap Channel", Bell System Tech. Journal, vol. 54, pp. 1355-1387, 1975.