Timeline for Using encryption schemes for identification
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 3, 2013 at 15:18 | comment | added | juaninf | Merkle signature is mature and is postquantum ... | |
| Mar 31, 2013 at 12:41 | comment | added | exa | And comments: FMTSeq and similar hashes have support for unlimited signature numbers, but that either brings key schedule problems or makes the signatures terribly big (2^256-ops secure FMTSeq has 10KiB for one signature, for around 1M signature limit...) | |
| Mar 31, 2013 at 12:39 | comment | added | exa | Thanks, these two ideas seem to capture where I needed to get pushed :) Thanks for CCA1 mention, I already have CCA2-resistant scheme (Fujisaki-Okamoto padded McEliece) so I guess that would work. | |
| Mar 31, 2013 at 12:39 | vote | accept | exa | ||
| Mar 31, 2013 at 5:57 | history | edited | user991 | CC BY-SA 3.0 |
corrected middle paragraph
|
| Mar 31, 2013 at 4:29 | comment | added | user991 | Huh. $\:$ I'm pretty sure there's a paper on that, but I can't find it. $\:$ The idea is building a tree of ordinary $\hspace{.2 in}$ trees and having the signatures be a branch with the choices at each node (of the ordinary trees) $\hspace{.4 in}$ given by the message's hash, and using a pseudo-random function for all of the randomness to $\hspace{.4 in}$ make the signing algorithm (deterministic and) stateless. $\;\;$ | |
| Mar 31, 2013 at 3:23 | comment | added | imichaelmiers | whats this about fractal trees and hash based signatures ? | |
| Mar 31, 2013 at 1:34 | history | edited | user991 | CC BY-SA 3.0 |
clarified security requirement
|
| Mar 30, 2013 at 21:17 | history | answered | user991 | CC BY-SA 3.0 |