MUSEN: aggregatable key-evolving verifiable random functions and applications
From MaRDI portal
Recommendations
- A composable security treatment of ECVRF and batch verifications
- A verifiable random function with short proofs and keys
- The price of verifiability: lower bounds for verifiable random functions
- Constrained verifiable random functions
- Efficient construction of (distributed) verifiable random functions
Cites work
- A composable security treatment of ECVRF and batch verifications
- A forward-secure digital signature scheme
- A new forward-secure digital signature scheme
- Aggregate and verifiably encrypted signatures from bilinear maps
- Algorand: a secure and efficient distributed ledger
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Forward-secure signatures with optimal signing and verifying
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Short signatures from the Weil pairing
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
This page was built for publication: MUSEN: aggregatable key-evolving verifiable random functions and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660558)