Subprojects
Cryptographic protocols
- The metadata problem
- Secret Bonding
- Secret Rendez-vous
- How to discover your friends on the network (using phone numbers for exemples) without giving away your friendlist.
Part1: Associate your phone number, email address or other identification mean with a public key. This could be done using web-of-trust. (This is a topic on its own)
Part2: Compute a kind of "secret rendez-vous point" (H(K_a^k_b) == H(K_b^k_a)) from your public key (eg: associated with your phone number) with all your friends "phone-numbers" public key and publish it
Part3: Finding a published token linking our phone number to someone's else means that our this is indeed our friend's public key
[It is true indeed that after Part1, we don't need Part2 and Part3 because we already know our friends public keys]
Misc
- Hash payement. Where customers pays but the company makes no money. Could be a PoW difficulty target for different hash difficulty (cpu,gpu,memory,proof of space-time?) or even useful work like folding proteins or finding primes. The organisator or DOA sets the difficulty target. Could be used for - Requesting ressource - Sending message (ex: Bitmessage) - DDNS name registration - Tokenless blockchain
- A company or system for quickly building a web-of-trust. for exemple associating a pubkey to a phone number. You could get tokens or money to verify someone's else number