Geoffroy Couteau

According to our database1, Geoffroy Couteau authored at least 31 papers between 2015 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Breaking the Circuit-Size Barrier for Secure Computation under Quasi-Polynomial LPN.
IACR Cryptol. ePrint Arch., 2021

Statistical ZAPs from Group-Based Assumptions.
IACR Cryptol. ePrint Arch., 2021

Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments.
IACR Cryptol. ePrint Arch., 2021

Black-Box Uselessness: Composing Separations in Cryptography.
IACR Cryptol. ePrint Arch., 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

2020
Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions.
IACR Cryptol. ePrint Arch., 2020

Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages.
IACR Cryptol. ePrint Arch., 2020

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

Correlated Pseudorandom Functions from Variable-Density LPN.
IACR Cryptol. ePrint Arch., 2020

On Pseudorandom Encodings.
IACR Cryptol. ePrint Arch., 2020

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

2019
Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2019

Non-Interactive Keyed-Verification Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2019

Designated-verifier pseudorandom generators, and their applications.
IACR Cryptol. ePrint Arch., 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
IACR Cryptol. ePrint Arch., 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2019

Compressing Vector OLE.
IACR Cryptol. ePrint Arch., 2019

2018
On the Concrete Security of Goldreich's Pseudorandom Generator.
IACR Cryptol. ePrint Arch., 2018

A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model.
IACR Cryptol. ePrint Arch., 2018

Homomorphic Secret Sharing: Optimizations and Applications.
IACR Cryptol. ePrint Arch., 2018

The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO.
IACR Cryptol. ePrint Arch., 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

Efficient Designated-Verifier Non-Interactive Zero-Knowledge Proofs of Knowledge.
IACR Cryptol. ePrint Arch., 2017

2016
Removing the Strong RSA Assumption from Arguments over the Integers.
IACR Cryptol. ePrint Arch., 2016

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

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

2015
Secure Distributed Computation on Private Inputs.
IACR Cryptol. ePrint Arch., 2015

Encryption Switching Protocols.
IACR Cryptol. ePrint Arch., 2015

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting.
IACR Cryptol. ePrint Arch., 2015


  Loading...