default search action
Charles H. Bennett
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j20]Charles H. Bennett, Gilles Brassard, Seth Breidbart:
Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP. Nat. Comput. 13(4): 453-458 (2014) - [j19]Charles H. Bennett, Gilles Brassard:
Quantum cryptography: Public key distribution and coin tossing. Theor. Comput. Sci. 560: 7-11 (2014) - [j18]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels. IEEE Trans. Inf. Theory 60(5): 2926-2959 (2014) - 2013
- [i5]Charles H. Bennett, C. Jess Riedel:
On the security of key distribution based on Johnson-Nyquist noise. CoRR abs/1303.7435 (2013) - 2010
- [i4]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. CoRR abs/1006.3520 (2010)
2000 – 2009
- 2009
- [i3]Charles H. Bennett, Igor Devetak, Aram W. Harrow, Peter W. Shor, Andreas J. Winter:
Quantum Reverse Shannon Theorem. CoRR abs/0912.5537 (2009) - 2008
- [c7]Charles H. Bennett, Mavis Donkor:
Thermodynamics of error correction: speed-error-dissipation tradeoff in copying. ITW 2008: 1 - 2006
- [j17]Charles H. Bennett:
Quantum Cryptography: Principles and Prospects (Quantumkryptographie: Prinzipien und Ausblick). it Inf. Technol. 48(6): 332- (2006) - 2005
- [j16]Charles H. Bennett, Patrick M. Hayden, Debbie W. Leung, Peter W. Shor, Andreas J. Winter:
Remote preparation of quantum states. IEEE Trans. Inf. Theory 51(1): 56-74 (2005) - 2004
- [j15]Charles H. Bennett:
A resource-based view of quantum information. Quantum Inf. Comput. 4(6): 460-466 (2004) - 2003
- [j14]Charles H. Bennett, Aram W. Harrow, Debbie W. Leung, John A. Smolin:
On the capacities of bipartite Hamiltonians and unitary gates. IEEE Trans. Inf. Theory 49(8): 1895-1911 (2003) - [i2]Charles H. Bennett:
Improvements to time bracketed authentication. CoRR cs.CR/0308026 (2003) - 2002
- [j13]Charles H. Bennett, Peter W. Shor, John A. Smolin, Ashish V. Thapliyal:
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem. IEEE Trans. Inf. Theory 48(10): 2637-2655 (2002) - [i1]Charles H. Bennett, John A. Smolin:
Trust enhancement by multiple random beacons. CoRR cs.CR/0201003 (2002) - 2000
- [j12]Charles H. Bennett:
Rolf Landauer - in Memoriam. Appl. Algebra Eng. Commun. Comput. 10(4/5): 273-276 (2000) - [j11]Charles H. Bennett:
Notes on the history of reversible computation. IBM J. Res. Dev. 44(1): 270-278 (2000)
1990 – 1999
- 1998
- [j10]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Information Distance. IEEE Trans. Inf. Theory 44(4): 1407-1423 (1998) - [j9]Charles H. Bennett, Peter W. Shor:
Quantum Information Theory. IEEE Trans. Inf. Theory 44(6): 2724-2742 (1998) - 1997
- [j8]Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh V. Vazirani:
Strengths and Weaknesses of Quantum Computing. SIAM J. Comput. 26(5): 1510-1523 (1997) - 1995
- [j7]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer:
Generalized privacy amplification. IEEE Trans. Inf. Theory 41(6): 1915-1923 (1995) - 1993
- [c6]Charles H. Bennett, Péter Gács, Ming Li, Paul M. B. Vitányi, Wojciech H. Zurek:
Thermodynamics of computation and information distance. STOC 1993: 21-30 - 1992
- [j6]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin:
Experimental Quantum Cryptography. J. Cryptol. 5(1): 3-28 (1992) - 1991
- [c5]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Marie-Hélène Skubiszewska:
Practical Quantum Oblivious Transfer. CRYPTO 1991: 351-366 - 1990
- [c4]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin:
Experimental Quantum Cryptography. EUROCRYPT 1990: 253-265
1980 – 1989
- 1989
- [j5]Charles H. Bennett:
Time/Space Trade-Offs for Reversible Computation. SIAM J. Comput. 18(4): 766-776 (1989) - [j4]Charles H. Bennett, Gilles Brassard:
Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working]. SIGACT News 20(4): 78-80 (1989) - 1988
- [j3]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert:
Privacy Amplification by Public Discussion. SIAM J. Comput. 17(2): 210-229 (1988) - 1987
- [j2]Charles H. Bennett, Gilles Brassard:
Quantum public key distribution reinvented. SIGACT News 18(4): 51-53 (1987) - 1985
- [c3]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert:
How to Reduce Your Enemy's Information (Extended Abstract). CRYPTO 1985: 468-476 - 1984
- [c2]Charles H. Bennett, Gilles Brassard:
An Update on Quantum Cryptography. CRYPTO 1984: 475-480 - 1982
- [c1]Charles H. Bennett, Gilles Brassard, Seth Breidbart, Stephen Wiesner:
Quantum Cryptography, or Unforgeable Subway Tokens. CRYPTO 1982: 267-275 - 1981
- [j1]Charles H. Bennett, John Gill:
Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1. SIAM J. Comput. 10(1): 96-113 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint