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

Apr
16
comment can you attack to this protocol?
What are the roles of the two inputs to those public keys? $\:$ (Is one of them associated data?) $\hspace{.8 in}$
Apr
15
revised Popularity of ECMQV authenticated key agreement protocol
improved grammar
Apr
15
comment what is legend of h(r) in this protocol?
$h$ is a hash function. $\;$
Apr
15
comment Asymmetric encryption that is secure for (almost) any foreseeable future
@HadrienG. : $\;\;\;$ No, since there isn't even a known proof that there is no extremely practical algorithm for QBFs. $\:$ There is a complete PKE scheme, but it's completely impractical. $\;\;\;\;\;\;\;\;$
Apr
15
comment Asymmetric encryption that is secure for (almost) any foreseeable future
"Security is broken if an attacker can ... or reliably forge a message that looks like it has $\hspace{1.1 in}$ been encrypted with the private key" is an odd criterion. $\;$
Apr
14
comment Value of S and r in Fiat-Shamir Protocol
Why would RSA fail in that case? $\;$
Apr
14
comment What are the difference between cryptographic primitives and encryption primitives?
@StephenTouset : $\;\;\;$ They are only properties of implementations in the context of defending against physical-access side-channel attacks. $\:$ Otherwise, they are desirable properties of the ciphers themselves. $\;\;\;\;\;\;\;\;$
Apr
12
comment Why is plain ElGamal not secure?
en.wikipedia.org/wiki/Malleability_(cryptography) $\;$
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