André Chailloux

发表

Quantum commitments from complexity assumptions

Iordanis Kerenidis, André Chailloux, Bill Rosgen, 2010, computational complexity.

Weak Coin Flipping in a Device-Independent Setting

Stefano Pironio, Iordanis Kerenidis, Jonathan Silman, 2011, TQC.

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

Iordanis Kerenidis, Salil P. Vadhan, André Chailloux, 2008, TCC.

Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost

André Chailloux, Giannicola Scarpa, 2014, ICALP.

Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries

André Chailloux, Anthony Leverrier, 2017, EUROCRYPT.

Arbitrarily long relativistic bit commitment

Kaushik Chakraborty, André Chailloux, Anthony Leverrier, 2015, Physical review letters.

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias

Iordanis Kerenidis, Dorit Aharonov, André Chailloux, 2014, SIAM J. Comput..

The Complexity of the Separable Hamiltonian Problem

Or Sattath, André Chailloux, Or Sattath, 2011, 2012 IEEE 27th Conference on Computational Complexity.

Optimal Quantum Strong Coin Flipping

Iordanis Kerenidis, André Chailloux, Iordanis Kerenidis, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Optimal Bounds for Quantum Bit Commitment

Iordanis Kerenidis, André Chailloux, Iordanis Kerenidis, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Increasing the power of the verifier in Quantum Zero Knowledge

Iordanis Kerenidis, André Chailloux, 2008, FSTTCS.

Graph-theoretical Bounds on the Entangled Value of Non-local Games

Simone Severini, André Chailloux, Giannicola Scarpa, 2014, TQC.

The role of help in Classical and Quantum Zero-Knowledge

Iordanis Kerenidis, André Chailloux, 2007, IACR Cryptol. ePrint Arch..

Robust Relativistic Bit Commitment pdf

Kaushik Chakraborty, André Chailloux, Anthony Leverrier, 2016, ArXiv.

Optimal bounds for semi-honest quantum oblivious transfer

Gus Gutoski, André Chailloux, Jamie Sikora, 2013, Chic. J. Theor. Comput. Sci..

Recursive Cheating Strategies for the Relativistic FQ Bit Commitment Protocol

André Chailloux, Rémi Bricout, A. Chailloux, 2016, Cryptogr..

Lower bounds for quantum oblivious transfer

Iordanis Kerenidis, André Chailloux, Jamie Sikora, 2010, Quantum Inf. Comput..

Quantum coin flipping and bit commitment : optimal bounds, pratical constructions and computational security. (Pile-ou-face et mise-en-gage de bit quantique : bornes optimales, constructions pratiques et sécurité calculatoire)

André Chailloux, A. Chailloux, 2011 .

Optimal bounds for parity-oblivious random access codes

Iordanis Kerenidis, André Chailloux, Jamie Sikora, 2014, TQC.

Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment

Iordanis Kerenidis, André Chailloux, Iordanis Kerenidis, 2017, SIAM J. Comput..

Experimental verication of multipartite entanglement in the presence of dishonest parties

Damian Markham, Eleni Diamanti, Iordanis Kerenidis, 2015 .

Optimal bounds for quantum weak oblivious transfer pdf

Gus Gutoski, André Chailloux, Jamie Sikora, 2013, ArXiv.

Quantum Commitments from Complexity Assumptions

Iordanis Kerenidis, André Chailloux, Bill Rosgen, 2011, ICALP.

A Note on the Quantum Query Complexity of Permutation Symmetric Functions

André Chailloux, A. Chailloux, 2018, ITCS.

Lattice sieving via quantum random walks

André Chailloux, Johanna Loyer, A. Chailloux, 2021, IACR Cryptol. ePrint Arch..

Spekkens ’ toy model in all dimensions and its relationship with stabiliser quantum mechanics

Iordanis Kerenidis, Victor Veitch, Daniel Gottesman, 2017 .