1,536 reputation
1720
bio website
location Bangalore, India
age 32
visits member for 2 years, 11 months
seen 56 mins ago

Security and Crypto Technologist


3h
comment Is it possible to find out whether a number is greater than another number without knowing the numbers?
use orderpreserving encryption ?
12h
comment Forward pseudorandom permutation
it is not clear what you want to achieve. what is the actual problem ?
12h
comment How to get PrivateKey from byte[]
also check on how you are intiating the KeyStore.getInstance ,usually not all the engines support all key formats. there are different engines like JCEKS, JCE etc. google for more
12h
comment How to get PrivateKey from byte[]
stackoverflow.com/questions/15238179/… is similar question
16h
comment Checking the share membership in secret sharing schemes
@GuutBoy, yes am considering the setting you described
17h
comment Checking the share membership in secret sharing schemes
$P_i$ knows the secret and t,n parameters also.
21h
comment https://bitcointalk.org/index.php?topic=790883.0
do u want to rephrase your question ?
21h
comment Checking the share membership in secret sharing schemes
@pg1989 the distinguishing ability may break some security if other parameters like $t,n$ are not made available etc. here we are only speeding up the process of identifying the membership
1d
comment Understanding Pseudo Random Generators
Check this video , good introduction with visualization usenix.org/conference/woot14/technical-sessions/presentation/…
Sep
20
comment What is Attribute Based Encryption?
@DrLecter can u point me to the "recursive secret sharing" schemes you were saying above ?
Sep
20
comment Does Ciphertext policy ABE support search operation on encrypted data
In theory , ABE, PBE are further generalized as Functional encryption. So is your question whether FE (or its variants) could be used for Searchable encryption ? if then how ?
Sep
19
comment Does Ciphertext policy ABE support search operation on encrypted data
It is not clear what you are asking. you may consider re-editing it. Are you asking if cp-abe supports searchable encryption by giving away appropriate keys ?
Sep
19
comment Authenticating Very Short (Sub-Block) Data
What if i dont want the tags for authentication and just the length preserving short block encryption is needed ? any suggestions apart from FPE techniques ?
Sep
13
comment breaking fully homomorphic encryption schemes
will the cipher text probabilistic in general ?
Sep
11
comment Feistel cipher vs Substitution-permutation network - number of rounds
for feistel networks check "patarin's proof" , 7 rounds is what he proved to be good enough. i dont know about SPN
Sep
9
comment breaking fully homomorphic encryption schemes
Oh yeah , i missed this key insight that the result is also cipher text.
Sep
9
comment “Practical” operations supported by functional encryption?
It sounded as if , Homorphic supports only those two operations. But they are the building blocks to support any other complex operations.
Aug
30
comment practically verifying block ciphers strength
yes the tools could be lot generic. Am imagining, machine learning based say "supervised learning" based techniques to identify non-randomness after some number of rounds etc.
Aug
30
comment practically verifying block ciphers strength
it is a encryption scheme not mode, shall correct it thanks ! BTW , curious what those tools are for analyzing "modes"
Aug
29
comment Homomorphic Encryption: how does the equality test on ciphertexts work?
@ChrisPeikert if encryption is randomized, i doubt if homomorphic properties are retained. For example RSA is multiplicative homomorphic only when padding is not used rite ? is there a catch some where am missing ?