Antoine Joux
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Antoine Joux has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Janik Huth
CISPA - Helmholtz Center for Information Security
3 shared publications - Dipayan Das
Florida Atlantic University
2 shared publications - Dung Hoang Duong
University of Wollongong
2 shared publications - Eliana Carozza
IRIF, Université Paris Cité
2 shared publications - Gang Tang
University of Technology Sydney
2 shared publications - Geoffroy Couteau
CNRS
2 shared publications
Latest Publications
- 9 August 2026
- Published by Springer Nature
- p. 282-313
Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
- 9 August 2026
- Published by Springer Nature
- p. 282-313
Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
- Open Access
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Fherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH
The major Fully Homomorphic Encryption (FHE) schemes guarantee the privacy of the encrypted message only in the honest-but-curious setting, when the server follows the protocol without deviating. However, various attacks in the literature show that an actively malicious server can recover sensitive information by executing incorrect functions, tampering with ciphertexts, or observing the client's reaction during decryption. Existing integrity solutions for FHE schemes either fail to guarantee circuit privacy, exposing the server's computations to the client, or introduce significant computational overhead on the prover by requiring proofs of FHE operations on ciphertexts. In this work, we present Fherret, a novel scheme leveraging the MPC-in-the-Head (MPCitH) paradigm to provide a proof of correct-and-honest homomorphic evaluation while preserving circuit privacy. This proof guarantees that the client can safely decrypt the ciphertext obtained from the server without being susceptible to reaction-based attacks, such as verification and decryption oracle attacks. Additionally, this proof guarantees that the server's evaluation maintains correctness, thereby protecting the client from IND-CPA-D-style attacks. Our solution achieves a prover overhead of approximately 110-170 homomorphic evaluations of random functions from the function space F, while retaining a competitive verifier overhead of approximately 58-93 homomorphic evaluations and a communication size proportional to approximately 40 times the size of a function from F. Furthermore, Fherret is inherently parallelizable because its MPCitH views can be computed independently, achieving a parallel computation overhead similar to a homomorphic evaluation of a single random function from F for both the prover and the verifier.
- 3 August 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (2)
Open AccessFherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH
The major Fully Homomorphic Encryption (FHE) schemes guarantee the privacy of the encrypted message only in the honest-but-curious setting, when the server follows the protocol without deviating. However, various attacks in the literature show that an actively malicious server can recover sensitive information by executing incorrect functions, tampering with ciphertexts, or observing the client's reaction during decryption. Existing integrity solutions for FHE schemes either fail to guarantee circuit privacy, exposing the server's computations to the client, or introduce significant computational overhead on the prover by requiring proofs of FHE operations on ciphertexts. In this work, we present Fherret, a novel scheme leveraging the MPC-in-the-Head (MPCitH) paradigm to provide a proof of correct-and-honest homomorphic evaluation while preserving circuit privacy. This proof guarantees that the client can safely decrypt the ciphertext obtained from the server without being susceptible to reaction-based attacks, such as verification and decryption oracle attacks. Additionally, this proof guarantees that the server's evaluation maintains correctness, thereby protecting the client from IND-CPA-D-style attacks. Our solution achieves a prover overhead of approximately 110-170 homomorphic evaluations of random functions from the function space F, while retaining a competitive verifier overhead of approximately 58-93 homomorphic evaluations and a communication size proportional to approximately 40 times the size of a function from F. Furthermore, Fherret is inherently parallelizable because its MPCitH views can be computed independently, achieving a parallel computation overhead similar to a homomorphic evaluation of a single random function from F for both the prover and the verifier.
- 8 December 2025
- Published by Springer Nature
- p. 3-34
VOLE-in-the-Head Signatures from Subfield Bilinear Collisions
- 8 December 2025
- Published by Springer Nature
- p. 3-34
VOLE-in-the-Head Signatures from Subfield Bilinear Collisions
- 3 December 2025
- Published by Springer Nature
- p. 323-352
Dimensional e$\textsf{ROS}$ion: Improving the $\textsf{ROS}$ Attack with Decomposition in Higher Bases- 3 December 2025
- Published by Springer Nature
- p. 323-352
Dimensional e$\textsf{ROS}$ion: Improving the $\textsf{ROS}$ Attack with Decomposition in Higher Bases- Open Access
Indefiniteness makes lattice reduction easier
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive definite scalar product. However, it seems quite nature to ask about the indefinite case, where the scalar product is replaced by an arbitrary quadratic form, possibily indefinite. This question was considered independently in two lines of work. One by G{á}bor Ivanyos and {Á}gnes Sz{á}nt{ó} and one by Denis Simon. Both lead to an algorithm that generalizes LLL and whose performance is very similar to LLL, i.e. a polynomial-time algorithm that approximates the shortest vector within an approximation factor exponential in the dimension. Denis Simon achieves an approximation factor close to that of LLL under the assumption that no isotropic vectors arise during reduction. G{á}bor Ivanyos and {Á}gnes Sz{á}nt{ó} show that it is possible to avoid isotropic vectors altogether, at the cost of a somewhat worse approximation factor. In this paper, we revisit the reduction of indefinite lattices and conclude that it can lead to much better reduced representations that previously thought. We also conclude that the approximation factor depends on the signature of the indefinite lattice rather than on its dimension.
Open AccessIndefiniteness makes lattice reduction easier
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive definite scalar product. However, it seems quite nature to ask about the indefinite case, where the scalar product is replaced by an arbitrary quadratic form, possibily indefinite. This question was considered independently in two lines of work. One by G{á}bor Ivanyos and {Á}gnes Sz{á}nt{ó} and one by Denis Simon. Both lead to an algorithm that generalizes LLL and whose performance is very similar to LLL, i.e. a polynomial-time algorithm that approximates the shortest vector within an approximation factor exponential in the dimension. Denis Simon achieves an approximation factor close to that of LLL under the assumption that no isotropic vectors arise during reduction. G{á}bor Ivanyos and {Á}gnes Sz{á}nt{ó} show that it is possible to avoid isotropic vectors altogether, at the cost of a somewhat worse approximation factor. In this paper, we revisit the reduction of indefinite lattices and conclude that it can lead to much better reduced representations that previously thought. We also conclude that the approximation factor depends on the signature of the indefinite lattice rather than on its dimension.
- Open Access
Indefiniteness makes lattice reduction easier
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive definite scalar product. However, it seems quite nature to ask about the indefinite case, where the scalar product is replaced by an arbitrary quadratic form, possibily indefinite. This question was considered independently in two lines of work. One by Gábor Ivanyos and Ágnes Szántó and one by Denis Simon. Both lead to an algorithm that generalizes LLL and whose performance is very similar to LLL, i.e. a polynomial-time algorithm that approximates the shortest vector within an approximation factor exponential in the dimension. Denis Simon achieves an approximation factor close to that of LLL under the assumption that no isotropic vectors arise during reduction. Gábor Ivanyos and Ágnes Szántó show that it is possible to avoid isotropic vectors altogether, at the cost of a somewhat worse approximation factor. In this paper, we revisit the reduction of indefinite lattices and conclude that it can lead to much better reduced representations that previously thought. We also conclude that the approximation factor depends on the signature of the indefinite lattice rather than on its dimension.
Open AccessIndefiniteness makes lattice reduction easier
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive definite scalar product. However, it seems quite nature to ask about the indefinite case, where the scalar product is replaced by an arbitrary quadratic form, possibily indefinite. This question was considered independently in two lines of work. One by Gábor Ivanyos and Ágnes Szántó and one by Denis Simon. Both lead to an algorithm that generalizes LLL and whose performance is very similar to LLL, i.e. a polynomial-time algorithm that approximates the shortest vector within an approximation factor exponential in the dimension. Denis Simon achieves an approximation factor close to that of LLL under the assumption that no isotropic vectors arise during reduction. Gábor Ivanyos and Ágnes Szántó show that it is possible to avoid isotropic vectors altogether, at the cost of a somewhat worse approximation factor. In this paper, we revisit the reduction of indefinite lattices and conclude that it can lead to much better reduced representations that previously thought. We also conclude that the approximation factor depends on the signature of the indefinite lattice rather than on its dimension.
- 30 November 2024
- Published by Springer Nature
- p. 431-459
Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials
- 30 November 2024
- Published by Springer Nature
- p. 431-459
Space-Lock Puzzles and Verifiable Space-Hard Functions from Root-Finding in Sparse Polynomials
- 16 August 2024
- Published by Springer Nature
- p. 39-70
MPC in the Head Using the Subfield Bilinear Collision Problem
- 16 August 2024
- Published by Springer Nature
- p. 39-70
MPC in the Head Using the Subfield Bilinear Collision Problem