1,366 reputation
518
bio website
location
age
visits member for 2 years, 11 months
seen 8 hours ago

Working in industry as a cryptography engineer.

To contact me, email paulgrub AT umail DOT iu DOT edu


Oct
17
comment Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312
Well, I'd start by reviewing the definition of perfect secrecy.
Oct
14
comment how does the order-preserving encryption scheme distribute the buckets?
Are you sure we're talking about the same paper? You might be thinking of the earlier paper by Agrawal et al.
Oct
13
comment how does the order-preserving encryption scheme distribute the buckets?
Which density function?
Oct
10
comment how does the order-preserving encryption scheme distribute the buckets?
Which order-preserving encryption scheme in particular are you interested in?
Oct
8
comment How costly is to find millions of large prime numbers for RSA?
OP: Are you implementing a Honey Encryption scheme for RSA secret keys?
Sep
30
comment Bridging the gap between security proofs and “real-world” security
Hmm... you might be right. I wouldn't be offended if people voted to close; this was just on my mind and I wanted to solicit input from the community.
Sep
30
comment Bridging the gap between security proofs and “real-world” security
I guess a salient example of this is encryption that preserves some functionality of the plaintext in the ciphertexts. Most good schemes in this area provide a proof of security based on a constructed model of the ideal functionality. How do we reason about the relevance of that model to a real deployed implementation of the scheme?
Sep
24
comment what is the difference between IBE and ABE schemes
This sounds like a homework question. Is it?
Sep
24
comment reducing false positives in searchable encryption
Actually I'm not sure, come to think of it.
Sep
23
comment reducing false positives in searchable encryption
D.W. is (i think) his handle here.
Sep
22
comment Checking the share membership in secret sharing schemes
I suspect this kind of distinguishing ability would break the information-theoretic security of the Shamir scheme, but I'm not sure.
Sep
19
comment reducing false positives in searchable encryption
David Wagner is a member of this community... Hopefully he'll see this and give you an authoritative answer :)
Sep
17
comment Secure order preserving hash function
To the OP: It's also possible to construct an order-preserving compression algorithm for strings: 1 2
Sep
3
comment Statistical tests for pseudorandom permutations
Also, my internal PRP in the FPE scheme is merely an unbalanced Feistel network similar to the Thorp shuffle.
Sep
3
comment Statistical tests for pseudorandom permutations
Yeah, I don't plan on relying solely on statistical tests to argue the security of my scheme. I think of passing statistical tests as a necessary but not sufficient condition for security.
Sep
3
comment Statistical tests for pseudorandom permutations
Saw that one. Thanks much :)
Aug
29
comment How does Random Oracle and Standard Model differ?
Well, yes and no. The counterargument is that good crypto is about minimizing the assumptions you have to make. Assumptions are dangerous.
Aug
13
comment How is SHA1 different from MD5?
I don't understand your question - every hash function can be described as having "chunks of bits, bit rotation, xor, and special functions".
Aug
10
comment Is HMAC-SHA-1 secure?
The gist is that the HMAC construction has properties which allow its security definition to be met even if the hash used internally is not a cryptographic hash. It need only meet a weaker definition, which is why HMAC-MD5 is also still considered secure.
Aug
8
comment Hardware Implementation of Pairing over BN curves
Whoa... that sounds really interesting. I only know epsilon about pairings, but do you have like a project page or a description of what you're trying to accomplish?