Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1. - Charles H. Bennett; John Gill (SIAM J. Comput., 1981)

Quantum Cryptography, or Unforgeable Subway Tokens. - Charles H. Bennett; Gilles Brassard; Seth Breidbart; Stephen Wiesner (CRYPTO, 1982)

An Update on Quantum Cryptography. - Charles H. Bennett; Gilles Brassard (CRYPTO, 1984)

How to Reduce Your Enemy's Information (Extended Abstract). - Charles H. Bennett; Gilles Brassard; Jean-Marc Robert 001 (CRYPTO, 1985)

Quantum public key distribution reinvented. - Charles H. Bennett; Gilles Brassard (SIGACT News, 1987)

Privacy Amplification by Public Discussion. - Charles H. Bennett; Gilles Brassard; Jean-Marc Robert 001 (SIAM J. Comput., 1988)

Time/Space Trade-Offs for Reversible Computation. - Charles H. Bennett (SIAM J. Comput., 1989)

Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working]. - Charles H. Bennett; Gilles Brassard (SIGACT News, 1989)

Practical Quantum Oblivious Transfer. - Charles H. Bennett; Gilles Brassard; Claude Crépeau; Marie-Hélène Skubiszewska (CRYPTO, 1991)

Experimental Quantum Cryptography. - Charles H. Bennett; François Bessette; Gilles Brassard; Louis Salvail; John A. Smolin (J. Cryptol., 1992)

Thermodynamics of computation and information distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (STOC, 1993)

Generalized privacy amplification. - Charles H. Bennett; Gilles Brassard; Claude Crépeau; Ueli M. Maurer (IEEE Trans. Inf. Theory, 1995)

Strengths and Weaknesses of Quantum Computing. - Charles H. Bennett; Ethan Bernstein; Gilles Brassard; Umesh V. Vazirani (SIAM J. Comput., 1997)

Information Distance. - Charles H. Bennett; Péter Gács; Ming Li 001; Paul M. B. Vitányi; Wojciech H. Zurek (IEEE Trans. Inf. Theory, 1998)

Quantum Information Theory. - Charles H. Bennett; Peter W. Shor (IEEE Trans. Inf. Theory, 1998)

Rolf Landauer - in Memoriam. - Charles H. Bennett (Appl. Algebra Eng. Commun. Comput., 2000)

Notes on the history of reversible computation. - Charles H. Bennett (IBM J. Res. Dev., 2000)

Trust enhancement by multiple random beacons - Charles H. Bennett; John A. Smolin (CoRR, 2002)

Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. - Charles H. Bennett; Peter W. Shor; John A. Smolin; Ashish V. Thapliyal (IEEE Trans. Inf. Theory, 2002)

Improvements to time bracketed authentication - Charles H. Bennett (CoRR, 2003)

On the capacities of bipartite Hamiltonians and unitary gates. - Charles H. Bennett; Aram W. Harrow; Debbie W. Leung; John A. Smolin (IEEE Trans. Inf. Theory, 2003)

A resource-based view of quantum information. - Charles H. Bennett (Quantum Inf. Comput., 2004)

Remote preparation of quantum states. - Charles H. Bennett; Patrick M. Hayden; Debbie W. Leung; Peter W. Shor; Andreas J. Winter 002 (IEEE Trans. Inf. Theory, 2005)

Quantum Cryptography: Principles and Prospects (Quantumkryptographie: Prinzipien und Ausblick). - Charles H. Bennett (it Inf. Technol., 2006)

Thermodynamics of error correction: speed-error-dissipation tradeoff in copying. - Charles H. Bennett; Mavis Donkor (ITW, 2008)

Quantum Reverse Shannon Theorem. - Charles H. Bennett; Igor Devetak; Aram W. Harrow; Peter W. Shor; Andreas J. Winter 002 (CoRR, 2009)

On the security of key distribution based on Johnson-Nyquist noise - Charles H. Bennett; C. Jess Riedel (CoRR, 2013)

Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP. - Charles H. Bennett; Gilles Brassard; Seth Breidbart (Nat. Comput., 2014)

Quantum cryptography: Public key distribution and coin tossing. - Charles H. Bennett; Gilles Brassard (Theor. Comput. Sci., 2014)

The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. - Charles H. Bennett; Igor Devetak; Aram W. Harrow; Peter W. Shor; Andreas J. Winter 002 (IEEE Trans. Inf. Theory, 2014)