User user6584

10 votes

Difference between theory and practice of security and cryptography?

answered Aug 29, 2010 at 4:27

8 votes

What are good references to understanding the proof of the PCP theorem?

answered Sep 5, 2010 at 3:11

6 votes

Threshold Fully Homomorphic Cryptosystems

answered Sep 4, 2011 at 4:23

4 votes

Instances of Noninteractive Zero knowlege Proofs

answered Oct 12, 2011 at 1:50

4 votes

Reducing $n$ in $(n,k)$ secret sharing while keeping it effective

answered Aug 1, 2011 at 3:40

4 votes

Motivating Talk on Foundations of Cryptography

answered Feb 26, 2012 at 20:05

4 votes

How can DES have 6x4 S-Boxes and still be reversible?

answered Oct 12, 2011 at 3:43

3 votes

One-Way Functions vs. perfectly binding commitments

answered Jan 3, 2012 at 3:03

3 votes

Directed acyclic graphs with logarithmic diameter

answered Mar 23, 2022 at 23:31

3 votes

Are linear feedback shift registers being generally discouraged by cryptologists?

answered Apr 24, 2012 at 0:51

3 votes

Accepted

Recovery of preimage of hash function given part of it

answered Aug 2, 2011 at 3:15

3 votes

What are some examples of secret sharing schemes actually being used in real-world applications?

answered Sep 5, 2010 at 3:08

2 votes

On the Proof Technique of Boneh-Lynn-Shacham Gap Signatures

answered Oct 12, 2011 at 3:37

2 votes

Rabins Signature Implementation

answered Apr 25, 2012 at 0:42

2 votes

NIZK proofs: Why is the prove function necessary?

answered Dec 2, 2012 at 19:35

2 votes

Accepted

Jointly Establishing a Shared Random String for NIZK proofs of knowledge

answered Mar 22, 2012 at 10:33

1 vote

Accepted

Computation space of Nisan's generator for space bounded machines

answered Mar 22, 2012 at 10:37

1 vote

"forward-secure" zero knowledge protocols

answered Mar 22, 2012 at 10:49

1 vote

Accepted

How much bigger does a precomputed lookup table get when salt is added?

answered Apr 22, 2012 at 20:49

1 vote

Justifying simplifying assumption about message distributions for perfectly secret encryption?

answered Dec 2, 2012 at 20:02

1 vote

A clarification in Signature schemes for Strong Unforgeability.

answered Aug 3, 2011 at 0:28

0 votes

Interdisciplinary topics between control theory and theoretical computer science

answered Aug 16, 2021 at 21:20

Stack Exchange Network

22 Answers

Difference between theory and practice of security and cryptography?

What are good references to understanding the proof of the PCP theorem?

Threshold Fully Homomorphic Cryptosystems

Instances of Noninteractive Zero knowlege Proofs

Reducing $n$ in $(n,k)$ secret sharing while keeping it effective

Motivating Talk on Foundations of Cryptography

How can DES have 6x4 S-Boxes and still be reversible?

One-Way Functions vs. perfectly binding commitments

Directed acyclic graphs with logarithmic diameter

Are linear feedback shift registers being generally discouraged by cryptologists?

Recovery of preimage of hash function given part of it

What are some examples of secret sharing schemes actually being used in real-world applications?

On the Proof Technique of Boneh-Lynn-Shacham Gap Signatures

Rabins Signature Implementation

NIZK proofs: Why is the prove function necessary?

Jointly Establishing a Shared Random String for NIZK proofs of knowledge

Computation space of Nisan's generator for space bounded machines

"forward-secure" zero knowledge protocols

How much bigger does a precomputed lookup table get when salt is added?

Justifying simplifying assumption about message distributions for perfectly secret encryption?

A clarification in Signature schemes for Strong Unforgeability.

Interdisciplinary topics between control theory and theoretical computer science