20,795 reputation
32575
bio website
location
age
visits member for 3 years, 4 months
seen 2 days ago

Oct
4
comment Witness and Commitment in Commitment schemes
This site is not a book recommendation service, but Lindell & Katz is good for much intro level material, and Goldreich's book is worth reading too.
Oct
4
comment Witness and Commitment in Commitment schemes
What research have you done? Have you read standard textbooks on commitment schemes? This is a very basic level question, and should be settled by reading standard references. I expect you to do a significant amount of research/self-study on your own before asking; this site is not a replacement for that.
Oct
4
answered Has there been any cryptanalysis of AES under a non-uniformly distributed key?
Oct
4
comment Cryptographic data structure: sparse array without membership test
1. Are you looking for a history-independent data structure? I suspect that's the term used in the literature for this concept. There is lots of work in the crypto literature on history-independent data structures for various purposes. 2. What does the attacker get to see? Does the attacker only get to see the state of the data structure after all get/set operations have completed? Or can he see its state at various points along the way?
Sep
30
awarded  Explainer
Sep
28
comment Question about second preimage resistance of hash function combiner
possible duplicate of Guarding against cryptanalytic breakthroughs: combining multiple hash functions
Sep
28
comment Encrypted database: how to deal with general queries?
@mczraf, in fact, my understanding is that there has already been some industry adoption of CryptDB / the ideas in CryptDB. See e.g. css.csail.mit.edu/cryptdb/#Impact
Sep
28
comment Encrypted database: how to deal with general queries?
Please try to stick to one question per question. I see two questions: (a) how does the industry deal with encrypted databases? (b) is there anything that simulates somewhat homomorphic encryption? Question (a) is too broad. Question (b) is not well-defined (what do you mean by "at least simulate somewhat") so probably not suitable for this site in its current form. What research have you done? Have you looked at CryptDB (which has seen some deployment in industry)?
Sep
28
comment Question about second preimage resistance of hash function combiner
I can't understand the question. What does your notation $H^{s_1}(x)$ mean? Does it mean repeatedly applying $H$, $s_1$ times? If so, what does the notation $H^{s_1,s_2}(x)$ mean? What's $s_1$? I suggest editing the question to clarify.
Sep
23
awarded  Taxonomist
Sep
22
comment Forward pseudorandom permutation
The question is unclear. What vectors? Where did those come from? What does it mean to have the same permutation at the server, in both vectors? I can't follow you. Try editing your question. Specify what is known to each party, what the inputs from each party are, and what the desired output to each party is. Also specify the trust model.
Sep
21
awarded  Popular Question
Sep
17
comment Are there cryptographic hash functions with homomorphic properties?
We already have questions here that provide lots of information on this subject. Simply searching on "homomorphic hash" in the search bar at the upper right turned up the following: crypto.stackexchange.com/q/6497/351, crypto.stackexchange.com/q/8074/351, crypto.stackexchange.com/q/12719/351. In the future, you might want to do a bit of research before asking, to help you ask a more informed question.
Sep
17
comment Is appending the hash of the plaintext to the end of an encrypted message sufficient to ensure integrity?
See crypto.stackexchange.com/q/16428/351 and crypto.stackexchange.com/q/9941/351 and security.stackexchange.com/q/13800/971 and crypto.stackexchange.com/q/11440/351, all of which answer your question.
Sep
17
comment On the privacy of perfect hash functions
Do you have a reference? Perfect hash functions in computer science, as normally studied, have nothing to do with cryptography and don't promise to provide any privacy or any other security properties.
Sep
8
revised “Practical” operations supported by functional encryption?
added 75 characters in body
Sep
4
comment Change Salt when Changing Password?
@SteveJessop, I confess I'm not sure if I understand all the details of your scenario. You are aware that you can't start building the rainbow table until you know the salt, and that salts and password hashes are usually not public, right? Are you assuming multiple separate breaches of the password database, and that the user has changed their password in between? That's a pretty rare scenario to target. See my answer for more details.
Sep
4
revised Change Salt when Changing Password?
added 2306 characters in body
Sep
4
comment Change Salt when Changing Password?
@BobBrown, are you assuming the password database is breached twice, at two different points in time? That is very rare.
Sep
4
comment Change Salt when Changing Password?
@otus, I suggest you clarify the attack model. The normal attack model is: at some point in time, the password database is breached. At that point in time, the attacker learns the salt and the password hash at that single point in time. Normally the salts and password hashes are not public and so the attacker cannot observe their values before or after that point in time. So even if the user changes their password many times, the attacker won't get to see more than one password hash -- the password hash at the time when the database was breached. So this doesn't help the attacker.