376 reputation
110
bio website
location
age
visits member for 1 year, 1 month
seen Nov 19 at 22:33

Nov
17
answered plaintext distribution ,perfect secrecy cryptosystem
Nov
17
comment Collision resistant hash functions
Does the proof-of-work tag even related here?
Nov
17
answered Collision resistant hash functions
Nov
5
awarded  Critic
Nov
2
awarded  Citizen Patrol
Oct
31
revised what is contained in a public key certificate
edited body
Oct
31
answered what is contained in a public key certificate
Oct
27
awarded  Yearling
Oct
1
comment Bleichenbacher 1998 “Million message attack” on RSA
This might help crypto.stackexchange.com/questions/12688/…
Sep
21
awarded  Popular Question
Sep
17
accepted What are Cryptographic Multi-linear Maps?
Sep
16
comment understanding the proof of knowledge
In your first question, do you mean Zero-Knowledge Proof of Knowledge? or a mere Proof of Knowledge?
Sep
16
answered Shannon confusion and diffusion concept
Sep
16
awarded  Teacher
Sep
16
accepted Why does a perfect secrecy can be achieved when decryption correctness is not totally required?
Sep
16
answered Why does a perfect secrecy can be achieved when decryption correctness is not totally required?
Jul
2
awarded  Curious
Jun
6
comment Hamiltonicity proof of knowledge
@RickeyDemer 1.Why did you assigned 0 to $\kappa (|x|)$? 2.Why do you need a minimum-length witness? 3.$K_w$ cannot output a witness with certainity, if $P^*$ is lying then $K_w$ wouldn't be able to output a witness. 4. I don't understand your conclusion (where is it stems from?).
Jun
5
comment Hamiltonicity proof of knowledge
$L_R$ is the set of all $x$s s.t. there exists $y$ s.t. $(x,y)\in R$. The construction of the knowledge extractor is trivial bur what can you say about the running time requirement, which related to the knowledge error? (As I wrote in the 'question' part)
Jun
4
comment Hamiltonicity proof of knowledge
@RickyDemer, it's a typo - fixed