Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. - André Chailloux; Dragos Florin Ciocan; Iordanis Kerenidis; Salil P. Vadhan (IACR Cryptol. ePrint Arch., 2007)

The role of help in Classical and Quantum Zero-Knowledge. - André Chailloux; Iordanis Kerenidis (IACR Cryptol. ePrint Arch., 2007)

Increasing the power of the verifier in Quantum Zero Knowledge. - André Chailloux; Iordanis Kerenidis (FSTTCS, 2008)

Optimal Quantum Strong Coin Flipping. - André Chailloux; Iordanis Kerenidis (FOCS, 2009)

Optimal Bounds for Quantum Bit Commitment. - André Chailloux; Iordanis Kerenidis (FOCS, 2011)

Weak Coin Flipping in a Device-Independent Setting. - Nati Aharon; André Chailloux; Iordanis Kerenidis; Serge Massar; Stefano Pironio; Jonathan Silman (TQC, 2011)

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 (2011)

The Complexity of the Separable Hamiltonian Problem. - André Chailloux; Or Sattath (CCC, 2012)

Optimal bounds for quantum weak oblivious transfer. - André Chailloux; Gus Gutoski; Jamie Sikora (CoRR, 2013)

Lower bounds for quantum oblivious transfer. - André Chailloux; Iordanis Kerenidis; Jamie Sikora (Quantum Inf. Comput., 2013)

Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost. - André Chailloux; Giannicola Scarpa (ICALP (1), 2014)

Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. - André Chailloux; Iordanis Kerenidis; Srijita Kundu; Jamie Sikora (TQC, 2014)

Graph-theoretical Bounds on the Entangled Value of Non-local Games. - André Chailloux; Laura Mancinska; Giannicola Scarpa; Simone Severini (TQC, 2014)

Arbitrarily long relativistic bit commitment. - Kaushik Chakraborty 001; André Chailloux; Anthony Leverrier (CoRR, 2015)

Quantum commitments from complexity assumptions. - André Chailloux; Iordanis Kerenidis; Bill Rosgen (Comput. Complex., 2016)

Optimal bounds for semi-honest quantum oblivious transfer. - André Chailloux; Gus Gutoski; Jamie Sikora (Chic. J. Theor. Comput. Sci., 2016)

Robust Relativistic Bit Commitment. - Kaushik Chakraborty 001; André Chailloux; Anthony Leverrier (CoRR, 2016)

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. - Dorit Aharonov; André Chailloux; Maor Ganz; Iordanis Kerenidis; Loïck Magnin (SIAM J. Comput., 2016)

Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for mathsf NP Secure Against Quantum Adversaries. - André Chailloux; Anthony Leverrier (EUROCRYPT (3), 2017)

Recursive Cheating Strategies for the Relativistic FQ Bit Commitment Protocol. - Rémi Bricout; André Chailloux (Cryptogr., 2017)

A tight security reduction in the quantum random oracle model for code-based signature schemes. - André Chailloux; Thomas Debris-Alazard (IACR Cryptol. ePrint Arch., 2017)

An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography. - André Chailloux; María Naya-Plasencia; André Schrottenloher (IACR Cryptol. ePrint Arch., 2017)

Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment. - André Chailloux; Iordanis Kerenidis (SIAM J. Comput., 2017)

A Note on the Quantum Query Complexity of Permutation Symmetric Functions. - André Chailloux (ITCS, 2019)

Ternary Syndrome Decoding with Large Weight. - Rémi Bricout; André Chailloux; Thomas Debris-Alazard; Matthieu Lequesne (IACR Cryptol. ePrint Arch., 2019)

Quantum security of the Fiat-Shamir transform of commit and open protocols. - André Chailloux (IACR Cryptol. ePrint Arch., 2019)

QCB: Efficient Quantum-secure Authenticated Encryption. - Ritam Bhaumik; Xavier Bonnetain; André Chailloux; Gaëtan Leurent; María Naya-Plasencia; André Schrottenloher; Yannick Seurin (IACR Cryptol. ePrint Arch., 2020)

Tight and Optimal Reductions for Signatures based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. - André Chailloux; Thomas Debris-Alazard (IACR Cryptol. ePrint Arch., 2020)

Relativistic zero-knowledge protocol for NP over the internet unconditionally secure against quantum adversaries. - André Chailloux; Yann Barsamian (CoRR, 2021)

Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric. - André Chailloux; Thomas Debris-Alazard; Simona Etinski (IACR Cryptol. ePrint Arch., 2021)

Lattice sieving via quantum random walks. - André Chailloux; Johanna Loyer (IACR Cryptol. ePrint Arch., 2021)

Compressing integer lists with Contextual Arithmetic Trits. - Yann Barsamian; André Chailloux (CoRR, 2022)

Safely Doubling your Block Ciphers for a Post-Quantum World. - Ritam Bhaumik; André Chailloux; Paul Frixons; María Naya-Plasencia (IACR Cryptol. ePrint Arch., 2022)

Finding many Collisions via Reusable Quantum Walks. - Xavier Bonnetain; André Chailloux; André Schrottenloher; Yixin Shen 001 (IACR Cryptol. ePrint Arch., 2022)

Finding Many Collisions via Reusable Quantum Walks - Application to Lattice Sieving. - Xavier Bonnetain; André Chailloux; André Schrottenloher; Yixin Shen 001 (EUROCRYPT (5), 2023)

The Quantum Decoding Problem. - André Chailloux; Jean-Pierre Tillich (IACR Cryptol. ePrint Arch., 2023)

Classical and quantum 3 and 4-sieves to solve SVP with low memory. - Johanna Loyer; André Chailloux (IACR Cryptol. ePrint Arch., 2023)

Block Cipher Doubling for a Post-Quantum World. - Ritam Bhaumik; André Chailloux; Paul Frixons; Bart Mennink; María Naya-Plasencia (IACR Commun. Cryptol., 2024)

On the (in)security of optimized Stern-like signature schemes. - André Chailloux; Simona Etinski (Des. Codes Cryptogr., 2024)

Quantum Advantage from Soft Decoders. - André Chailloux; Jean-Pierre Tillich (STOC, 2025)

New Solutions to Delsarte's Dual Linear Programs. - André Chailloux; Thomas Debris-Alazard (IEEE Trans. Inf. Theory, 2025)