Notes

Reaching approximate agreement in the presence of faults
0000-00-00 literature notes
Bounds on information exchange for Byzantine agreement
0000-00-00 literature notes
Streaming and~Unbalanced PSI from~Function Secret Sharing
0000-00-00 literature notes
Perfect MPC over Layered Graphs
0000-00-00 literature notes
Distributed Randomness using Weighted VRFs
0000-00-00 literature notes
Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus
0000-00-00 literature notes
On the Limits of Distributed Quantum Computing
0000-00-00 literature notes
Upright Cluster Services
0000-00-00 literature notes
Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults
0000-00-00 literature notes
Private Matching for Compute
0000-00-00 literature notes
The Latest Gossip on BFT Consensus
0000-00-00 literature notes
Asynchronous Byzantine Agreement Protocols
0000-00-00 literature notes
OptRand: Optimistically responsive distributed random beacons
0000-00-00 literature notes
EESMR: Energy Efficient BFT-SMR for the Masses
0000-00-00 literature notes
Another advantage of free choice (Extended Abstract)
0000-00-00 literature notes
A Study of Replacement Algorithms for a Virtual-Storage Computer
0000-00-00 literature notes
Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity
0000-00-00 literature notes
Updatable Private Set Intersection
0000-00-00 literature notes
Computational Verifiable Secret Sharing Revisited
0000-00-00 literature notes
Blitz: Secure Multi-Hop Payments Without Two-Phase Commits
0000-00-00 literature notes
Byzantine Reliable Broadcast with One Trusted Monotonic Counter
0000-00-00 literature notes
Optimal Resilience Asynchronous Approximate Agreement
0000-00-00 literature notes
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security
0000-00-00 literature notes