ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
From MaRDI portal
Publication:2691589
DOI10.1007/978-3-030-64840-4_11OpenAlexW3037463635MaRDI QIDQ2691589
Bernardo David, Ignacio Cascudo
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_11
Cryptography (94A60) Numerical methods for discrete and fast Fourier transforms (65T50) Authentication, digital signatures and secret sharing (94A62)
Related Items (9)
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Efficient and universally composable single secret leader election from pairings ⋮ 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 ⋮ FAST: fair auctions via secret transactions
Uses Software
Cites Work
- Unnamed Item
- Transaction protection by beacons
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Verifiable delay functions
- Bitcoin as a transaction ledger: a composable treatment
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Efficient UC commitment extension with homomorphism for free (and applications)
- Algorand: a secure and efficient distributed ledger
- Security Proofs for Signature Schemes
- The Bitcoin Backbone Protocol: Analysis and Applications
- Security of Ramp Schemes
- How to share a secret
- A Framework for Practical Universally Composable Zero-Knowledge Protocols
- Number-theoretic constructions of efficient pseudo-random functions
- Public Verifiability from Pairings in Secret Sharing Schemes
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- An Algorithm for the Machine Calculation of Complex Fourier Series
This page was built for publication: ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
