- Shamir's Secret Sharing Scheme
- Decentralized Sources of Wall-clock Time
- Peer-to-peer Discovery of Key-Service Providers
- Consensus of Key-Service Providers
- Decentralized Storage of Encrypted Content
There will be N
number of active key-service providers discovered by a user in a given time such that 2 < K < (N/2) < M < N
where K
is the number of key-service providers that will be chosen randomly in the time-lock encryption process and M
is the number of the providers that will approve the selection of K
providers.
The user will set the number of total shares as t
s
such that t
s
= K
and the minimum shares as m
s
to encrypt their secret using Shamir's Secret Sharing Scheme.
Decentralized Sources of Wall-clock Time
TODO
Plans:
- Block timestamp from Decentralized Blockchains
- Self-hosted NTP servers
Peer-to-peer Discovery of Key-Service Providers
TODO
Plans:
- IPFS Pub-Sub
- Self-hosted Signaling for WebRTC
- Self-hosted HTTP API
Consensus of Key-Service Providers
TODO
Plans:
- Majority voting counted by the user
- Surprisingly Popular algorithm
Decentralized Storage of Encrypted Content
TODO
Plans:
- IPFS
- Arweave
- Self-hosted