André Chailloux

Publication Activity (10 Years)

Years Active: 2007-2023
Publications (10 Years): 35

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

TQC

PQCrypto

University of Paris-Sud, Orsay, France (PHD)

Education History

University of Paris-Sud, Orsay, France

PHD

Publications

Johanna Loyer, André Chailloux
Classical and quantum 3 and 4-sieves to solve SVP with low memory. IACR Cryptol. ePrint Arch. 2023 (2023)
Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen
Finding Many Collisions via Reusable Quantum Walks - Application to Lattice Sieving. EUROCRYPT (5) (2023)
André Chailloux, Johanna Loyer
Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory. PQCrypto (2023)
André Chailloux, Jean-Pierre Tillich
The Quantum Decoding Problem. IACR Cryptol. ePrint Arch. 2023 (2023)
Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen
Finding many Collisions via Reusable Quantum Walks. IACR Cryptol. ePrint Arch. 2022 (2022)
Yann Barsamian, André Chailloux
Compressing integer lists with Contextual Arithmetic Trits. CoRR (2022)
Ritam Bhaumik, André Chailloux, Paul Frixons, María Naya-Plasencia
Safely Doubling your Block Ciphers for a Post-Quantum World. IACR Cryptol. ePrint Arch. 2022 (2022)
André Chailloux, Johanna Loyer
Lattice sieving via quantum random walks. CoRR (2021)
André Chailloux, Thomas Debris-Alazard, Simona Etinski
Classical and Quantum Algorithms for Generic Syndrome Decoding Problems and Applications to the Lee Metric. PQCrypto (2021)
André Chailloux, Thomas Debris-Alazard, Simona Etinski
Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric. IACR Cryptol. ePrint Arch. 2021 (2021)
André Chailloux, Johanna Loyer
Lattice Sieving via Quantum Random Walks. ASIACRYPT (4) (2021)
André Chailloux, Johanna Loyer
Lattice sieving via quantum random walks. IACR Cryptol. ePrint Arch. 2021 (2021)
Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin
QCB: Efficient Quantum-Secure Authenticated Encryption. ASIACRYPT (1) (2021)
André Chailloux, Yann Barsamian
Relativistic zero-knowledge protocol for NP over the internet unconditionally secure against quantum adversaries. CoRR (2021)
André Chailloux, Thomas Debris-Alazard, Simona Etinski
Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric. CoRR (2021)
André Chailloux, Thomas Debris-Alazard
Tight and Optimal Reductions for Signatures based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. IACR Cryptol. ePrint Arch. 2020 (2020)
André Chailloux, Thomas Debris-Alazard
Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based Signatures. Public Key Cryptography (2) (2020)
Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin
QCB: Efficient Quantum-secure Authenticated Encryption. IACR Cryptol. ePrint Arch. 2020 (2020)
André Chailloux
Quantum security of the Fiat-Shamir transform of commit and open protocols. IACR Cryptol. ePrint Arch. 2019 (2019)
Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne
Ternary Syndrome Decoding with Large Weight. IACR Cryptol. ePrint Arch. 2019 (2019)
Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne
Ternary Syndrome Decoding with Large Weight. SAC (2019)
Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne
Ternary Syndrome Decoding with Large Weight. CoRR (2019)
André Chailloux
A Note on the Quantum Query Complexity of Permutation Symmetric Functions. ITCS (2019)
Rémi Bricout, André Chailloux
Bit Commitment Protocol. Cryptogr. 1 (2) (2017)
André Chailloux, María Naya-Plasencia, André Schrottenloher
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography. ASIACRYPT (2) (2017)
André Chailloux, Iordanis Kerenidis
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment. SIAM J. Comput. 46 (5) (2017)
André Chailloux, Thomas Debris-Alazard
A tight security reduction in the quantum random oracle model for code-based signature schemes. CoRR (2017)
André Chailloux, Anthony Leverrier
Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for \mathsf NP Secure Against Quantum Adversaries. EUROCRYPT (3) (2017)
André Chailloux, María Naya-Plasencia, André Schrottenloher
An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography. IACR Cryptol. ePrint Arch. 2017 (2017)
André Chailloux, Thomas Debris-Alazard
A tight security reduction in the quantum random oracle model for code-based signature schemes. IACR Cryptol. ePrint Arch. 2017 (2017)
Kaushik Chakraborty, André Chailloux, Anthony Leverrier
Robust Relativistic Bit Commitment. CoRR (2016)
André Chailloux, Iordanis Kerenidis, Bill Rosgen
Quantum commitments from complexity assumptions. Comput. Complex. 25 (1) (2016)
André Chailloux, Gus Gutoski, Jamie Sikora
Optimal bounds for semi-honest quantum oblivious transfer. Chic. J. Theor. Comput. Sci. 2016 (2016)
Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. SIAM J. Comput. 45 (3) (2016)
Kaushik Chakraborty, André Chailloux, Anthony Leverrier
Arbitrarily long relativistic bit commitment. CoRR (2015)
André Chailloux, Giannicola Scarpa
Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost. ICALP (1) (2014)
André Chailloux, Laura Mancinska, Giannicola Scarpa, Simone Severini
Graph-theoretical Bounds on the Entangled Value of Non-local Games. TQC (2014)
André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. TQC (2014)
André Chailloux, Iordanis Kerenidis, Jamie Sikora
Lower bounds for quantum oblivious transfer. Quantum Inf. Comput. 13 (1-2) (2013)
André Chailloux, Gus Gutoski, Jamie Sikora
Optimal bounds for quantum weak oblivious transfer. CoRR (2013)
André Chailloux, Or Sattath
The Complexity of the Separable Hamiltonian Problem. Computational Complexity Conference (2012)
Nati Aharon, André Chailloux, Iordanis Kerenidis, Serge Massar, Stefano Pironio, Jonathan Silman
Weak Coin Flipping in a Device-Independent Setting. TQC (2011)
André Chailloux, Iordanis Kerenidis, Bill Rosgen
Quantum Commitments from Complexity Assumptions. ICALP (1) (2011)
André Chailloux, Or Sattath
The Complexity of the Separable Hamiltonian Problem. CoRR (2011)
André Chailloux, Iordanis Kerenidis
Optimal Bounds for Quantum Bit Commitment. FOCS (2011)
André Chailloux, Iordanis Kerenidis, Jamie Sikora
Lower bounds for Quantum Oblivious Transfer. FSTTCS (2010)
André Chailloux, Iordanis Kerenidis
Optimal Quantum Strong Coin Flipping. FOCS (2009)
André Chailloux, Iordanis Kerenidis
Increasing the power of the verifier in Quantum Zero Knowledge. FSTTCS (2008)
André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC (2008)
André Chailloux, Iordanis Kerenidis
The role of help in Classical and Quantum Zero-Knowledge. IACR Cryptol. ePrint Arch. 2007 (2007)
André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. IACR Cryptol. ePrint Arch. 2007 (2007)

André Chailloux.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

André Chailloux