301 reputation
15
bio website xagawa.net
location
age
visits member for 1 year, 1 month
seen 23 hours ago
stats profile views 4

May
6
comment Indistinguishability attack example
What you should do is proposing an attack and estimating its advantage. How does your adversary choose two plaintexts?
Mar
27
comment Alice trusts Bob only when Bob trusts Alice
I guess "(optimistic) fair exchange" might be the answer. How about it?
Mar
20
comment Proof of the standard pseudorandom generator + XOR encryption scheme in Goldreich
Suppose the two absolute values are at most 1/(2p), then you get 1/p < |...| + |...| <= 2 * 1/(2p) = 1/p, that is, contradiction.
Mar
17
comment Does Linear Cramer-Shoup have pseudo-random ciphertexts?
Hi Henrick. Did you read the proof? In page 5, Shacham constructed a DLIN solver B from an IND-CCA2 distinguisher A.
Mar
13
comment Zero-Knowledge Challenge-Responce Protocol
Why don't you google with the keywords, say, "Sigma, DDH, Zero-Knowledge"? I found a nice lecture note written by Berry Schoenmakers.
Mar
10
comment Zero-Knowledge Challenge-Responce Protocol
My answer referred to the same point. As you know, r_{id} is the voter's identity. The polling station has (g,g^x,r_{id},\sigma) and the RA has x. If \sigma = r_{id}^x, then the RA can prove that (g,g^x,r,\sigma) is the DDH tuple.
Jan
17
comment Is a steganographic technique which has a universal decoder novel/secure?
From cryptographic view, Hopper's thesis (and relevant papers) will give concrete security definitions for steganography. dtic.mil/cgi-bin/GetTRDoc?AD=ADA457810
Jan
2
comment What are monotonic and non monotonic access structures in ABE ?
Beimel's thesis is available at IACR's Ph.D Database iacr.org/phds/index.php?p=detail&entry=548
Jul
27
comment Several questions about Paillier cryptosystem
Dear Community♦. I cannot understand why you add the comment, because Lieven asks the question on the same encryption key.