Publications
Here are links to my PhD thesis, my HDR manuscript, my book An Introduction to Silent Secure Computation, and my recent survey on compressing correlated randomness (SIGACT News Complexity Theory Column).
| Conference/Journal | Article | Links |
|---|---|---|
| ASIACRYPT 2026 | Firebolt: Fast, Lightweight, Malicious Non-Interactive Vector-OLE Michael Adjedj, Geoffroy Couteau, and Nikolaos Makriyannis |
ePrint, Springer |
| ASIACRYPT 2026 | A Note on the Security of ECDSA with Presignatures or Biased Nonces Geoffroy Couteau and Nikolaos Makriyannis |
ePrint, Springer |
| TCC 2026 | From OT to OLE with Almost-Linear Communication Geoffroy Couteau and Naman Kumar |
ePrint, Springer |
| TCC 2026 | On Compressing Linearly Shared Correlations Geoffroy Couteau, Alexander Koch, Nikolas Melissaris, Peter Scholl, Sacha Servan-Schreiber, and Xiaxi Ye |
ePrint, Springer |
| CiC 2026 | On Threshold Signatures from MPC-in-the-Head Eliana Carozza and Geoffroy Couteau |
ePrint, CiC |
| CRYPTO 2026 | Succinct Two-Round Two-Party Signing from PCFs Lennart Braun, Geoffroy Couteau, Kelsey Melissaris, Mahshid Riahinia, and Elahe Sadeghi |
ePrint, Springer |
| CRYPTO 2026 | Post-Quantum Public-Key Pseudorandom Correlation Functions for OT Kaartik Bhushan, Shweta Agrawal, Geoffroy Couteau, and Mahshid Riahinia |
ePrint, Springer |
| PKC 2026 | Two-Round 2PC ECDSA at the Cost of 1 OLE Michael Adjedj, Constantin Blokh, Geoffroy Couteau, Arik Galansky, Antoine Joux, and Nikolaos Makriyannis |
ePrint, ACM |
| EUROCRYPT 2026 | Client-Server Homomorphic Secret Sharing in the CRS Model Damiano Abram, Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, Lawrence Roy, Sacha Servan-Schreiber |
ePrint, Springer |
| AsiaCCS 2026 | Stateless 2PC Signatures for Internet-Scale Authentication and Authorization Michael Adjedj, Geoffroy Couteau, Arik Galansky, Nikolaos Makriyannis, and Oren Yomtov |
ePrint, ACM |
| S$\&$P 2026 | Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications Kaiwen He, Sacha Servan-Schreiber, Geoffroy Couteau, and Srinivas Devadas |
ePrint, IEEE |
| TCC 2025 | Pseudorandom Correlation Functions for Garbled Circuits Geoffroy Couteau, Srinivas Devadas, Alexander Koch, and Sacha Servan-Schreiber |
ePrint, Springer |
| TCC 2025 | Multiparty Homomorphic Secret Sharing and More from LPN and MQ Geoffroy Couteau, Naman Kumar, and Xiaxi Ye |
ePrint, Springer |
| ASIACRYPT 2025 | Fast Pseudorandom Correlation Functions from Sparse LPN Lennart Braun, Geoffroy Couteau, Kelsey Melissaris, Mahshid Riahinia, and Elahe Sadeghi |
ePrint, Springer |
| ToSC 2025 | SoK: On Shallow Weak PRFs Christina Boura, Geoffroy Couteau, Léo Perrin, and Yann Rotella |
ePrint, ToSC |
| Cryptography and Communications 2025 | Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs Chris Brzuska, Geoffroy Couteau, Christoph Egger, and Pierre Meyer |
ePrint, Springer |
| RANDOM 2025 | Structured-Seed Local Pseudorandom Generators and their Applications Benny Applebaum, Dung Bui, Geoffroy Couteau and Nikolas Melissaris |
ePrint, LIPIcs |
| SAC 2025 | Downlink (T)FHE ciphertexts compression Antonina Bondarchuk, Olive Chakraborty, Geoffroy Couteau, and Renaud Sirdey |
ePrint, Springer |
| CRYPTO 2025 | 𝜔(1/𝜆)-Rate Boolean Garbling Scheme from Generic Groups Geoffroy Couteau, Carmit Hazay, Aditya Hegde, and Naman Kumar |
ePrint, Springer |
| EUROCRYPT 2025 | Multi-key Homomorphic Secret Sharing Geoffroy Couteau, Lalita Devadas, Aditya Hegde, Abhishek Jain, and Sacha Servan-Schreiber |
ePrint, Springer |
| EUROCRYPT 2025 | Breaking the 1/λ-Rate Barrier for Arithmetic Garbling Geoffroy Couteau, Carmit Hazay, Aditya Hegde, and Naman Kumar |
ePrint, Springer |
| EUROCRYPT 2025 | Enhanced Trapdoor Hashing from DDH and DCR Geoffroy Couteau, Aditya Hegde, and Sihang Pu |
ePrint, Springer |
| JoC 2025 | An Efficient ZK Compiler from SIMD Circuits to General Circuits Dung Bui, Haotian Chu, Geoffroy Couteau, Xiao Wang, Chenkai Weng, Kang Yang, and Yu Yu |
ePrint, Springer |
| JoC 2025 | On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness Chris Brzuska and Geoffroy Couteau |
ePrint, Springer |
| TCC 2024 | On Bounded Storage Key Agreement and One-Way Functions Chris Brzuska, Christoph Egger, Geoffroy Couteau, and Willy Quach |
HAL, Springer |
| TCC 2024 | A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction Pierre Charbit, Geoffroy Couteau, Pierre Meyer, and Reza Naserasr |
ePrint, Springer |
| ASIACRYPT 2024 | FOLEAGE: F4-OLE-Based Multi-Party Computation for Boolean Circuits Maxime Bombar, Dung Bui, Geoffroy Couteau, Alain Couvreur, Clément Ducros, and Sacha Servan-Schreiber |
ePrint, Springer |
| ASIACRYPT 2024 | QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup Geoffroy Couteau, Lalita Devadas, Srinivasan Devadas, Alexander Koch, and Sacha Servan-Schreiber |
ePrint, Springer |
| ASIACRYPT 2024 | Faster Signatures from MPC-in-the-Head Dung Bui, Eliana Carozza, Geoffroy Couteau, Dahmun Goudarzi, and Antoine Joux |
ePrint, Springer |
| SCN 2024 | Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs Chris Brzuska, Geoffroy Couteau, Christoph Egger, and Pierre Meyer Paper invited to Cryptography and Communications |
ePrint, Springer |
| CRYPTO 2024 | Fine-Grained Non-Interactive Key Exchange, Revisited Balthazar Bauer, Geoffroy Couteau, and Elahe Sadeghi |
ePrint, Springer |
| CRYPTO 2024 | 10-Party Sublinear Secure Computation from Standard Assumptions Geoffroy Couteau and Naman Kumar |
ePrint, Springer |
| EUROCRYPT 2024 | Fast Public-Key Silent OT and More from Constrained Naor-Reingold Dung Bui, Geoffroy Couteau, Pierre Meyer, Alain Passelègue, and Mahshid Riahinia |
ePrint, Springer |
| CRYPTO 2023 | A Note on Non-Interactive Zero-Knowledge from CDH Geoffroy Couteau, Abhishek Jain, Zhengzhong Jin, and Willy Quach |
ePrint, Springer |
| CRYPTO 2023 | Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding Maxime Bombar, Geoffroy Couteau, Alain Couvreur, and Clément Ducros |
ePrint, Springer |
| EUROCRYPT 2023 | Constrained Pseudorandom Functions from Homomorphic Secret Sharing Geoffroy Couteau, Pierre Meyer, Alain Passelègue, and Mahshid Riahinia |
ePrint, Springer |
| EUROCRYPT 2023 | Sublinear-Communication Secure Multiparty Computation does not require FHE Elette Boyle, Geoffroy Couteau, and Pierre Meyer |
ePrint, Springer |
| EUROCRYPT 2023 | Short Signatures from Regular Syndrome Decoding in the Head Eliana Carozza, Geoffroy Couteau, and Antoine Joux |
ePrint, Springer |
| EUROCRYPT 2023 | Fine-Grained Non-Interactive Key-Exchange: Constructions and Lower Bounds Abtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, and Elahe Sadeghi |
ePrint, Springer |
| EUROCRYPT 2023 | Oblivious Transfer with Constant Computational Overhead Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl |
ePrint, Springer |
| PKC 2023 | Improved Private Set Intersection for Sets with Small Entries Geoffroy Couteau and Dung Bui |
ePrint, Springer |
| PKC 2023 | Pseudorandom Correlation Functions from Variable-Density LPN, Revisited Geoffroy Couteau and Clément Ducros |
ePrint, Springer |
| TCC 2022 | Sublinear Secure Computation from New Assumptions Elette Boyle, Geoffroy Couteau, and Pierre Meyer |
ePrint, Springer |
| TCC 2022 | Anonymous Whistleblowing over Authenticated Channels Thomas Agrikola, Geoffroy Couteau, and Sven Maier |
ePrint, Springer |
| ASIACRYPT 2022 | Non-Interactive Secure Computation of Inner-Product from LPN and LWE Geoffroy Couteau and Maryam Zarezadeh |
ePrint, Springer |
| ASIACRYPT 2022 | Random Sources in Private Computation Geoffroy Couteau and Adi Rosén |
ePrint, Springer |
| CCS 2022 | Sharp: Short Relaxed Range Proofs Geoffroy Couteau, Dahmun Goudarzi, Michael Klooß, and Michael Reichle |
ePrint, ACM |
| CRYPTO 2022 | Correlated Pseudorandomness from Expand-Accumulate Codes Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl |
ePrint, Springer |
| EUROCRYPT 2022 | On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness Chris Brzuska and Geoffroy Couteau Paper invited to the Journal of Cryptology |
ePrint, Springer |
| TCC 2021 | Statistical ZAPs from Group-Based Assumptions Geoffroy Couteau, Shuichi Katsumata, Elahe Sadeghi, and Bogdan Ursu |
ePrint, Springer |
| TCC 2021 | On Derandomizing Yao’s Weak-to-Strong OWF Construction Chris Brzuska, Geoffroy Couteau, Pihla Karanko, and Felix Rohrbach |
ePrint, Springer |
| ASIACRYPT 2021 | Efficient NIZKs for Algebraic Sets Geoffroy Couteau, Helger Lipmaa, Roberto Parisella, and Arne Tobias Ødegaard |
ePrint, Springer |
| CRYPTO 2021 | Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl |
ePrint, Springer |
| CRYPTO 2021 | Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes Geoffroy Couteau, Srinivasan Raghuraman, and Peter Rindal |
ePrint, Springer |
| ACISP 2021 | Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer Geoffroy Couteau, Bill Roscoe, and Peter Ryan |
ePrint, Springer |
| EUROCRYPT 2021 | Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN Geoffroy Couteau and Pierre Meyer |
ePrint, Springer |
| EUROCRYPT 2021 | Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments Geoffroy Couteau, Michael Klooß, Huang Lin, and Michael Reichle |
ePrint, Springer |
| ITCS 2021 | Black-Box Uselessness: Composing Separations in Cryptography Geoffroy Couteau, Pooya Farshim, and Mohammad Mahmoody |
ePrint, LIPIcs |
| TCC 2020 | On Pseudorandom Encodings Thomas Agrikola, Geoffroy Couteau, Yuval Ishai, Stanislaw Jarecki, and Amit Sahai |
ePrint, Springer |
| FOCS 2020 | Pseudorandom Correlation Functions from Variable-Density LPN Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl |
ePrint, IEEE |
| CRYPTO 2020 | Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages Geoffroy Couteau and Dominik Hartmann |
ePrint, Springer |
| CRYPTO 2020 | Efficient Pseudorandom Correlation Generators from Ring-LPN Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl |
ePrint, Springer |
| EUROCRYPT 2020 | Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions Geoffroy Couteau, Shuichi Katsumata, and Bogdan Ursu |
ePrint, Springer |
| PKC 2020 | The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO Thomas Agrikola, Geoffroy Couteau, and Dennis Hofheinz |
ePrint, Springer |
| CRYPTO 2019 | Efficient Pseudorandom Correlation Generators: Silent OT Extension and More Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl |
ePrint, Springer |
| EUROCRYPT 2019 | Designated-Verifier Pseudorandom Generators, and their Applications Geoffroy Couteau and Dennis Hofheinz |
ePrint, Springer |
| EUROCRYPT 2019 | A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model Geoffroy Couteau |
ePrint, Springer |
| CCS 2019 | Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl |
ePrint, ACM |
| PKC 2019 | Non-Interactive Keyed-Verification Anonymous Credentials Geoffroy Couteau and Michael Reichle |
ePrint, Springer |
| EUROCRYPT 2018 | Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge Pyrros Chaidos and Geoffroy Couteau |
ePrint, Springer |
| CCS 2018 | Compressing Vector OLE Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai |
ePrint, ACM |
| ASIACRYPT 2018 | On the Concrete Security of Goldreich’s Pseudorandom Generator Geoffroy Couteau, Aurélien Dupin, Pierrick Méaux, Mélissa Rossi, Yann Rotella |
ePrint, Springer |
| ACNS 2018 | New Protocols for Secure Equality Test and Comparison Geoffroy Couteau |
ePrint, Springer |
| EUROCRYPT 2017 | Removing the Strong RSA Assumption from Arguments over the Integers Geoffroy Couteau, Thomas Peters, and David Pointcheval |
ePrint, Springer |
| CCS 2017 | Homomorphic Secret Sharing: Optimizations and Applications Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, and Michele Orrù |
ePrint, ACM |
| CRYPTO 2016 | Encryption Switching Protocols Geoffroy Couteau, Thomas Peters, and David Pointcheval |
ePrint, Springer |
| CRYPTO 2015 | Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, and Hoeteck Wee |
ePrint, Springer |
| FPS 2015 | Secure Distributed Computation on Private Inputs Geoffroy Couteau, Thomas Peters, and David Pointcheval |
ePrint, Springer |