Skip to main content
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
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?

2 votes

Is it possible to prove that an encrypted message was encrypted with some public key without divulging the plaintext or secret key?

0 votes
Accepted

Oblivious Decision Making

1 vote

How can you use ZK-proofs and public key signatures in this situation?

5 votes
Accepted

Additive vs Linear Secret Sharing

2 votes
Accepted

Pseudorandom correlation generators for many small tensor products

3 votes
Accepted

Randomized encodings and Indistinguishability obfuscation

3 votes
Accepted

Groth'16 trapdoor for simulator

1 vote
Accepted

What do we know about the relationship between IP, ZKP?

2 votes
Accepted

Which ZK proving systems are statistically vs computationally zero knowledge?

7 votes

Is there a cryptographic algorithm that can make a "lottery ticket"?

3 votes
Accepted

Can we achieve statistical Completeness, Soundness and Zero Knowledge in an Interactive Proof?

1 vote

Verifiable Delay Function: Trusted Setup

5 votes
Accepted

Are there simple, cryptographically safe one-way hashing functions?

2 votes

Diffie-Hellman key size to symmetric formula?

1 vote
Accepted

Secretly compute multiplication of two numbers owned by two people

8 votes
Accepted

Relation between Knowledge extractor and soundness in ZKPoK

9 votes
Accepted

Grinding in the Fiat-Shamir heuristic

1 vote

Is it possible to construct a 1-out-of-N OT with communication complexity smaller than the sender's whole input?

9 votes
Accepted

What is the difference between information-theoretic and perfect types of security?

6 votes
Accepted

Would being able of factoring integers efficiently have some consequences over Elliptic Curve Cryptography?

3 votes
Accepted

Groth16 simulate zero-knowledge proof for invalid statement

3 votes
Accepted

Why Zk-SNARKs are Argument of Knowledge if a Knowledge Extractor exists?

5 votes

Virtual Black Box Obfuscator

1 vote
Accepted

GL-SPHF and witness encryption

1
2
3 4 5
11