Swiper: a new paradigm for efficient weighted distributed protocols
From MaRDI portal
Cites work
- Adaptively Secure Single Secret Leader Election from DDH
- All You Need is DAG
- Asymptotically Optimal Validated Asynchronous Byzantine Agreement
- Asynchronous consensus and broadcast protocols
- Efficient and universally composable single secret leader election from pairings
- Efficient dispersal of information for security, load balancing, and fault tolerance
- Fast asynchronous Byzantine agreement with optimal resilience
- HotStuff
- How to share a secret
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- scientific article; zbMATH DE number 3967876 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1023994 (Why is no real title available?)
- scientific article; zbMATH DE number 1559572 (Why is no real title available?)
- scientific article; zbMATH DE number 1848309 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Improved extension protocols for Byzantine broadcast and agreement
- Introduction to Reliable and Secure Distributed Programming
- Monotone circuits for monotone weighted threshold functions
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- Practical threshold signatures
- Random oracles in constantipole
- Reaching consensus for asynchronous distributed key generation
- The Load, Capacity, and Availability of Quorum Systems
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Verifying distributed erasure-coded data
Cited in
(1)
This page was built for publication: Swiper: a new paradigm for efficient weighted distributed protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971943)
