André Chailloux

According to our database, André Chailloux authored at least 42 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Compressing Integer Lists with Contextual Arithmetic Trits.

Yann Barsamian, André Chailloux

ACM Trans. Inf. Syst., November, 2025

On the Quantum Equivalence between S|LWE⟩ and ISIS.

André Chailloux, Paul Hermouet

IACR Cryptol. ePrint Arch., 2025

Quantum Advantage from Soft Decoders.

André Chailloux, Jean-Pierre Tillich

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

On the (in)security of optimized Stern-like signature schemes.

André Chailloux, Simona Etinski

Des. Codes Cryptogr., March, 2024

New Solutions to Delsarte's Dual Linear Programs.

André Chailloux, Thomas Debris-Alazard

IACR Cryptol. ePrint Arch., 2024

Block Cipher Doubling for a Post-Quantum World.

Ritam Bhaumik, André Chailloux, Paul Frixons, Bart Mennink, María Naya-Plasencia

IACR Commun. Cryptol., 2024

The Quantum Decoding Problem.

André Chailloux, Jean-Pierre Tillich

Proceedings of the 19th Conference on the Theory of Quantum Computation, 2024

2023

Classical and Quantum 3 and 4-Sieves to Solve SVP with Low Memory.

André Chailloux, Johanna Loyer

Proceedings of the Post-Quantum Cryptography - 14th International Workshop, 2023

Finding Many Collisions via Reusable Quantum Walks - Application to Lattice Sieving.

Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen

Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022

Finding many Collisions via Reusable Quantum Walks.

Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen

IACR Cryptol. ePrint Arch., 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

2021

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

Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Lattice Sieving via Quantum Random Walks.

André Chailloux, Johanna Loyer

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

QCB: Efficient Quantum-Secure Authenticated Encryption.

Ritam Bhaumik, Xavier Bonnetain, André Chailloux, Gaëtan Leurent, María Naya-Plasencia, André Schrottenloher, Yannick Seurin

Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

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

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

2019

Quantum security of the Fiat-Shamir transform of commit and open protocols.

André Chailloux

IACR Cryptol. ePrint Arch., 2019

Ternary Syndrome Decoding with Large Weight.

Rémi Bricout, André Chailloux, Thomas Debris-Alazard, Matthieu Lequesne

Proceedings of the Selected Areas in Cryptography - SAC 2019, 2019

A Note on the Quantum Query Complexity of Permutation Symmetric Functions.

André Chailloux

Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

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 tight security reduction in the quantum random oracle model for code-based signature schemes.

André Chailloux, Thomas Debris-Alazard

IACR Cryptol. ePrint Arch., 2017

Recursive Cheating Strategies for the Relativistic F<i>_Q</i> Bit Commitment Protocol.

Rémi Bricout, André Chailloux

Cryptogr., 2017

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

André Chailloux, Anthony Leverrier

Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography.

André Chailloux, María Naya-Plasencia, André Schrottenloher

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

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

Robust Relativistic Bit Commitment.

Kaushik Chakraborty, André Chailloux, Anthony Leverrier

CoRR, 2016

Optimal bounds for semi-honest quantum oblivious transfer.

André Chailloux, Gus Gutoski, Jamie Sikora

Chic. J. Theor. Comput. Sci., 2016

2015

Arbitrarily long relativistic bit commitment.

Kaushik Chakraborty, André Chailloux, Anthony Leverrier

CoRR, 2015

2014

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

André Chailloux, Laura Mancinska, Giannicola Scarpa, Simone Severini

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Optimal Bounds for Parity-Oblivious Random Access Codes with Applications.

André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

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

André Chailloux, Giannicola Scarpa

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Optimal bounds for quantum weak oblivious transfer.

André Chailloux, Gus Gutoski, Jamie Sikora

CoRR, 2013

2012

The Complexity of the Separable Hamiltonian Problem.

André Chailloux, Or Sattath

Proceedings of the 27th Conference on Computational Complexity, 2012

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

PhD thesis, 2011

Weak Coin Flipping in a Device-Independent Setting.

Nati Aharon, André Chailloux, Iordanis Kerenidis, Serge Massar, Stefano Pironio, Jonathan Silman

Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

Quantum Commitments from Complexity Assumptions.

André Chailloux, Iordanis Kerenidis, Bill Rosgen

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Optimal Bounds for Quantum Bit Commitment.

André Chailloux, Iordanis Kerenidis

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Lower bounds for Quantum Oblivious Transfer.

André Chailloux, Iordanis Kerenidis, Jamie Sikora

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Optimal Quantum Strong Coin Flipping.

André Chailloux, Iordanis Kerenidis

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.

André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan

Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Increasing the power of the verifier in Quantum Zero Knowledge.

André Chailloux, Iordanis Kerenidis

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

The role of help in Classical and Quantum Zero-Knowledge.

André Chailloux, Iordanis Kerenidis

IACR Cryptol. ePrint Arch., 2007