Reputation
1,082
Next privilege 2,000 Rep.
Edit questions and answers
Badges
5 18
Newest
 Necromancer
Impact
~15k people reached

2d
answered Why are the bit lengths of keys and digests equal in Lamport signatures?
Apr
21
awarded  Necromancer
Apr
11
answered Practical lattice based signatures and key exchange with strong security reduction
Mar
10
comment Are CSPRNGs quantum-resistant?
Right. For the generic security the inner state size does not matter. Nevertheless, I guess it will matter as soon as you start looking at the internals. I mean, finding the internal state would also work to distinguish so that should probably also be twice the targeted security level...
Mar
9
answered Are CSPRNGs quantum-resistant?
Feb
8
comment When all shares of a secret are given to adversary as a permuted matrix
You have to be aware that you do not get perfect secrecy anymore when using this scheme but only computational security. Now you can increase security increasing the number of dummies. However, in the end you will probably not be more secure than using for example AES... in both cases the attacker just has to guess the key for a permutation.
Feb
3
comment When all shares of a secret are given to adversary as a permuted matrix
Well, but you could simply sample the dummy values from the same distribution. E.g., if we continue the Twitter + Shamir case you could simply produce shares for dummy Twitter messages. In general, you should be able to generate the same distribution by sharing messages that follow the same distribution as your real message. The only issue is that you end up with enormous storage requirements...
Jan
25
answered Is there any more information on this RSA backdoor?
Jan
15
comment Proof of non-membership on a merkle tree
Agreed, that's not nice. However, I guess you do not get more efficient than the two proposed solutions sticking with Merkle trees. Simply because the trees themselves are not aware of the universe the data set lives in.
Jan
15
comment Proof of non-membership on a merkle tree
Indeed... The problem is that Merkle tree's are only designed for proofs of membership, not for proofs of non-membership. Perhaps you choose the wrong tool? You might want to have a look at cryptographic accumulators (e.g. eprint.iacr.org/2008/538.pdf).
Jan
14
answered Instantiating a random oracle
Jan
14
answered Proof of non-membership on a merkle tree
Jan
13
answered Choice of the one-way function (OWF) for Lamport signatures
Jan
6
answered Question about lower bound and upper bound key collision
Jan
6
answered Why is it allowed to Generate Keys inside the game?
Dec
10
answered Fast Forward Hash Signatures
Dec
9
comment Fast Forward Hash Signatures
You might want to add at least a security "argument" if not a proof to the concept. Writing this might already tell you possibly existing problems (I do not claim that there are problems).
Nov
16
reviewed No Action Needed Trivium example
Nov
16
reviewed Close Grouping in BGN
Nov
11
awarded  Yearling