-
Divide the data into `n` chunks, any `k` of which are able to recover the information (but with fewer than `k` shares, no information on the original data can be discerned). An example is Shamir's sec…
-
I was wondering if you'd be open to modifying the license from GPLv3. I'd like to re-implement this as a lib so that others can use it but I'd be leery of copying the GPLv3 code into another crate.
-
A full Fiat-Shamir transcript primitive is missing for native and corresponding circuit use cases. At the moment, we only have the `RO` trait which is essentially just a 1-round transcript.
We wan…
-
say i want to make a password for a system you will control, but we both need access to
maybe i can have my program generate part of it; you're program generate part, then combine them both on our …
silky updated
6 years ago
-
-
The message header format defines the primary artifact that OnEncrypt produced as "Encrypted Data Keys". Not all encryption schemes will need to literally create only multiple encrypted copies of the …
-
后端大部分 PUT 请求改为 PATCH 对应 path+/_modify,其余直接增加对应的 PATCH 方法
treehole_next 中:
- PUT /holes/:id == PATCH /holes/:id/_modify
- PUT /users/:id == PATCH /users/:id/_modify
- PUT /divisions/:id == PAT…
-
cocert combine -f cocert0.key -f cocert1.key -o combine.key
Loading PEMs from files...
(Press Enter to continue without decrypt...)
Enter your password for cocert0.key:
Enter your password for coc…
-
-
Hey @cryptoquick really cool repo!
I read in the intro readme:
> it can be uploaded to a remote peer, and random 1KB slices of that data can be periodically checked against a local hash to verif…