How to Reduce your Enemy’s Information (extended abstract)-Reference-Cited by-同舟云学术

How to Reduce your Enemy’s Information (extended abstract)

Published: Issue: Volume: Page:468-476
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bennett Charles H.,Brassard Gilles,Robert Jean-Marc

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-39799-X_37.pdf

Reference14 articles.

1. E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.

2. G. Brassard, “On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys”, in Advances in Cryptology: Proc. of Crypto 82, D. Chaum, R. L. Rivest and A. T. Sherman, eds., Plenum, New York, 1983, pp. 267–275.

3. C. H. Bennett and G. Brassard, “Quantum Cryptography and its Application to Provably Secure Key Expansion, Public-Key Distribution and Coin-Tossing”, in IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, December 1984, pp. 175–179.

4. Lect Notes Comput Sci;C. H. Bennett,1985

5. C. H. Bennett, G. Brassard and J.-M. Robert, “Privacy Amplification through Public Discussion”, submitted to SIAM J. Comput., 1985.

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

1. Large-scale quantum key distribution network simulator;Journal of Optical Communications and Networking;2024-03-12

2. Unified View for Notions of Bit Security;Advances in Cryptology – ASIACRYPT 2023;2023

3. Extractors for Small Zero-Fixing Sources;Combinatorica;2022-03-14

4. How to Extract Useful Randomness from Unreliable Sources;Advances in Cryptology – EUROCRYPT 2020;2020

5. Round complexity in the local transformations of quantum and classical states;Nature Communications;2017-12