André Chailloux

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