1,608 reputation
1921
bio website
location Bangalore, India
age 32
visits member for 3 years
seen 3 hours ago

Security and Crypto Technologist


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 ?
Aug
25
comment Found a way to crack AES-128, what now?
u could have verified your solution by asking here :)
Aug
6
comment How feasible is word-level frequency analysis over English (or any language)?
As you are encrypting words from documents, The probabilities of which words would appear together also could be leveraged in breaking this. Modern Language Translation techniques, Spam filter engines etc are based on finding the probabilities of next possible word in a sentence and things like that. So it should be possible to find out
Jul
24
comment How is this affine function a pair wise independent permutation?
oh ok got it ! i miss calculated the $2^n - 1 $ part for $F(B)$
Jul
23
comment How is this affine function a pair wise independent permutation?
isn't it the probability 1 / (( 2^n ) * (2^(n-1))) ?
Jul
18
comment Should we sign-then-encrypt, or encrypt-then-sign?
@D.W , There is possibility that an attacker could launch denial of service , if the message should be decrypted first in order to verify the signature. The attacker could simply pump in large amounts of garbage and make the decryptor deplete its resources, assuming the message is huge and signature is less in length.
Jul
8
comment How is this affine function a pair wise independent permutation?
yes i have copied that from the paper, i have mentioned the same
Jun
27
comment What is Attribute Based Encryption?
informally, intuitively, i believe a technique achieved by PKE could also be achieved by SKE. ABE may be lot cleanly achieved in PKE but should be possible in SKE too, imagine a master secret key split into key shares per attribute or something but i did not think through how ABE can be realized using SKE
Jun
26
comment What is Attribute Based Encryption?
am curious if there is any work done in symmetric ABE schemes
Jun
23
comment how to truncate a PRF on n bits to PRF on t bits where t < n?
@D.W even i was not clear by Boneh's comment that there are better ways to do it . so thought of checking with the community
Jun
18
comment Open source implementations of Symmetric Searchable Encryption and Order Preserving Encryption
This question appears to be off-topic because it is about reference implementations and software recommendations