Commit message (Collapse) | Author | Age | |
---|---|---|---|
* | use less expensive hash for proof of work | Joey Hess | 2016-09-13 |
| | | | | | | | | | | | | | | The server has to run the hash once to verify a request, so a hash that took 4 seconds could make the server do too much work if it's being flooded with requests. So, made the hash much less expensive. This required keeping track of fractional seconds. Actually, I used Rational for them, to avoid most rounding problems. That turned out nice. I've only tuned the proofOfWorkHashTunable on my fanless overheating laptop so far. It seems to be fairly reasonablly tuned though. | ||
* | Added basic test suite. | Joey Hess | 2016-08-30 |
| | |||
* | return ProofOfWorkRequirement t | Joey Hess | 2016-08-22 |
| | | | | This way the requirement can be varied for different operations. | ||
* | chunking | Joey Hess | 2016-08-19 |
| | | | | | This changed the storage format, not that it matters because nobody is using it yet. | ||
* | rename shard -> share | Joey Hess | 2016-08-19 |
| | | | | This makes it clearer that it's not a chunk of data, but a Shamir share. | ||
* | 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. | ||
* | obscure name | Joey Hess | 2016-08-17 |
| | |||
* | progress display for storing | Joey Hess | 2016-08-17 |
| | |||
* | add progress bars to restore | Joey Hess | 2016-08-17 |
| | | | | also, restore actually works! | ||
* | more command line interface improvements | Joey Hess | 2016-08-16 |
| | |||
* | improve options to select secret key to backup/restore | Joey Hess | 2016-08-16 |
| | |||
* | add --benchmark | Joey Hess | 2016-08-16 |
| | |||
* | use zxcvbn-c for fairly good password entropy estimation | Joey Hess | 2016-08-16 |
| | | | | | This should be good enough to let the keysafe UI comment on how good a password the user chooses. | ||
* | pluggable object storage layer | Joey Hess | 2016-08-11 |
| | |||
* | Shard data type | Joey Hess | 2016-08-11 |
| | |||
* | partial demo | 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 |
| | |||
* | serialization for tunings | Joey Hess | 2016-08-07 |
| | |||
* | reorg, and working on serialization | Joey Hess | 2016-08-07 |
| | |||
* | sharding | Joey Hess | 2016-08-07 |
| | |||
* | basic password entropy calculation | 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 |