- Protocol Team·Last edited by VladSemenov on Dec 1, 2022Linked with GitHub
There is no commentSelect some text and then click Comment, or simply add a comment to this page from below to start a discussion.Read more
VRF
Verifiable random function
Nov 11, 2022VRF & ASM
VRF verifiable random function for random sortitioning medium on algorand ietf draft VRF algorand impl BLS signature for VRF? VRF RFC draft-15 API
Nov 7, 2022Publicly verifiable multi-user public key encryption
Introduction Public key encryption (PKE) is a standard tool used in many protocols with two parties -- sender and receiver. Sender uses receiver's public key to encrypt a secret message and receiver uses her private key to decrypt it. In modern (decentralized) protocols there's a third party -- verifier. Verifier acts as an arbiter, she verifies that both parties (sender and receiver) follow the protocol correctly. When there's a need for privacy a PKE scheme does not offer the verifier to do her job -- to get access to the encrypted message privacy property must be sacrificed. To overcome this issue there's publicly verifiable public key encryption (PVPKE). In such a scheme the sender encrypts a message and proves certain useful properties about it such that the verifier can verify the proof (ie. that the properties do actually hold for the encrypted message without decrypting it) and the receiver can decrypt the message as usual. Some useful properties about encrypted text might include the following: proof of decryptability, ie. that the receiver can indeed decrypt the message (and not claim that she can't, without revealing her private decryption key); proof of correct encryption, ie. that the sender has encrypted a valid message (and not some garbage).
Jun 30, 2022PVSS succinct proofs
How to aggregate PVSS proofs nicely
Feb 3, 2022
HackMD