Skip to main content
ckamath's user avatar
ckamath's user avatar
ckamath's user avatar
ckamath
  • Member for 10 years, 5 months
  • Last seen more than a month ago
1 vote

Functional signatures vs homomorphic signatures

4 votes
Accepted

randomness of encrypt

1 vote

Update non-member witness in RSA accumulator

4 votes
Accepted

Proof of lemma 1 Paillier encryption

0 votes

What is the difference between different corona tracing protocols?

1 vote
Accepted

Assumption of difficulty of attack in restricted short time

3 votes
Accepted

Multiparty dataset intersection count

1 vote

What is the discrete logarithm assumption and why it is not easy with Shank's baby-step/giant-step

2 votes

Is there a cryptographic solution to provide a “proof of exclusion”?

3 votes

Zero knowledge proof for a discrete logarithm

11 votes

What is the difference between PRF and a Random Oracle?

0 votes
Accepted

GMW Multiplication AND for 2 parties

2 votes

Time cost of security reduction

7 votes
Accepted

Diffie-Hellman with Galois field

4 votes

When would one prefer a proof of knowledge instead of a zero-knowledge proof?

6 votes
Accepted

Can one-way permutations be constructed from one-way functions?

2 votes

Concrete Example of AND Gate Using Garbled Circuit

1 vote
Accepted

Bulletproof and random oracle model

3 votes

Decision to Search LWE when modulus $q=p^e$

4 votes

Does secure hashing imply secure symmetric encryption?

5 votes
Accepted

Problem with Fiat-shamir on poly-round interactive protocol?

1 vote

Blinding to mask private key operations

4 votes
Accepted

Zero-Knowledgeness of Fiat-Shamir heuristic

1 vote

Hardwired secret key in public / private key encryption

4 votes
Accepted

Why is a common reference string needed in zero knowledge proofs?

1 vote

Could time lock encryption be implemented through indistinguishable obfuscation?

13 votes
Accepted

Are DSA and ECDSA provably secure assuming DL security?

4 votes

Signature security proof in the Random Oracle model

2 votes

Estimating difficulty of "Memory-Hard Proof-of-Work" based on "size of memory"?

5 votes

Are there any symmetric cryptosystems based on computational complexity assumptions?