{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:12:11Z","timestamp":1771611131440,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540206637","type":"print"},{"value":"9783540409748","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-40974-8_4","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:06:11Z","timestamp":1283727971000},"page":"35-51","source":"Crossref","is-referenced-by-count":59,"title":["Commitment Capacity of Discrete Memoryless Channels"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Winter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1109\/18.243431","volume":"39","author":"R. Ahlswede","year":"1993","unstructured":"Ahlswede, R., Csisz\u00e1r, I.: Common Randomness in Information Theory and Cryptography - Part I: Secret Sharing. IEEE Trans. Inf. Theory\u00a039(4), 1121\u20131132 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/18.985947","volume":"48","author":"R. Ahlswede","year":"2002","unstructured":"Ahlswede, R., Winter, A.: Strong converse for identification via quantum channels. IEEE Trans. Inf.\u00a048(3), 569\u2013579 (2002); Addendum ibid\u00a049(1), p. 346 (2003)","journal-title":"IEEE Trans. Inf."},{"key":"4_CR3","first-page":"446","volume-title":"Proc. 29thAnnual ACM Symposium on the Theory of Computing","author":"D. Beaver","year":"1997","unstructured":"Beaver, D.: Commodity-Based Cryptography(Extended Abstract). In: Proc. 29thAnnual ACM Symposium on the Theory of Computing, El Paso, TX, May 4-6, pp. 446\u2013455. ACM, New York (1997)"},{"key":"4_CR4","unstructured":"Bennett, C.H., Brassard, G.: Quantum Cryptography: Public Key Distribution and Coin Tossing. In: Proc. IEEE Int. Conf. on Computers Systems and Signal Processing, Bangalore (India), pp. 175\u2013179 (1984)"},{"issue":"6","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Maurer, U.: Generalized Privacy Amplification. IEEE Trans. Inf. Theory\u00a041(6), 1915\u20131923 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/18.720553","volume":"44","author":"C.H. Bennett","year":"1998","unstructured":"Bennett, C.H., Shor, P.W.: Quantum Information Theory. IEEE Trans. Inf. Theory\u00a044(6), 2724\u20132742 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR7","unstructured":"Blum, M.: Coin fipping by telephone: a protocol for solving impossible problems. In: Proc. IEEE Computer Conference, pp. 133\u2013137 (1982)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Crepeau, C.: Minimum disclosure proofs of knowledge. J. Computer Syst. Sci.\u00a037, 156\u2013189 (1988)","journal-title":"J. Computer Syst. Sci."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"G. Brassard","year":"1991","unstructured":"Brassard, G., Crepeau, C., Yung, M.: Constant-round perfect zero-knowledge computationally convincing protocols. Theoretical Computer Science\u00a084, 23\u201352 (1991)","journal-title":"Theoretical Computer Science"},{"key":"4_CR10","unstructured":"Cai, N., Yeung, R.W.: Quantum Privacy and Quanum Wiretap Channels (2003) (manuscript)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"Chernoff, H.: A measure of asymptotic eciency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics\u00a023, 493\u2013507 (1952)","journal-title":"Ann. Math. Statistics"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-69053-0_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"C. Cr\u00e9peau","year":"1997","unstructured":"Cr\u00e9peau, C.: Efficient Cryptographic Protocols Based on Noisy Channels. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 306\u2013317. Springer, Heidelberg (1997)"},{"key":"4_CR13","first-page":"42","volume-title":"Proc. 29th FOCS","author":"C. Cr\u00e9peau","year":"1988","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: Proc. 29th FOCS, pp. 42\u201352. IEEE, Los Alamitos (1988)"},{"key":"4_CR14","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Channels","author":"I. Csisz\u00e1r","year":"1981","unstructured":"Csisz\u00e1r, I., K\u00f6rner, J.: Information Theory: Coding Theorems for Discrete Memoryless Channels. Academic Press, New York (1981)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I.B. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I.B., Kilian, J., Salvail, L.: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-44750-4_7","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"S. Halevi","year":"1995","unstructured":"Halevi, S.: Efficient commitment schemes with bounded sender and unbounded receiver. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 84\u201396. Springer, Heidelberg (1995)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and Provably-Secure Commitment Schemes from Collision Free Hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"issue":"3","key":"4_CR18","first-page":"177","volume":"9","author":"A.S. Holevo","year":"1973","unstructured":"Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum channel. Probl. Inf. Transm.\u00a09(3), 177\u2013183 (1973)","journal-title":"Probl. Inf. Transm."},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/3-540-48071-4_32","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: Protocols for Secret Key Agreement by Public Discussion Based on Common Information. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 461\u2013470. Springer, Heidelberg (1993); Secret Key Agreement by Public Discussion. IEEE Trans. Inf. Theory\u00a039(3),733-742 (1993)"},{"issue":"17","key":"4_CR20","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D. Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Letters\u00a078(17), 3414\u20133417 (1997)","journal-title":"Phys. Rev. Letters"},{"issue":"2","key":"4_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"2","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. J. Cryptology\u00a02(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"4_CR22","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","first-page":"439","volume-title":"STACS 92","author":"R. Ostrovsky","year":"1992","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Secure commitments against a powerful adversary. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 439\u2013448. Springer, Heidelberg (1992)"},{"key":"4_CR24","unstructured":"Rivest, R.L.: Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer (1999) (unpublished manuscript)"},{"key":"4_CR25","first-page":"379","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication, Bell System Tech. Journal\u00a027, 379\u2013423, 623-656 (1948)","journal-title":"Journal"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"A. Wyner","year":"1975","unstructured":"Wyner, A.: The Wire Tap Channel. Bell System Tech. Journal\u00a054, 1355\u20131387 (1975)","journal-title":"Bell System Tech. Journal"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-40974-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T09:09:21Z","timestamp":1591866561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-40974-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206637","9783540409748"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-40974-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}