Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | fix ordering bug in chunk | Joey Hess | 2016-08-19 |
| | |||
* | reorg | Joey Hess | 2016-08-19 |
| | |||
* | chunking | Joey Hess | 2016-08-19 |
| | | | | | This changed the storage format, not that it matters because nobody is using it yet. | ||
* | comment updates | Joey Hess | 2016-08-19 |
| | | | | | | The keyid used as a salt in the shardIdents does not prevent rainbow table attacks, since it's often anyKey (""). The obscure name combined with the username does make rainbow tables unlikely to be useful though. | ||
* | use name, not password as IV | Joey Hess | 2016-08-18 |
| | | | | | | | | | | It was probably ok to use the password, but it's certianly ok to use the name: * The name must be known if the shards have been reassembled to get to the point of decrypting the sharded data. * The name is unique, while a user might reuse a password for eg, storing different versions of the same key. | ||
* | add progress bars to restore | Joey Hess | 2016-08-17 |
| | | | | also, restore actually works! | ||
* | switch to random salt byte to make decryption expensive | Joey Hess | 2016-08-16 |
| | |||
* | add checksum to encrypted data | Joey Hess | 2016-08-12 |
| | | | | Needed to verify decryption puzzles | ||
* | zero-pad size of padded bytes | Joey Hess | 2016-08-11 |
| | |||
* | don't use IV as puzzle after all | Joey Hess | 2016-08-11 |
| | | | | | | | | Not a good idea to use IV, because all the parts of the IV that are 0 will not obscure the data in the first block at all. Instead, sha256 the password to generate the IV, and keep the puzzle as part of the key. | ||
* | guessing puzzle answers | Joey Hess | 2016-08-11 |
| | |||
* | round-tripping now working, except for guessing the puzzle | Joey Hess | 2016-08-11 |
| | |||
* | simplify by using the IV as the puzzle | Joey Hess | 2016-08-11 |
| | |||
* | inline slightly modified version of secret-sharing | Joey Hess | 2016-08-11 |
| | | | | | Needed for efficient serialization of shares, unless upstream takes my suggestion to make the finite field be size 256. | ||
* | nearly able to generate shards now | Joey Hess | 2016-08-11 |
| | |||
* | types for new version storage scheme | Joey Hess | 2016-08-10 |
| | |||
* | reorg, and working on serialization | Joey Hess | 2016-08-07 |
| | |||
* | add names | Joey Hess | 2016-08-07 |
| | |||
* | finish AES decryption puzzle implementation | Joey Hess | 2016-08-07 |
| | |||
* | improve types | Joey Hess | 2016-08-07 |
| | |||
* | more cost calculation and refactored Tunables | Joey Hess | 2016-08-06 |
| | |||
* | some basic data types and expensive hashing | Joey Hess | 2016-08-06 |