Commitment Capacity of Discrete Memoryless Channels-Reference-Cited by-同舟云学术

Commitment Capacity of Discrete Memoryless Channels

Published:2003 Issue: Volume: Page:35-51
ISSN:0302-9743
Container-title:Cryptography and Coding
language:
Short-container-title:

Author:

Winter Andreas,Nascimento Anderson C. A.,Imai Hideki

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-40974-8_4

Reference26 articles.

1. Ahlswede, R., Csiszár, I.: Common Randomness in Information Theory and Cryptography - Part I: Secret Sharing. IEEE Trans. Inf. Theory 39(4), 1121–1132 (1993)

2. Ahlswede, R., Winter, A.: Strong converse for identification via quantum channels. IEEE Trans. Inf. 48(3), 569–579 (2002); Addendum ibid 49(1), p. 346 (2003)

3. 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–455. ACM, New York (1997)

4. 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–179 (1984)

5. Bennett, C.H., Brassard, G., Crépeau, C., Maurer, U.: Generalized Privacy Amplification. IEEE Trans. Inf. Theory 41(6), 1915–1923 (1995)

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Iterative minimization algorithm on a mixture family;Information Geometry;2024-08-13

2. Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution;IEEE Transactions on Information Theory;2024-01

3. Commitment Capacity of Classical-Quantum Channels;IEEE Transactions on Information Theory;2023-08

4. ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

5. On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25