16,572 reputation
22470
bio website pwnhome.wordpress.com
location Earth
age
visits member for 3 years, 6 months
seen 39 mins ago

I like crypto. Need I say more?


May
29
reviewed Leave Open how to use common modulus attack?
May
29
reviewed Leave Open Most frequently used digital signature schemes in the recent years
May
29
reviewed Close IV's from Crypto++ AutoSeededRNG always ends the same: Problem with the PRNG?
May
29
comment how to use common modulus attack?
@ShankhaJana Since you found it on an examination paper, you should specify that in the question and give credit to the source.
May
29
comment Which tamper-protection algorithm provides the shortest output?
cleaned up some comments
May
27
comment Generating Encryption Keys from Biometric Fingerprint Templates
Any references on the entropy rate of fingerprints and the error rates seen with COTS scanners?
May
27
comment (n,n) Shamir secret sharing
Yeah. I wrote about it in my answer on the other question.
May
27
comment (n,n) Shamir secret sharing
@user153465 you are right. I was talking about the proposed solution I had in the other answer. That wouldn't apply if you want to do MPC.
May
27
comment (n,n) Shamir secret sharing
@user153465 Both the answers on the linked question also mention that is is feasible to still have security when keeping the $x$ values private. There are some caveats, however, that I mentioned in my answer. Perhaps the other question is not specific enough? For example, the OP mentioned in a comment that he wanted some multiparty computation features to be preserved. That sort of stuff should have been present in the question (because it dramatically changes the answer). Our answers are a function of the input we receive on here. Overly vague questions will not get the best answers possible.
May
27
comment (n,n) Shamir secret sharing
@user153465 In other words, you have to remember, no one gets paid to write answers on here. We do it of our own good will. I personally think the answers on the linked question are pretty good (I am biased though since I wrote one). If they aren't good enough for you, though, you can, at the very least, explain exactly why. If all you are looking for is for someone to formally prove it for you, I doubt very many people here will be willing to take the time to do that. Your profile says you are a PhD student. I gave some hints on how to prove it in the comments. That should help a ton.
May
27
comment Want to use ECC but am clueless
@zakshaks I can migrate the question to Super User if you would like.
May
27
comment (n,n) Shamir secret sharing
@user153465. I think DrLecter's point is that the question is a duplicate. Whether or not the duplicate question has a correct answer is irrelevant to the discussion here. There are other ways to try to get better answers on a question than to post a duplicate question. For example, you can (once you have more rep points here) offer a bounty. You can comment on the answers to explain why they are lacking. You can post a better answer yourself.
May
27
revised Shamir Secret sharing - Can share generator keep x values secret?
deleted 3 characters in body
May
27
comment Can I use Shamir's secret sharing scheme for multiplicative homomorphism for secure multiparty computation?
@nie_11, any number of secrets can be multiplied using this process. You just simply do them 2 at a time. Remember though that the threshold must be no more than half of the total number of parties.
May
26
revised Generating Encryption Keys from Biometric Fingerprint Templates
added 1661 characters in body
May
26
answered Generating Encryption Keys from Biometric Fingerprint Templates
May
26
answered How can I perform matching on an “encrypted- fingerprint feature matrix” using Fully Homomorphic Encryption?
May
23
comment Problem with anonymously merging information from distributed sources
It sounds like the long random salt is generated anew for each session. If it is long enough, then the server that does the merging shouldn't be able to reverse it without knowing the salt.
May
23
comment Problem with anonymously merging information from distributed sources
Who issues the identifiers? You could always mix in a secret key to the "hash" you send to the third system. If the secret is known only by the first two systems and is sufficiently long (at least 128 bits), the third system wouldn't be able to figure out the inverse mapping.
May
22
comment Symmetric-Key Based authentication
@Neelam, I'm having a hard time seeing what your question is. Are you just wanting one of us to answer i) and ii) for you or are you having trouble understanding the protocol?