SCRAPE: scalable randomness attested by public entities
From MaRDI portal
Recommendations
Cites work
- A practical (non-interactive) publicly verifiable secret sharing scheme
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Advances in cryptology -- EUROCRYPT '96. International conference on the theory and application of cryptographic techniques, Saragossa, Spain, May 12-16, 1996. Proceedings
- Backdoors in pseudorandom number generators: possibility and impossibility results
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Dual EC: a standardized back door
- Faster explicit formulas for computing pairings over ordinary curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to share a secret
- scientific article; zbMATH DE number 1418293 (Why is no real title available?)
- scientific article; zbMATH DE number 1424186 (Why is no real title available?)
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Pairing-Friendly Elliptic Curves of Prime Order
- Public Verifiability from Pairings in Secret Sharing Schemes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Publicly auditable secure multi-party computation
- Publicly verifiable secret sharing
- Security proofs for signature schemes
- The Bitcoin Backbone Protocol: Analysis and Applications
- Transaction protection by beacons
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Universally verifiable multiparty computation from threshold homomorphic cryptosystems
Cited in
(30)- Aggregatable distributed key generation
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- RandomBlocks: a transparent, verifiable blockchain-based system for random numbers
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- PAPR: publicly auditable privacy revocation for anonymous credentials
- Public randomness extraction with ephemeral roles and worst-case corruptions
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Divide \& Scale: formalization and roadmap to robust sharding
- Fair delivery of decentralised randomness beacon
- Bicorn: an optimistically efficient distributed randomness beacon
- Unbiasable verifiable random functions
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- Malleability of the blockchain's entropy
- \textsf{OPA}: one-shot private aggregation with single client interaction and its applications to federated learning
- Distributed randomness using weighted VUFs
- Good things come to those who wait. Dishonest-majority coin-flipping requires delay functions
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Arctic: lightweight and stateless threshold Schnorr signatures
- : a unified framework for computational verifiable secret sharing
- Timed secret sharing
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- Improved YOSO randomness generation with worst-case corruptions
- Synchronous distributed key generation without broadcasts
- On round-optimal computational VSS
This page was built for publication: SCRAPE: scalable randomness attested by public entities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487218)
