User SDL

7 votes

4 answers

1k views

Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?

asked Oct 11, 2012 at 18:23

4 votes

1 answer

134 views

Are there other asymmetric-time permutations than x^3 (mod p)?

asked Feb 18, 2016 at 14:16

5 votes

3 answers

754 views

Attack against modular inversion operation using side-channels?

asked Dec 15, 2013 at 12:09

32 votes

3 answers

6k views

Are common cryptographic hashes bijective when hashing a single block of the same size as the output?

asked Aug 3, 2011 at 15:50

5 votes

0 answers

576 views

How hard is a known prefix hash preimage attack on SHA-2?

asked Feb 23, 2013 at 13:31

10 votes

1 answer

349 views

Is the Representation Problem hard on elliptic curves?

asked Aug 9, 2011 at 15:42

2 votes

1 answer

210 views

Is there an "additive" proof-of-work?

asked Nov 19, 2014 at 20:16

1 vote

0 answers

265 views

Is there a malleable pubkey digital signature scheme?

asked Apr 8, 2014 at 1:10

2 votes

1 answer

338 views

Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?

asked Apr 10, 2014 at 5:08

3 votes

2 answers

436 views

Why nobody considers counter re-keying as a standard Block Cipher Mode?

asked Feb 22, 2013 at 19:57

7 votes

2 answers

1k views

Is there a practical zero-knowledge proof for this special discrete log equation?

asked Oct 31, 2012 at 18:33

8 votes

3 answers

1k views

Can one use a Cryptographic Accumulator to efficiently store Lamport public keys without the need of a Merkle Tree?

asked Dec 10, 2013 at 22:56

9 votes

3 answers

348 views

How hard is to invert the function that computes the middle-bits of (x^2)?

asked Dec 2, 2013 at 21:59

4 votes

2 answers

1k views

Are there any bijective one-way functions not based on number-theoretic hardness assumptions?

asked Nov 7, 2013 at 0:00

8 votes

2 answers

2k views

How is the x coordinate of a "point at infinity" encoded in a Secp256k1 signature?

asked Jan 28, 2013 at 20:40

6 votes

2 answers

1k views

Is there any weak message for an ECDSA signature?

asked Jul 22, 2013 at 22:30

5 votes

1 answer

1k views

Can ElGamal encryption and ElGamal signatures be used together sharing the same key-pairs?

asked Oct 29, 2012 at 18:14

1 vote

1 answer

251 views

Can one detect if two pairs of elements in Zp have the same exponential relation?

asked Mar 9, 2013 at 14:02

1 vote

1 answer

818 views

How can I prove in zero knowldege that an ElGamal shuffle is correct for a special setting? [closed]

asked Oct 30, 2012 at 19:28

4 votes

1 answer

1k views

Is there a method to break an EC curve for all key-pairs (Q,d) such that (Q=d*G) faster than breaking every single key-pair?

asked Sep 12, 2012 at 3:33

10 votes

4 answers

4k views

What is the signature scheme with the fastest batch verification protocol for multiple signers?

asked Aug 30, 2011 at 13:40

2 votes

2 answers

358 views

Is there a cumulative commitment scheme?

asked Aug 29, 2011 at 14:52

5 votes

1 answer

1k views

What type of hash functions provides non-malleability of hash digests?

asked Feb 2, 2012 at 15:09

Stack Exchange Network

23 Questions

Is there a public key semantically secure cryptosystem for which one can prove in zero knowledge the equivalence of two plaintexts?

Are there other asymmetric-time permutations than x^3 (mod p)?

Attack against modular inversion operation using side-channels?

Are common cryptographic hashes bijective when hashing a single block of the same size as the output?

How hard is a known prefix hash preimage attack on SHA-2?

Is the Representation Problem hard on elliptic curves?

Is there an "additive" proof-of-work?

Is there a malleable pubkey digital signature scheme?

Is there a simple zero knowledge proof of $x$ for $b=x^x\pmod p$?

Why nobody considers counter re-keying as a standard Block Cipher Mode?

Is there a practical zero-knowledge proof for this special discrete log equation?

Can one use a Cryptographic Accumulator to efficiently store Lamport public keys without the need of a Merkle Tree?

How hard is to invert the function that computes the middle-bits of (x^2)?

Are there any bijective one-way functions not based on number-theoretic hardness assumptions?

How is the x coordinate of a "point at infinity" encoded in a Secp256k1 signature?

Is there any weak message for an ECDSA signature?

Can ElGamal encryption and ElGamal signatures be used together sharing the same key-pairs?

Can one detect if two pairs of elements in Zp have the same exponential relation?

How can I prove in zero knowldege that an ElGamal shuffle is correct for a special setting? [closed]

Is there a method to break an EC curve for all key-pairs (Q,d) such that (Q=d*G) faster than breaking every single key-pair?

What is the signature scheme with the fastest batch verification protocol for multiple signers?

Is there a cumulative commitment scheme?

What type of hash functions provides non-malleability of hash digests?