Bicorn: an optimistically efficient distributed randomness beacon
From MaRDI portal
Recommendations
Cites work
- A survey on IQ cryptography
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Coin flipping by telephone a protocol for solving impossible problems
- Compact multi-signatures for smaller blockchains
- Efficient range proofs with transparent setup from bounded integer commitments
- Efficient verifiable delay functions
- Extractors and pseudorandom generators
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1394308 (Why is no real title available?)
- scientific article; zbMATH DE number 1418293 (Why is no real title available?)
- Modeling Bitcoin contracts by timed automata
- On the Evaluation of Powers and Monomials
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- SCRAPE: scalable randomness attested by public entities
- Simple verifiable delay functions
- The algebraic group model and its applications
- The RSA Group is Pseudo-Free
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Verifiable delay functions
Cited in
(3)
This page was built for publication: Bicorn: an optimistically efficient distributed randomness beacon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6573968)