| Claude Crépeau | |
|---|---|
| Name | Claude Crépeau |
| Birth place | Quebec City, Canada |
| Nationality | Canadian |
| Fields | Quantum information, Quantum cryptography, Theoretical computer science |
| Workplaces | McGill University, CRM |
| Alma mater | McGill University, Massachusetts Institute of Technology |
| Doctoral advisor | Bernard M. E. Moret |
| Known for | Quantum cryptography protocols, quantum information theory, secure multi-party computation |
| Awards | John Charles Polanyi Prize |
Claude Crépeau
Claude Crépeau is a Canadian researcher and professor known for foundational contributions to quantum cryptography and quantum information theory. His work spans protocol design, security proofs, and complexity-theoretic analyses that have shaped theoretical and practical approaches to secure communication in the presence of quantum adversaries. Crépeau's research matters to Quantum Physics because it links quantum-mechanical principles such as entanglement and no-cloning to cryptographic primitives and information-theoretic security.
Claude Crépeau was born and raised in Quebec City and completed his early education in Quebec. He studied mathematics and computer science at McGill University, where he developed an interest in algorithms and complexity theory. He pursued doctoral studies with emphasis on cryptography and theoretical computer science at Massachusetts Institute of Technology (MIT), interacting with researchers active in quantum computation and classical cryptography. His formative training combined rigorous computer science methods with physical intuition about quantum systems, leading him to positions at research centres such as the CRM and the School of Computer Science at McGill University.
Crépeau made early and influential contributions to protocols that exploit quantum mechanics for cryptographic tasks. He co-developed variants of quantum protocols for secure two-party computation and primitives such as quantum bit commitment and quantum oblivious transfer, analyzing their security under realistic assumptions. His work frequently leveraged the no-cloning theorem and properties of quantum entanglement to derive information-theoretic bounds and impossibility results, situating his contributions alongside seminal results by researchers such as Charles H. Bennett, Gilles Brassard, and Dominic Mayers.
Notable theoretical results from Crépeau include formalizations of security for quantum variants of classical primitives and constructive reductions between primitives like oblivious transfer and secure function evaluation in the quantum setting. He produced security proofs that account for entangled cheating strategies and coherent quantum attacks, connecting cryptographic security definitions with operational tasks in quantum communication.
Beyond cryptography, Crépeau has contributed to the broader field of quantum information theory by studying capacities, resource trade-offs, and the role of entanglement in communication tasks. His publications address topics such as entanglement-assisted communication, quantum channel capacities, and the interplay between classical and quantum information in distributed protocols. He collaborated on analyses of quantum teleportation variants and on protocols that convert entanglement into secure correlation for cryptographic uses, building on foundational work like quantum teleportation by Bennett et al. and theoretical frameworks such as quantum Shannon theory.
Crépeau's theoretical methods draw on complexity theory and information-theoretic tools, including entropy inequalities and reductions used by researchers like Peter W. Shor, John Preskill, and Igor Devetak. His work has informed both the design of practical quantum key distribution schemes and rigorous security models that bridge abstract quantum models and implementable systems.
Throughout his career, Crépeau has collaborated with leading figures in quantum computing and cryptography, including André Chailloux, Gilles Brassard, Léo Salvail, and Richard Jozsa. He participated in projects on quantum key distribution (QKD) that explore composable security and finite-key effects, and on quantum implementations of classical cryptographic tasks such as zero-knowledge proofs adapted to quantum verifiers and provers.
Crépeau co-authored influential papers on achieving secure multiparty computation using quantum resources and on reductions that relate QKD, oblivious transfer, and bit commitment under various physical assumptions (for example, relativistic constraints or noisy-storage models). He has been active in interdisciplinary collaborations linking experimental quantum optics groups implementing QKD hardware with theoretical teams working on protocol robustness and composability frameworks such as the Universal Composability model developed by Ran Canetti and extended to quantum settings by other researchers.
Claude Crépeau has received recognition for both theoretical depth and mentoring of students who became active researchers in quantum information science. His awards and institutional honors include national research prizes and positions at prominent centres such as the CRM and endowed chairs at McGill University. He has served on program committees for conferences like the Quantum Information Processing (QIP) conference and the International Cryptology Conference (CRYPTO), influencing research agendas at the intersection of physics and computer science.
Crépeau's impact is reflected in widely cited results that clarified which cryptographic tasks are feasible in a quantum world and which require additional assumptions or resources. His work helped to establish rigorous connections between laboratory-implementable quantum phenomena—such as entanglement distribution and decoherence—and abstract security guarantees, thereby guiding both theoretical development and experimental validation in the growing field of quantum cryptography and quantum communication.
Category:Quantum cryptographers Category:Canadian physicists Category:McGill University faculty