User DrLecter

4 votes

Are hash trees an alternative, quantum-resistant signature scheme which can replace RSA?

answered Nov 21, 2013 at 8:24

4 votes

Can you explain partial private key extract algorithm in certificateless Public key cryptography?

answered Nov 12, 2013 at 13:50

4 votes

Accepted

How to Distribute the Shares using Secret Sharing for arbitrary Monotone Access Structures

answered Oct 31, 2013 at 18:48

4 votes

Selective and existential unforgability of signature schemes

answered Mar 18, 2016 at 23:38

4 votes

Accepted

Confused about how chosen ciphertext attacks work?

answered Nov 25, 2015 at 11:45

4 votes

Accepted

Hash Function representation in identity-based encryption

answered Jun 16, 2016 at 15:17

4 votes

Accepted

Partially Homomorphic Cryptographic Schemes - Deterministic vs Probabilistic

answered Nov 20, 2017 at 10:29

4 votes

How to compute accumulated values in bilinear map accumulators

answered Mar 11, 2015 at 20:23

4 votes

Accepted

How to use ElGamal to encrypt zero?

answered Dec 20, 2014 at 18:45

4 votes

Does a cryptosystem provide unconditional security if and only if it provides perfect secrecy?

answered Dec 21, 2014 at 18:40

4 votes

Accepted

What does $\to$ mean in the following definition of a block cipher?

answered Sep 6, 2014 at 18:26

4 votes

How to calculate kinv from the given k value

answered Sep 16, 2014 at 6:36

4 votes

Group Dependent Language

answered Sep 25, 2014 at 20:51

4 votes

Accepted

Correctness vs Completeness

answered Oct 3, 2014 at 14:22

4 votes

Accepted

How do RSA and ElGamal key sizes compare?

answered Oct 10, 2014 at 23:50

3 votes

What is "msg = group.random(GT)" in Charm encryption schemes?

answered Sep 25, 2014 at 9:01

3 votes

Accepted

Hardness of problem related to bilinear pairings

answered Jan 8, 2015 at 9:46

3 votes

Accepted

Altering the message space of Paillier

answered Apr 7, 2015 at 19:07

3 votes

Accepted

What does “simulator” and “interactive” mean in a cryptographic credential system's definition of security?

answered Jul 23, 2015 at 6:17

3 votes

Accepted

Why is the definition of Special-honest verifier zero-knowledge probabilistic?

answered Aug 4, 2015 at 14:21

3 votes

Accepted

Is verification of ring signature always linear in the amount of members?

answered Jun 13, 2019 at 5:10

3 votes

Accepted

Schnorr protocol: how does malicious verifier win?

answered Dec 22, 2016 at 8:40

3 votes

Accepted

What does variable-base point/scalar multiplication mean in ECC?

answered Mar 14, 2015 at 14:11

3 votes

In Elgamal, the generator g is always quadratic non-residue modulo p where p is a safe prime and inverse of g can be also generator?

answered Nov 2, 2013 at 22:30

3 votes

Why is $-1$ an illegal message in the Goldwasser-Micali Encryption Scheme

answered Nov 5, 2013 at 13:50

3 votes

Accepted

Decrypting without using the private key

answered Oct 10, 2013 at 15:22

3 votes

Does ElGamal Encryption create a different key for each block sent?

answered Oct 7, 2013 at 15:18

3 votes

Accepted

Is there an encyption scheme that combines additive homomorphism with ability to proxy re-encrypt?

answered Oct 21, 2013 at 6:13

3 votes

Accepted

Private Messaging

answered Dec 18, 2013 at 21:15

3 votes

How does this happen in RSA malleability?

answered Dec 9, 2013 at 6:37

Stack Exchange Network

203 Answers

Are hash trees an alternative, quantum-resistant signature scheme which can replace RSA?

Can you explain partial private key extract algorithm in certificateless Public key cryptography?

How to Distribute the Shares using Secret Sharing for arbitrary Monotone Access Structures

Selective and existential unforgability of signature schemes

Confused about how chosen ciphertext attacks work?

Hash Function representation in identity-based encryption

Partially Homomorphic Cryptographic Schemes - Deterministic vs Probabilistic

How to compute accumulated values in bilinear map accumulators

How to use ElGamal to encrypt zero?

Does a cryptosystem provide unconditional security if and only if it provides perfect secrecy?

What does $\to$ mean in the following definition of a block cipher?

How to calculate kinv from the given k value

Group Dependent Language

Correctness vs Completeness

How do RSA and ElGamal key sizes compare?

What is "msg = group.random(GT)" in Charm encryption schemes?

Hardness of problem related to bilinear pairings

Altering the message space of Paillier

What does “simulator” and “interactive” mean in a cryptographic credential system's definition of security?

Why is the definition of Special-honest verifier zero-knowledge probabilistic?

Is verification of ring signature always linear in the amount of members?

Schnorr protocol: how does malicious verifier win?

What does variable-base point/scalar multiplication mean in ECC?

In Elgamal, the generator g is always quadratic non-residue modulo p where p is a safe prime and inverse of g can be also generator?

Why is $-1$ an illegal message in the Goldwasser-Micali Encryption Scheme

Decrypting without using the private key

Does ElGamal Encryption create a different key for each block sent?

Is there an encyption scheme that combines additive homomorphism with ability to proxy re-encrypt?

Private Messaging

How does this happen in RSA malleability?