Gilles Brassard

According to our database1, Gilles Brassard authored at least 123 papers between 1979 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Noisy Interactive Quantum Communication.
SIAM J. Comput., 2019

Key Establishment à la Merkle in a Quantum World.
J. Cryptology, 2019

Parallel Lives: A Local-Realistic Interpretation of "Nonlocal" Boxes.
Entropy, 2019

Remote Sampling with Applications to General Entanglement Simulation.
Entropy, 2019

Was Edgar Allan Poe wrong after all?: technical perspective.
Commun. ACM, 2019

2018
Remote Sampling with Applications to General Entanglement Simulation.
CoRR, 2018

2017
Provably Secure Key Establishment Against Quantum Adversaries.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

Kolmogorov amplification from Bell correlation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Quantum Algorithm for the Collision Problem.
Encyclopedia of Algorithms, 2016

Exact Classical Simulation of the Quantum-Mechanical GHZ Distribution.
IEEE Trans. Information Theory, 2016

Cryptography in a Quantum World.
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

CLiKC: A Privacy-Mindful Approach When Sharing Data.
Proceedings of the Risks and Security of Internet and Systems, 2016

2015
Cryptography in a Quantum World.
CoRR, 2015

Non-locality distillation as cryptographic game.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Quantum cryptography: Public key distribution and coin tossing.
Theor. Comput. Sci., 2014

Quantum Cryptography II: How to re-use a one-time pad safely even if P=NP.
Natural Computing, 2014

Exact Classical Simulation of the GHZ Distribution.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Noisy Interactive Quantum Communication.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Strict hierarchy among Bell Theorems.
Theor. Comput. Sci., 2013

Classical, quantum and nonsignalling resources in bipartite games.
Theor. Comput. Sci., 2013

Quantum speed-up for unsupervised learning.
Machine Learning, 2013

Noisy Interactive Quantum Communication.
CoRR, 2013

2012
P3ERS: Privacy-Preserving PEer Review System.
Trans. Data Privacy, 2012

Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost.
Proceedings of the Theory of Quantum Computation, 2012

Reconstructing Profiles from Information Disseminated on the Internet.
Proceedings of the 2012 International Conference on Privacy, 2012

2011
Quantum information: The conundrum of secure positioning.
Nature, 2011

An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance
CoRR, 2011

Merkle Puzzles in a Quantum World.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2008
Alambic : a privacy-preserving recommender system for electronic commerce.
Int. J. Inf. Sec., 2008

Quantum Merkle Puzzles.
Proceedings of the Second International Conference on Quantum, 2008

Strict Hierarchy of Bell Theorems.
Proceedings of the Second International Conference on Quantum, 2008

Classical, Quantum and Non-signalling Resources in Bipartite Games.
Proceedings of the Second International Conference on Quantum, 2008

Loss-Tolerant Quantum Coin Flipping.
Proceedings of the Second International Conference on Quantum, 2008

Experimental Demonstration of a Hybrid Privacy-Preserving Recommender System.
Proceedings of the The Third International Conference on Availability, 2008

2007
Quantum clustering algorithms.
Proceedings of the Machine Learning, 2007

Anonymous Quantum Communication - (Extended Abstract).
Proceedings of the Information Theoretic Security - Second International Conference, 2007

Anonymous Quantum Communication.
Proceedings of the Advances in Cryptology, 2007

2006
Blind Electronic Commerce.
Journal of Computer Security, 2006

Privacy-preserving demographic filtering.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Machine Learning in a Quantum World.
Proceedings of the Advances in Artificial Intelligence, 2006

2005
Quantum Cryptography.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Minimum entangled state dimension required for pseudo-telepathy.
Quantum Information & Computation, 2005

Recasting mermin's multi-player game into the framework of pseudo-telepathy.
Quantum Information & Computation, 2005

Personal Knowledge Publishing: Fostering Interdisciplinary Communication.
IEEE Intelligent Systems, 2005

Brief history of quantum cryptography: a personal perspective.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

2004
Quantum computing without entanglement.
Theor. Comput. Sci., 2004

TelePOVM - A generalized quantum teleportation scheme.
IBM Journal of Research and Development, 2004

Quantum Communication Complexity: A Survey.
Proceedings of the 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 2004

Blind sales in electronic commerce.
Proceedings of the 6th International Conference on Electronic Commerce, 2004

2003
Oblivious Transfers and Privacy Amplification.
J. Cryptology, 2003

Multi-party Pseudo-Telepathy.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002
Security of Quantum Key Distribution against All Collective Attacks.
Algorithmica, 2002

CLARISSE: A Machine Learning Tool to Initialize Student Models.
Proceedings of the Intelligent Tutoring Systems, 6th International Conference, 2002

2000
Security Aspects of Practical Quantum Cryptography.
Proceedings of the Advances in Cryptology, 2000

1998
Multi-particle Entanglement via Two-Particle Entanglement.
Proceedings of the Quantum Computing and Quantum Communications, 1998

Quantum Cryptanalysis of Hash and Claw-Free Functions.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Quantum Counting.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

New Horizons in Quantum Information Processing.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Quantum cryptanalysis of hash and claw-free functions.
SIGACT News, 1997

