Reputation
2,201
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
1 11 28
Impact
~85k people reached

Dec
8
comment Largest number that could be factored in milli seconds
@fgrieu , am not sure that is simple enough to understand from a layman perspective , so i would prefer leaving the question that way :)
Dec
7
comment Largest number that could be factored in milli seconds
@fgrieu am more interested in time frame than algo used , so rephrased the construction
Nov
30
comment paradox on fully homomorphic equality checking
@mikeazo yes i did see that question, which is different than mine
Nov
30
comment paradox on fully homomorphic equality checking
@RickyDemer "does not know the result" . Oh is there a reference for that ? on non-interactivity of checking ?
Nov
30
comment paradox on fully homomorphic equality checking
@RickyDemer The server uses FHness of encryption scheme but then does not the result , does that mean Equality Checking cannot be done using FHE ?
Nov
30
comment paradox on fully homomorphic equality checking
@DrLecter , If i want keyword equality, can't we do with FHE?
Nov
29
comment Probabilistic Disjoint Verification
It is very unclear what you are asking, please update your question what the problem being addressed is ?
Nov
12
comment regular expression matching on encrypted data using secure multiparty computation
@Mikero, Added a separate question , Please consider answering it crypto.stackexchange.com/questions/30463/…
Nov
12
comment How many polynomials are used in Secure Multiparty Computation?
@MHSamadani the above does not answer my question, The answer is more generic. The reference is also not related to SMC.
Nov
5
comment Salary Negotiation Problem
@sju but that would need multiple queries, for Alice to come close to B's number.
Nov
3
comment Is there a way to optimize a linear scan while preserving anonymity?
Can we assume both Alice and Bob know a public constant ? not really pre-shared secret or public key. I have a solution if they can agree public constants
Nov
2
comment Is there a way to optimize a linear scan while preserving anonymity?
Randomization of two different instances of A is beating sub linear lookup by Bob, but this is a good problem
Nov
2
comment Which is/are the strongest known Fully Homomorphic Encryption scheme(s)?
@DrLecter I learnt offline from NP Smart that, the scheme in the paper you mentioned is prone to Soliloquy attack and that it is no longer considered stronger , i could not get any reference to it though beyond this web.eecs.umich.edu/~cpeikert/soliloquy.html
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 ?