Timeline for Is there a format preserving cryptographically secure hash?
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2015 at 14:01 | vote | accept | erotavlas | ||
| Mar 12, 2015 at 21:24 | history | tweeted | twitter.com/#!/StackCrypto/status/576131612255064064 | ||
| Mar 6, 2015 at 15:32 | answer | added | tylo | timeline score: 8 | |
| Mar 6, 2015 at 14:15 | history | edited | erotavlas | CC BY-SA 3.0 |
added 239 characters in body
|
| Mar 6, 2015 at 14:15 | comment | added | cpast | @sashank The only issue is that that isn't reproducible -- a hash always produced the same output on the same input, but if you're using a cipher, you'd have to keep the key to do that. | |
| Mar 6, 2015 at 13:38 | history | edited | erotavlas | CC BY-SA 3.0 |
added 386 characters in body
|
| Mar 6, 2015 at 13:31 | history | edited | erotavlas | CC BY-SA 3.0 |
added 386 characters in body
|
| Mar 6, 2015 at 11:38 | comment | added | Maarten Bodewes♦ | I think it is required to fully state your requirements for this "encryption". Encryption is about confidentiality, a hash is about creating a 1:1 relation with a statically sized value. Maybe you could state them separately below the question? | |
| Mar 6, 2015 at 11:14 | comment | added | fgrieu♦ | @sashank: If $P\to C=E_K(P)$ is a block cipher of 128-bit block size and key size assimilated to a random oracle implementing a random permutation for each $K$ (e.g. AES-128), then $P\to H(P)=E_P(P)$ is a plausible 128-bit hash that preserves the length of the original string. I'm reading Ricky Demer's comment as using something on that tune. | |
| Mar 6, 2015 at 9:26 | comment | added | sashank | If hash preserves the length of the original string then it is just a permutation (like block cipher). Use a FPE algorithm to encrypt the input and throw the key, consider the ciphertext as your hash ! | |
| Mar 6, 2015 at 5:55 | comment | added | user991 | 1&2 is easy. $\:$ Rank-then-hash-then-unrank can plausibly do 1&2&3 against uniform adversaries. | |
| Mar 6, 2015 at 4:18 | history | edited | erotavlas |
edited tags
|
|
| Mar 6, 2015 at 2:52 | history | edited | erotavlas |
edited tags
|
|
| Mar 6, 2015 at 2:32 | history | edited | erotavlas | CC BY-SA 3.0 |
deleted 75 characters in body
|
| Mar 6, 2015 at 2:23 | history | edited | erotavlas | CC BY-SA 3.0 |
edited tags; edited title
|
| Mar 6, 2015 at 2:18 | history | edited | erotavlas | CC BY-SA 3.0 |
edited tags; edited title
|
| Mar 6, 2015 at 2:15 | history | undeleted | erotavlas | ||
| Mar 6, 2015 at 2:15 | history | deleted | erotavlas | via Vote | |
| Mar 6, 2015 at 2:10 | history | asked | erotavlas | CC BY-SA 3.0 |