Geoffroy Couteau

Orcid: 0000-0002-6645-0106

According to our database1, Geoffroy Couteau authored at least 78 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
SoK: On Shallow Weak PRFs A Common Symmetric Building Block for MPC Protocols.
IACR Trans. Symmetric Cryptol., 2025

Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications.
IACR Cryptol. ePrint Arch., 2025

Multiparty Homomorphic Secret Sharing and More from LPN and MQ.
IACR Cryptol. ePrint Arch., 2025

휔(1/휆)-Rate Boolean Garbling Scheme from Generic Groups.
IACR Cryptol. ePrint Arch., 2025

Fast Pseudorandom Correlation Functions from Sparse LPN.
IACR Cryptol. ePrint Arch., 2025

Stateless 2PC Signatures for Internet-Scale Authentication and Authorization.
IACR Cryptol. ePrint Arch., 2025

Enhanced Trapdoor Hashing from DDH and DCR.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Breaking the 1/λ-Rate Barrier for Arithmetic Garbling.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Multi-Key Homomorphic Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

ømega (1/λ )-Rate Boolean Garbling Scheme from Generic Groups.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Structured-Seed Local Pseudorandom Generators and Their Applications.
Proceedings of the Approximation, 2025

2024
On Threshold Signatures from MPC-in-the-Head.
IACR Cryptol. ePrint Arch., 2024

Structured-Seed Local Pseudorandom Generators and their Applications.
IACR Cryptol. ePrint Arch., 2024

Short Signatures from Regular Syndrome Decoding, Revisited.
IACR Cryptol. ePrint Arch., 2024

Downlink (T)FHE ciphertexts compression.
IACR Cryptol. ePrint Arch., 2024

FOLEAGE: 픽<sub>4</sub>OLE-Based Multi-Party Computation for Boolean Circuits.
IACR Cryptol. ePrint Arch., 2024

Two-Round 2PC ECDSA at the Cost of 1 OLE.
IACR Cryptol. ePrint Arch., 2024

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

On Bounded Storage Key Agreement and One-Way Functions.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

Fast Public-Key Silent OT and More from Constrained Naor-Reingold.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

10-Party Sublinear Secure Computation from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Fine-Grained Non-interactive Key Exchange, Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

QuietOT: Lightweight Oblivious Transfer with a Public-Key Setup.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

Faster Signatures from MPC-in-the-Head.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

FOLEAGE: $\mathbb {F}_{\scriptstyle 4}$OLE-Based Multi-party Computation for Boolean Circuits.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
An Efficient ZK Compiler from SIMD Circuits to General Circuits.
IACR Cryptol. ePrint Arch., 2023

New Random Oracle Instantiations from Extremely Lossy Functions.
IACR Cryptol. ePrint Arch., 2023

Pseudorandom Correlation Functions from Variable-Density LPN, Revisited.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Improved Private Set Intersection for Sets with Small Entries.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Constrained Pseudorandom Functions from Homomorphic Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Short Signatures from Regular Syndrome Decoding in the Head.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Sublinear-Communication Secure Multiparty Computation Does Not Require FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Oblivious Transfer with Constant Computational Overhead.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Fine-Grained Non-interactive Key-Exchange: Constructions and Lower Bounds.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

A Note on Non-interactive Zero-Knowledge from CDH.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Private Set Intersection from Pseudorandom Correlation Generators.
IACR Cryptol. ePrint Arch., 2022

Sublinear Secure Computation from New Assumptions.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Anonymous Whistleblowing over Authenticated Channels.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On Building Fine-Grained One-Way Functions from Strong Average-Case Hardness.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Sharp: Short Relaxed Range Proofs.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Non-interactive Secure Computation of Inner-Product from LPN and LWE.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

Random Sources in Private Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Statistical ZAPs from Group-Based Assumptions.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

On Derandomizing Yao's Weak-to-Strong OWF Construction.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Black-Box Uselessness: Composing Separations in Cryptography.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPN.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Efficient NIZKs for Algebraic Sets.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer.
Proceedings of the Information Security and Privacy - 26th Australasian Conference, 2021

2020
Towards Fine-Grained One-Way Functions from Strong Average-Case Hardness.
IACR Cryptol. ePrint Arch., 2020

On Pseudorandom Encodings.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Correlated Pseudorandom Functions from Variable-Density LPN.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Non-interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
Non-interactive Keyed-Verification Anonymous Credentials.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Designated-Verifier Pseudorandom Generators, and Their Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Efficient Designated-Verifier Non-interactive Zero-Knowledge Proofs of Knowledge.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Compressing Vector OLE.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

On the Concrete Security of Goldreich's Pseudorandom Generator.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

New Protocols for Secure Equality Test and Comparison.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
Zero-Knowledge Proofs for Secure Computation. (Preuves à divulgation nulle pour le calcul sécurisé).
PhD thesis, 2017

Removing the Strong RSA Assumption from Arguments over the Integers.
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

Homomorphic Secret Sharing: Optimizations and Applications.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Revisiting Covert Multiparty Computation.
IACR Cryptol. ePrint Arch., 2016

Efficient Secure Comparison Protocols.
IACR Cryptol. ePrint Arch., 2016

Encryption Switching Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Secure Distributed Computation on Private Inputs.
Proceedings of the Foundations and Practice of Security - 8th International Symposium, 2015

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015


  Loading...