Gilles Brassard

From MaRDI portal
Person:268455

Available identifiers

zbMath Open brassard.gillesDBLPb/GBrassardWikidataQ92938 ScholiaQ92938MaRDI QIDQ268455

List of research outcomes





PublicationDate of PublicationType
On computable numbers, with an application to the Druckproblem2024-06-03Paper
Quantum cryptanalysis of hash and claw-free functions2023-04-12Paper
Noisy Interactive Quantum Communication2019-09-02Paper
Key establishment à la Merkle in a quantum world2019-08-13Paper
https://portal.mardi4nfdi.de/entity/Q46379772018-05-03Paper
New trends in quantum computing2017-11-16Paper
Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution2017-04-28Paper
An Update on Quantum Cryptography2017-04-10Paper
Exact simulation of the GHZ distribution2017-03-13Paper
Quantum cryptography. II: How to re-use a one-time pad safely even if \(\mathrm P=\mathrm{NP}\)2016-04-15Paper
Cryptography in a Quantum World2016-03-10Paper
Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost2015-12-03Paper
Quantum cryptography: public key distribution and coin tossing2014-12-02Paper
Classical, quantum and nonsignalling resources in bipartite games2013-12-11Paper
Strict hierarchy among Bell theorems2013-12-11Paper
Quantum speed-up for unsupervised learning2013-03-28Paper
Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial2011-12-26Paper
Quantum communication complexity2011-10-17Paper
Merkle Puzzles in a Quantum World2011-08-12Paper
Can quantum-mechanical description of physical reality be considered correct?2010-05-21Paper
Algorithms and Data Structures2010-04-20Paper
Anonymous Quantum Communication2009-12-03Paper
https://portal.mardi4nfdi.de/entity/Q33926852009-08-17Paper
https://portal.mardi4nfdi.de/entity/Q35225282008-09-03Paper
https://portal.mardi4nfdi.de/entity/Q35225522008-09-03Paper
Anonymous Quantum Communication2008-05-15Paper
Experimental quantum cryptography.2007-08-14Paper
Quantum pseudo-telepathy2006-09-28Paper
CAN QUANTUM-MECHANICAL DESCRIPTION OF PHYSICAL REALITY BE CONSIDERED INCOMPLETE?2006-05-10Paper
https://portal.mardi4nfdi.de/entity/Q33749152006-03-01Paper
https://portal.mardi4nfdi.de/entity/Q48195892004-09-27Paper
Oblivious transfer and privacy amplification2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q30461572004-08-12Paper
Quantum computing without entanglement2004-08-10Paper
Security of quantum key distribution against all collective attacks2003-05-04Paper
Multi-particle entanglement via two-party entanglement2002-01-27Paper
Teleportation as a quantum computation.2000-11-20Paper
https://portal.mardi4nfdi.de/entity/Q49391342000-10-22Paper
Quantum cryptography without Bell’s theorem2000-07-16Paper
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels2000-07-16Paper
Oracle Quantum Computing2000-07-16Paper
Reduction of Quantum Entropy by Reversible Extraction of Classical Information2000-07-16Paper
https://portal.mardi4nfdi.de/entity/Q49347322000-02-01Paper
https://portal.mardi4nfdi.de/entity/Q42403371999-10-20Paper
Strengths and Weaknesses of Quantum Computing1998-02-10Paper
Subquadratic zero-knowledge1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q43694441998-01-28Paper
Oblivious transfers and intersecting codes1997-04-27Paper
Generalized privacy amplification1997-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48468061995-09-10Paper
https://portal.mardi4nfdi.de/entity/Q42795661994-09-20Paper
https://portal.mardi4nfdi.de/entity/Q42795631994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q40400551993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40356741993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40238401993-01-23Paper
Modern cryptology. A tutorial1992-09-17Paper
Constant-round perfect zero-knowledge computationally convincing protocols1991-01-01Paper
Minimum disclosure proofs of knowledge1988-01-01Paper
Privacy Amplification by Public Discussion1988-01-01Paper
The generation of random permutations on the fly1988-01-01Paper
A generalization of Hellman's extension of Shannon's approach to cryptography1988-01-01Paper
The generation of random numbers that are probably prime1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34951881988-01-01Paper
Zero-Knowledge Simulation of Boolean Circuits1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37865181987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37936911987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37162921986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36860401985-01-01Paper
Relativized cryptography1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36745391983-01-01Paper
A time-luck tradeoff in relativized cryptography1981-01-01Paper
A note on the complexity of cryptography (Corresp.)1979-01-01Paper

Research outcomes over time

This page was built for person: Gilles Brassard