Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gilles Brassard
2010 – today
- 2013
[j36]Esma Aïmeur, Gilles Brassard, Sébastien Gambs: Quantum speed-up for unsupervised learning. Machine Learning 90(2): 261-287 (2013)
[j35]Gilles Brassard, André Allan Méthot: Strict hierarchy among Bell Theorems. Theor. Comput. Sci. 486: 4-10 (2013)
[j34]Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf: Classical, quantum and nonsignalling resources in bipartite games. Theor. Comput. Sci. 486: 61-72 (2013)- 2012
[j33]Esma Aïmeur, Gilles Brassard, Sébastien Gambs, David Schönfeld: P3ERS: Privacy-Preserving PEer Review System. Transactions on Data Privacy 5(3): 553-578 (2012)
[c53]Esma Aïmeur, Gilles Brassard, Paul Molins: Reconstructing Profiles from Information Disseminated on the Internet. SocialCom/PASSAT 2012: 875-883
[c52]Gilles Brassard, Marc Kaplan: Simulating Equatorial Measurements on GHZ States with Finite Expected Communication Cost. TQC 2012: 65-73- 2011
[c51]Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail: Merkle Puzzles in a Quantum World. CRYPTO 2011: 391-410
[r2]Gilles Brassard, Claude Crépeau: Quantum Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 1005-1010
[i1]Gilles Brassard, Frédéric Dupuis, Sébastien Gambs, Alain Tapp: 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 abs/1106.4267 (2011)
2000 – 2009
- 2008
[j32]Esma Aïmeur, Gilles Brassard, José Manuel Fernandez, Flavien Serge Mani Onana: Alambic : a privacy-preserving recommender system for electronic commerce. Int. J. Inf. Sec. 7(5): 307-334 (2008)
[c50]Esma Aïmeur, Gilles Brassard, José Manuel Fernandez, Flavien Serge Mani Onana, Zbigniew Rakowski: Experimental Demonstration of a Hybrid Privacy-Preserving Recommender System. ARES 2008: 161-170
[c49]Guido Berlín, Gilles Brassard, Félix Bussières, Nicolas Godbout: Loss-Tolerant Quantum Coin Flipping. ICQNM 2008: 1-9
[c48]
[c47]Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, Stefan Wolf: Classical, Quantum and Non-signalling Resources in Bipartite Games. ICQNM 2008: 80-89
[c46]- 2007
[c45]Gilles Brassard, Anne Broadbent, Joseph Fitzsimons, Sébastien Gambs, Alain Tapp: Anonymous Quantum Communication. ASIACRYPT 2007: 460-473
[c44]- 2006
[j31]Esma Aïmeur, Gilles Brassard, Flavien Serge Mani Onana: Blind Electronic Commerce. Journal of Computer Security 14(6): 535-559 (2006)
[c43]Esma Aïmeur, Gilles Brassard, Sébastien Gambs: Machine Learning in a Quantum World. Canadian Conference on AI 2006: 431-442
[c42]Esma Aïmeur, Gilles Brassard, José Manuel Fernandez, Flavien Serge Mani Onana: Privacy-preserving demographic filtering. SAC 2006: 872-878- 2005
[j30]Esma Aïmeur, Gilles Brassard, Sébastien Paquet: Personal Knowledge Publishing: Fostering Interdisciplinary Communication. IEEE Intelligent Systems 20(2): 46-53 (2005)
[j29]Gilles Brassard, André Allan Méthot, Alain Tapp: Minimum entangled state dimension required for pseudo-telepathy. Quantum Information & Computation 5(4): 275-284 (2005)
[j28]Gilles Brassard, Anne Broadbent, Alain Tapp: Recasting mermin's multi-player game into the framework of pseudo-telepathy. Quantum Information & Computation 5(7): 538-550 (2005)
[r1]Gilles Brassard, Claude Crépeau: Quantum Cryptography. Encyclopedia of Cryptography and Security 2005- 2004
[j27]Gilles Brassard, Pawel Horodecki, Tal Mor: TelePOVM - A generalized quantum teleportation scheme. IBM Journal of Research and Development 48(1): 87-98 (2004)
[j26]Eli Biham, Gilles Brassard, Dan Kenigsberg, Tal Mor: Quantum computing without entanglement. Theor. Comput. Sci. 320(1): 15-33 (2004)
[c41]Esma Aïmeur, Gilles Brassard, Flavien Serge Mani Onana: Blind sales in electronic commerce. ICEC 2004: 148-157
[c40]- 2003
[j25]Gilles Brassard, Claude Crépeau, Stefan Wolf: Oblivious Transfers and Privacy Amplification. J. Cryptology 16(4): 219-237 (2003)
[c39]- 2002
[j24]Eli Biham, Michel Boyer, Gilles Brassard, Jeroen van de Graaf, Tal Mor: Security of Quantum Key Distribution against All Collective Attacks. Algorithmica 34(4): 372-388 (2002)
[c38]Esma Aïmeur, Gilles Brassard, Hugo Dufort, Sébastien Gambs: CLARISSE: A Machine Learning Tool to Initialize Student Models. Intelligent Tutoring Systems 2002: 718-728- 2000
[c37]Gilles Brassard, Norbert Lütkenhaus, Tal Mor, Barry C. Sanders: Security Aspects of Practical Quantum Cryptography. EUROCRYPT 2000: 289-299
1990 – 1999
- 1998
[c36]
[c35]
[c34]Gilles Brassard, Peter Høyer, Alain Tapp: Quantum Cryptanalysis of Hash and Claw-Free Functions. LATIN 1998: 163-169
[c33]- 1997
[j23]Charles H. Bennett, Ethan Bernstein, Gilles Brassard, Umesh V. Vazirani: Strengths and Weaknesses of Quantum Computing. SIAM J. Comput. 26(5): 1510-1523 (1997)
[j22]Gilles Brassard, Peter Høyer, Alain Tapp: Quantum cryptanalysis of hash and claw-free functions. SIGACT News 28(2): 14-19 (1997)
[c32]Gilles Brassard: Quantum Information Processing: The Good, the Bad and the Ugly. CRYPTO 1997: 337-341
[c31]Gilles Brassard, Claude Crépeau: Oblivious Transfers and Privacy Amplification. EUROCRYPT 1997: 334-347
[c30]Gilles Brassard, Peter Høyer: An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. ISTCS 1997: 12-23- 1996
[b4]Gilles Brassard, Paul Bratley: Fundamentals of algorithms. Prentice Hall 1996, ISBN 978-0-13-335068-5, pp. I-XIX, 1-524
[j21]
[j20]Gilles Brassard, Claude Crépeau, Miklos Santha: Oblivious transfers and intersecting codes. IEEE Transactions on Information Theory 42(6): 1769-1780 (1996)
[c29]- 1995
[j19]
[j18]Joan Boyar, Gilles Brassard, René Peralta: Subquadratic Zero-Knowledge. J. ACM 42(6): 1169-1193 (1995)
[j17]Gilles Brassard: Cryptology Column: The Book I've Always Wanted To Write (Almost). SIGACT News 26(2): 18-20 (1995)
[j16]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Ueli M. Maurer: Generalized privacy amplification. IEEE Transactions on Information Theory 41(6): 1915-1923 (1995)
[p1]- 1994
[j15]Gilles Brassard: Quantum computing: the end of classical cryptography? SIGACT News 25(4): 15-21 (1994)- 1993
[b3]Gilles Brassard, Paul Bratley: Algorithmik - Theorie und Praxis. Wolfram's Anwender- und Programmierhandbuch, Wolfram's Verlag 1993, ISBN 978-3-925328-09-1, pp. 1-463
[c28]Gilles Brassard, Louis Salvail: Secret-Key Reconciliation by Public Discussion. EUROCRYPT 1993: 410-423
[c27]Gilles Brassard, Claude Crépeau, Richard Jozsa, Denis Langlois: A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties. FOCS 1993: 362-371- 1992
[j14]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin: Experimental Quantum Cryptography. J. Cryptology 5(1): 3-28 (1992)
[c26]André Berthiaume, Gilles Brassard: The Quantum Challenge to Structural Complexity Theory. Structure in Complexity Theory Conference 1992: 132-137- 1991
[j13]Samy Bengio, Gilles Brassard, Yvo Desmedt, Claude Goutier, Jean-Jacques Quisquater: Secure Implementations of Identification Systems. J. Cryptology 4(3): 175-183 (1991)
[j12]Gilles Brassard, Claude Crépeau, Moti Yung: Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theor. Comput. Sci. 84(1): 23-52 (1991)
[c25]Charles H. Bennett, Gilles Brassard, Claude Crépeau, Marie-Hélène Skubiszewska: Practical Quantum Oblivious Transfer. CRYPTO 1991: 351-366
[c24]
[c23]Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger: Computationally Convincing Proofs of Knowledge. STACS 1991: 251-262- 1990
[j11]Gilles Brassard: Cryptology - column 4: hiding information from oracles. SIGACT News 21(2): 5 (1990)
[c22]Gilles Brassard, Claude Crépeau: Quantum Bit Commitment and Coin Tossing Protocols. CRYPTO 1990: 49-61
[c21]
[c20]Charles H. Bennett, François Bessette, Gilles Brassard, Louis Salvail, John A. Smolin: Experimental Quantum Cryptography. EUROCRYPT 1990: 253-265
[e1]Gilles Brassard (Ed.): Advances in Cryptology - CRYPTO '89, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings. Lecture Notes in Computer Science 435, Springer 1990, ISBN 3-540-97317-6
1980 – 1989
- 1989
[j10]
[j9]
[j8]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)
[c19]
[c18]
[c17]Gilles Brassard, Claude Crépeau, Moti Yung: Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract). EUROCRYPT 1989: 192-195
[c16]Gilles Brassard, Claude Crépeau, Moti Yung: Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds. ICALP 1989: 123-136- 1988
[b2]Gilles Brassard, Paul Bratley: Algorithmics - theory and practice. Prentice Hall 1988, ISBN 978-0-13-023169-7, pp. I-XVI, 1-361
[b1]Gilles Brassard: Modern Cryptology - A Tutorial. Lecture Notes in Computer Science 325, Springer 1988, ISBN 3-540-96842-3
[j7]Gilles Brassard, Sampath Kannan: The Generation of Random Permutations on the Fly. Inf. Process. Lett. 28(4): 207-212 (1988)
[j6]Gilles Brassard, David Chaum, Claude Crépeau: Minimum Disclosure Proofs of Knowledge. J. Comput. Syst. Sci. 37(2): 156-189 (1988)
[j5]Pierre Beauchemin, Gilles Brassard, Claude Crépeau, Claude Goutier, Carl Pomerance: The Generation of Random Numbers that Are Probably Prime. J. Cryptology 1(1): 53-64 (1988)
[j4]Pierre Beauchemin, Gilles Brassard: A Generalization of Hellman's Extension to Shannon's Approach to Cryptography. J. Cryptology 1(2): 129-131 (1988)
[j3]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert: Privacy Amplification by Public Discussion. SIAM J. Comput. 17(2): 210-229 (1988)
[c15]- 1987
[c14]
[c13]Pierre Beauchemin, Gilles Brassard: A Generalization of Hellman's Extension of Shannon's Approach to Cryptography (Abstract). CRYPTO 1987: 461- 1986
[c12]Gilles Brassard, Claude Crépeau: Zero-Knowledge Simulation of Boolean Circuits. CRYPTO 1986: 223-233
[c11]Gilles Brassard, Claude Crépeau, Jean-Marc Robert: All-or-Nothing Disclosure of Secrets. CRYPTO 1986: 234-238
[c10]Pierre Beauchemin, Gilles Brassard, Claude Crépeau: Two Observations on Probabilistic Primality Testing. CRYPTO 1986: 443-450
[c9]Gilles Brassard, Claude Crépeau, Jean-Marc Robert: Information Theoretic Reductions among Disclosure Problems. FOCS 1986: 168-173
[c8]Gilles Brassard, Claude Crépeau: Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. FOCS 1986: 188-195- 1985
[c7]Charles H. Bennett, Gilles Brassard, Jean-Marc Robert: How to Reduce Your Enemy's Information (Extended Abstract). CRYPTO 1985: 468-476- 1984
[c6]- 1983
[j2]Gilles Brassard: Relativized cryptography. IEEE Transactions on Information Theory 29(6): 877-893 (1983)- 1982
[c5]Gilles Brassard: On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys. CRYPTO 1982: 79-86
[c4]Charles H. Bennett, Gilles Brassard, Seth Breidbard, Stephen Wiesner: Quantum Cryptography, or Unforgeable Subway Tokens. CRYPTO 1982: 267-275- 1981
[j1]Gilles Brassard: A Time-Luck Tradeoff in Relativized Cryptography. J. Comput. Syst. Sci. 22(3): 280-311 (1981)
[c3]- 1980
[c2]
1970 – 1979
- 1979
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:32 CEST by the dblp team



