Using hash functions and asymmetric cryptography for one-time keys on public ledgers
With one-time keys that authenticate each transaction, a proof-of-public-key could commit the next public-private key pair, and be recorded on-state with a one-way hash function, for example sha3(f(nextPublicKey)), signed with the public-private key pair that will be used for the next transaction. To authenticate that next one-time key, the signature f(nextPublicKey) is revealed to the miners, who verify it against the one-way hash, and a transactionSignature signed using the one-time public-private key pair then authenticates the transaction.
The hash sha3(f(nextPublicKey)) could then be signed with the current public-private key pair, and committed on-state as proof-of-public-key = f1(sha3(f2(nextPublicKey)), where f1() is a signature with the current key pair, and f2() with the next key pair. The transactions then include the signature f2(nextPublicKey) that is used to authenticate the public-private key pair, a transactionSignature with an asymmetric signature for the transaction that the public key can also be derived from, and a new proof-of-public-key = f1(sha3(f2(nextPublicKey)).
Great to see the in-depth derails on it thanks for sharing
nice post i like your post to much @johan-nygren thanks for sharing post.
Wonderful analysis. Your deep analysis of hash functions and asymmetric cryptography was really great. . Great post dear @johan-nygren
Great post,,,,
i liked..........thanks for sharing............/////////////
wonderful post the proof of key is something very interesting concept
Well thanks for the update buddy !