Strengths and Weaknesses of Quantum Computing.
SIAM J. Comput., 1997

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

Oblivious Transfers and Privacy Amplification.
Proceedings of the Advances in Cryptology, 1997

Quantum Information Processing: The Good, the Bad and the Ugly.
Proceedings of the Advances in Cryptology, 1997

1996
Oblivious transfers and intersecting codes.
IEEE Trans. Information Theory, 1996

25 years of quantum cryptography.
SIGACT News, 1996

Oblivious Transfers and Intersecting Codes.
IACR Cryptology ePrint Archive, 1996

New Trends in Quantum Computing.
Proceedings of the STACS 96, 1996

Fundamentals of algorithms.
Prentice Hall, ISBN: 978-0-13-335068-5, 1996

1995
Generalized privacy amplification.
IEEE Trans. Information Theory, 1995

Cryptology Column: The Book I've Always Wanted To Write (Almost).
SIGACT News, 1995

Subquadratic Zero-Knowledge.
J. ACM, 1995

Time for Another Paradigm Shift.
ACM Comput. Surv., 1995

A Quantum Jump in Computer Science.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
Quantum computing: the end of classical cryptography?
SIGACT News, 1994

1993
A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

Secret-Key Reconciliation by Public Discussion.
Proceedings of the Advances in Cryptology, 1993

Algorithmik - Theorie und Praxis.
Wolfram's Anwender- und Programmierhandbuch, Wolfram's Verlag, ISBN: 978-3-925328-09-1, 1993

1992
Experimental Quantum Cryptography.
J. Cryptology, 1992

The Quantum Challenge to Structural Complexity Theory.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991
Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols.
Theor. Comput. Sci., 1991

How convincing is your protocol?
SIGACT News, 1991

Secure Implementations of Identification Systems.
J. Cryptology, 1991

Computationally Convincing Proofs of Knowledge.
Proceedings of the STACS 91, 1991

Subquadratic Zero-Knowledge
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Practical Quantum Oblivious Transfer.
Proceedings of the Advances in Cryptology, 1991

1990
Cryptology - column 4: hiding information from oracles.
SIGACT News, 1990

Cryptology - column 3 hot news on interactive protocols.
SIGACT News, 1990

Experimental Quantum Cryptography.
Proceedings of the Advances in Cryptology, 1990

One-Way Group Actions.
Proceedings of the Advances in Cryptology, 1990

Quantum Bit Commitment and Coin Tossing Protocols.
Proceedings of the Advances in Cryptology, 1990

1989
Cryptology - column 2.
SIGACT News, 1989

Cryptology column.
SIGACT News, 1989

Experimental quantum cryptography: the dawn of a new era for quantum cryptography: the experimental prototype is working].
SIGACT News, 1989

Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract).
Proceedings of the Advances in Cryptology, 1989

Sorting out Zero-Knowledge.
Proceedings of the Advances in Cryptology, 1989

How to Improve Signature Schemes.
Proceedings of the Advances in Cryptology, 1989

1988
Privacy Amplification by Public Discussion.
SIAM J. Comput., 1988

The Generation of Random Numbers that Are Probably Prime.
J. Cryptology, 1988

A Generalization of Hellman's Extension to Shannon's Approach to Cryptography.
J. Cryptology, 1988

Minimum Disclosure Proofs of Knowledge.
J. Comput. Syst. Sci., 1988

The Generation of Random Permutations on the Fly.
Inf. Process. Lett., 1988

"Practical IP" <= MA.
Proceedings of the Advances in Cryptology, 1988

Modern Cryptology - A Tutorial
Lecture Notes in Computer Science 325, Springer, ISBN: 3-540-96842-3, 1988

Algorithmics - theory and practice.
Prentice Hall, ISBN: 978-0-13-023169-7, 1988

1987
A Generalization of Hellman's Extension of Shannon's Approach to Cryptography (Abstract).
Proceedings of the Advances in Cryptology, 1987

Cryptology in Academia: A Ten Year Retrospective.
Proceedings of the COMPCON'87, 1987

1986
The Design, Evaluation & Modelling of A UHF Power Amplifier for a Mobile Satellite Transponder.
Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

Information Theoretic Reductions among Disclosure Problems
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

All-or-Nothing Disclosure of Secrets.
Proceedings of the Advances in Cryptology, 1986

Zero-Knowledge Simulation of Boolean Circuits.
Proceedings of the Advances in Cryptology, 1986

Two Observations on Probabilistic Primality Testing.
Proceedings of the Advances in Cryptology, 1986

1985
How to Reduce Your Enemy's Information (Extended Abstract).
Proceedings of the Advances in Cryptology, 1985

1984
An Update on Quantum Cryptography.
Proceedings of the Advances in Cryptology, 1984

1983
Relativized cryptography.
IEEE Trans. Information Theory, 1983

1982
Quantum Cryptography, or Unforgeable Subway Tokens.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
A Time-Luck Tradeoff in Relativized Cryptography.
J. Comput. Syst. Sci., 1981

An Optimally Secure Relativized Cryptosystem.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
A Time-Luck Tradeoff in Cryptography
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
A note on the complexity of cryptography (Corresp.).
IEEE Trans. Information Theory, 1979

Relativized Cryptography
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979


  Loading...