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
ckamath's user avatar
ckamath's user avatar
ckamath's user avatar
ckamath
  • Member for 10 years, 4 months
  • Last seen more than a month ago
1 vote

Novice Question: Rivest Shamir Wagner 96 Time Lock Puzzles

2 votes
Accepted

Definition of soundness for interactive proof systems

2 votes
Accepted

Is there a CRHF based on integer factorization problem or RSA assumption

4 votes
Accepted

UOWHF vs CRHF / Relevance of UOWHF

2 votes
Accepted

Why do we need "selective security" for ABE?

4 votes
Accepted

What does 'a reduction is tight' mean rigorously?

2 votes

A perfect key exchange similar to the One Time Pad

4 votes

How do you instantiate a Random Oracle?

1 vote
Accepted

Let $G$ be a PRG. Establish whether the following PRG candidates $G^{'},G^{''}$ are secure or not

1 vote

Distribution distinguishability as a decision problem

3 votes
Accepted

Random oracles and the Borel-Cantelli Lemma

1 vote
Accepted

computationally unbounded strategy of prover in zero knowledge proofs

4 votes
Accepted

Interactive Proofs: Why $\delta \lt \frac 13$ for Soundness & Completeness?

2 votes

Cryptography based on #P-complete problems

7 votes
Accepted

Introduce a reference for cryptanalysis of WhatsApp software

5 votes

Indistinguishable Obfuscation vs Functional Encryption

5 votes
Accepted

How to calculate the n in n-bit security of a crypto algorithm?

1 vote

How do we say that one cryptographic primitive is stronger than another?

4 votes

Can CPA secure scheme be converted to CCA secure?

2 votes

Quantitative reduction of Schnorr's identification scheme to DLP

2 votes
Accepted

Is it possible to convert a selective secure broadcast encryption scheme to an adaptive secure broadcast encryption scheme?

4 votes

Quantum-secure obfuscation

2 votes
Accepted

Safe primes and subgroups

6 votes

Is the one-more discrete log problem hard in the Generic Group Model?

13 votes
Accepted

What does it mean to be "sound"?

2 votes

Is phi-hiding assumption as hard as integer factorization?

3 votes
Accepted

Argument of Knowledge - Definition

5 votes
Accepted

Is there any proof for ECDSA signature algorithm?

8 votes

Diffie-Hellman: difficulty of computing $g^{x^2}$ given $g^x$?

2 votes
Accepted

Does knowing modular eth roots help in factoring n?