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

Apr
12
comment Secret construction
added another edit 2 , sorry should have been more clear upfront
Apr
12
comment Secret construction
Oops yes. let me edit the question , i forgot an important property
Apr
12
comment Secret construction
I have added one condition to be able to reconstruct the original set back. am looking for any basic algorithm, additional properties like reconstructing from subset etc. would be a bonus for me !
Mar
14
comment Format preserving encryption
ofcourse yes , check answers for other questions on same topic, it is well covered here
Feb
16
comment What is the best current way to cryptographically secure databases?
I would like to see Performance also as criteria. In real world it beats everything much before we tell the users that it is secure. Currently zerodb pushes chunks of encrypted data back to client for operations. In large scale applications that beats the purpose of outsourcing data to server
Feb
16
comment What is the best current way to cryptographically secure databases?
Curious if you have any third party security analysis done ? or your technology published in some conference for review
Feb
11
comment Convert ciphertexts of one encryption scheme to another without decryption
A more appropriate way is "convert ciphertext encypted under one scheme to another .."
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
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 ?