Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs
Geoffroy Couteau's user avatar
Geoffroy Couteau's user avatar
Geoffroy Couteau's user avatar
Geoffroy Couteau
  • Member for 8 years, 3 months
  • Last seen this week
5 votes
Accepted

What prevents ZKP proofs to be misused by others?

2 votes

Comparison in Multi-party Computation without bit decomposition

3 votes
Accepted

Must general secure two-party computation be implemented based on public-key encryption primitives?

7 votes
Accepted

Fast cryptographic hash function for short inputs

3 votes

Group for which computing inverse is hard

8 votes
Accepted

What is malicious privacy?

4 votes
Accepted

Separation between CDH and DDH

2 votes

Resources for simple MPC proofs

4 votes
Accepted

LPN Encryption Homomorphism

3 votes

Securely computing the addition of n numbers owned by n people

4 votes
Accepted

Assumptions on zero-knowledge proofs without trusted setup

4 votes
Accepted

What security problem would cause if I reuse a NIZK proof?

3 votes
Accepted

Converting a random OLE (oblivious linear function evaluation) to an OLE

2 votes

Is it secure to do subfield vector oblivious linear evaluation (VOLE) over a Ring $\mathbb{Z}_{2^k}$?

5 votes
Accepted

assumption needed to work in Generic Group Model

4 votes

Secure channel: Is there a assumption in an MPC protocol that the communication between different parties is secure?

2 votes
Accepted

Circuits for general computing

3 votes

What does a semi-malicious setting mean in MPC? How is it different from malicious or semi-honest setting?

3 votes

How to compare two field elements in Arithmetic Circuit?

5 votes
Accepted

How can a verifier benefit from being malicious or dishonest in a Zero Knowledge interactive proof?

3 votes
Accepted

Coin flipping without commitments or random oracles

1 vote

Does $X \rightarrow y$ being CDH imply that, given $X$ distinguishing between $y, r$ is DDH $\forall r\in Z_{p}^{*}$

3 votes

Is there a notion of information theoretic one-way function?

7 votes

Quantum Computing Used to Break RSA by "fixing" Schnorr's Recent Factorization Claim?

3 votes
Accepted

Security of pseudorandom correlation for bilinear correlations

4 votes
Accepted

Secure Multi-Party Computation (MPC) protocol with all dishonest parties

3 votes
Accepted

What type of soundness/knowledge soundness does Schnorr's proof of knowledge of a DLOG have?

6 votes
Accepted

Zero knowledge proofs that one has broken a crypto system

13 votes

Examples of frauds discovered because someone tried to mimic a random sequence

2 votes
Accepted

How can Garbled Circuits be utilized to reduce the round complexity of GMW?

1
2 3 4 5
11