Reputation
4,060
Next tag badge:
46/100 score
29/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~38k people reached

Apr
12
comment Information Theoretically Secure Mediated Digital Signatures
What is the difference between your title and information-theoretically secure digital signatues? $\hspace{.76 in}$
Apr
12
comment Prove there is PRG that is not necessarily one-to-one
"one by one" $\: \mapsto \:$ "one-to-one" $\;\;\;$ ? $\;\;\;\;\;\;\;\;$
Apr
12
comment Prove there is PRG that is not necessarily one-to-one
What would it mean for a PRG to be "one by one"? $\;$
Apr
11
comment Zero knowledge proof relation + number is binary
ZNPK $\mapsto$ ZKPK $\:$ ? $\;\;\;\;$
Apr
10
comment OTP - Why not reuse key? EDITED!
crypto.stackexchange.com/q/2249/991 $\;$
Apr
9
comment How to encrypt a vector $e\in Z^{m}$ using LWE
cs.virginia.edu/%7Eshelat/papers/ms09-1bit.pdf $\;$
Apr
8
comment How does the certificate authority generate a signature F?
The "certificate authority, CA," doesn't "generate a signature S from the file F using" just "the functions above". $\;$ See coast's comment. $\;\;\;\;$
Apr
8
comment Creating unique keys with md5
(On the other hand, one possible risk is someone getting read access to the database and then signing up with "customer data" that was chosen specifically to cause a collision.) $\;$
Apr
8
comment Creating unique keys with md5
en.wikipedia.org/wiki/Universal_hashing $\;$
Apr
8
comment Creating unique keys with md5
Will the data be chosen with the goal of trying to cause a collision? $\;$
Apr
8
comment Are there any noisy homomorphic encryption schemes?
If there is a standard homomorphic encryption schemes then there is a noisy homomorphic encryption scheme. $\:$ That can be proven by showing how one can directly turn a standard homomorphic encryption scheme into a noisy homomorphic encryption scheme. $\:$ (I have given two other "Just Do It" constructions on this site.) $\;\;\;\;$
Apr
8
comment Are there any noisy homomorphic encryption schemes?
Presumably you want to avoid assuming the existence of standard homomorphic encryption schemes, since otherwise there's a "Just Do It" construction. $\;$
Apr
7
answered Common reference string in NIZK
Apr
6
comment How is HMAC(message,key) more secure than Hash(key1+message+key2)
@fgrieu : $\:$ (I realize it's been over a year, but) One could consider SHA256(key1+message+padtoblockboundary+key2) instead. $\;\;\;\;$
Apr
6
comment Hash functions to the power of two and three notation
Yes. ${}{}{}\;$
Apr
4
comment Will ANY prior knowledge assist in determining contents of a SHA1 hash?
"that hash" $\: \mapsto \:$ "that data" $\;\;\;$ ? $\;\;\;\;\;\;\;\;$
Apr
4
revised Will ANY prior knowledge assist in determining contents of a SHA1 hash?
fixed grammar
Apr
3
comment Solve a problem, thought it was hash length extension, hours later, am I wrong?
stackoverflow.com/questions/6961208/… $\;$
Apr
3
comment Solve a problem, thought it was hash length extension, hours later, am I wrong?
Can YouKnowMe contain a null character? $\:$ If no, then the only attack I can think of would require that key:known_value:nonce be more than 2^53 bytes long. $\;\;\;\;$
Apr
3
comment Solve a problem, thought it was hash length extension, hours later, am I wrong?
Oh, yeah, it's more difficult than I thought. $\:$ You would probably need the padding anyway. $\:$ Does the application use unicode or just ascii or something else? $\:$ Can YouKnowMe contain the character Ç? $\:$ What about null characters? $\;\;\;\;$