Geoffroy Couteau
CNRS research scientist in the Algorithms and Complexity team of IRIF, Université de Paris. My research interests include zero-knowledge proofs, multiparty computation, and theoretical foundations of cryptography. For more information about my work, or opportunities for internships / PhDs, see my website: http://geoffroycouteau.fr/.
0
answers
1
question
~66
people reached
-
Paris, France
-
Member for 5 years, 1 month
-
13 profile views
-
Last seen yesterday
Communities (10)
Top network posts
- 74 Does Schnorr's 2021 factoring method show that the RSA cryptosystem is not secure?
- 37 Are cryptographic hash functions quantum secure?
- 35 Is a hash a zero-knowledge proof?
- 30 Boolean Circuits vs Arithmetic Circuits
- 17 What is a (smooth) projective hash function?
- 16 Is it hard to compute $g^{ab}$ when given $(g, g^a, g^b, \frac{a}{b})$?
- 14 Is RSA provably secure in the sense of Douglas Stinson's ``provable security''?
- View more network posts →
Top tags (2)
Score
0
Posts
1
Score
0
Posts
1
Badges (9)
Gold
—
Silver
5