Reputation
2,218
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
1 11 32
Newest
 Promoter
Impact
~93k people reached

Nov
2
comment Which is/are the strongest known Fully Homomorphic Encryption scheme(s)?
What level of strength ? CCA-1 ? or less ?
Nov
1
comment regular expression matching on encrypted data using secure multiparty computation
Interesting any references for this oblivious lookup approach ?
Nov
1
comment regular expression matching on encrypted data using secure multiparty computation
oh ok , what if the regex should be kept private too from the servers ? any thoughts on approaches
Nov
1
comment regular expression matching on encrypted data using secure multiparty computation
I did not get exactly what it means "three share servers will know the regular expressions being used" at Page-7. does three servers know the regex as "TOP|SECRET... " or shares of "TOP" ,"SECRET" etc? If NFA/DFA is constructed on shares of the strings then exactly the problem i mentioned isn't it too trivial ?
Oct
31
comment Can a homomorphic encryption scheme be made CCA2 Secure?
Any known FHE schemes that are CCA1 secure ? Probably you can help answer this crypto.stackexchange.com/questions/30191/…
Oct
30
comment Can a homomorphic encryption scheme be made CCA2 Secure?
is it true to say for FHE scheme also best possible is IND-CCA1 ? or FHE schemes are much less secure ?
Oct
29
comment regular expression matching on encrypted data using secure multiparty computation
independently share ? can you explain more ?
Oct
29
comment regular expression matching on encrypted data using secure multiparty computation
Interesting i will pose a separate question on that
Oct
29
comment regular expression matching on encrypted data using secure multiparty computation
imagine i have shares of each letter of each word from just one party , why do you think we cannot do frequency analysis ? If the secret shares are not created from same polynomial, i dont think we can do meaningful operations. if they are from same poly then we can do frequency analysis as they are consistent
Oct
28
comment How to toggle a bit homomorphically ?
please create a separate question for this
Oct
28
comment How to toggle a bit homomorphically ?
Be very careful, MULT is AND gate (and ADD is OR gate) only for bit level operations. Homomorphism is not defined for NOT gates in general to simulate AND using OR and NOT. At bit level NOT gate is additive inverse
Oct
20
comment Security guarantees of Shamir's secret sharing when some co-efficients are zero
So does this mean , if few co-efficients are zeros , then attacker has lesser work in guessing them so less securre ?
Oct
20
comment Security guarantees of Shamir's secret sharing when some co-efficients are zero
can you explain a bit more ? you mean an attacker is guessing the co-efficients to reconstruct the polynomial ?
Oct
20
comment Can the round function $F$ in a Feistel Network be practically any non-invertible function?
Please refer to the proof here crypto.stackexchange.com/questions/18611/…
Oct
6
comment ABE Attributes Based Encryption
Also please be clear on whether you are asking about CP-ABE or KP-ABE.
Sep
18
comment Is it secure to use order preserving encryption in practice?
In reality , it depends on what data type you want to apply OPE for ? if it is salary , age and such low entropy fields, it may not be suggested
Sep
17
comment What is the meaning of the overlapping region on OTP-perfect secrecy diagram?
Give us some reference to help u better
Sep
13
comment Leakage in Secure Two party Computation
Nice it did not occur to me that we can compute a \emph{differentially private} version of the function. Thanks for this insight !
Sep
4
comment have a question in the book “introduction to modern cryptography”
type the problem and proof to get more help
Sep
4
comment have a question in the book “introduction to modern cryptography”
Who is the author ? Also give us more context , not sure how many has that book to read it and tell u