Distributed computability in Byzantine asynchronous systems
From MaRDI portal
Publication:5259606
DOI10.1145/2591796.2591853zbMath1315.68020arXiv1302.6224OpenAlexW2016408245MaRDI QIDQ5259606
Hammurabi Mendes, Christine Tasson, Maurice P. Herlihy
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.6224
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
From wait-free to arbitrary concurrent solo executions in colorless distributed computing, A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems, Invited paper: Cross-chain state machine replication, On the Validity of Consensus, Wait-free solvability of colorless tasks in anonymous shared-memory model, Wait-free approximate agreement on graphs, A topological perspective on distributed network algorithms, Wait-free approximate agreement on graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient algorithms for privately releasing marginals via convex relaxations
- The Geometry of Differential Privacy: The Small Database and Approximate Cases
- Faster Algorithms for Privately Releasing Marginals
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately Releasing Conjunctions and the Statistical Query Barrier
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Characterizing the sample complexity of private learners
- Faster private release of marginals on small databases
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Collusion-secure fingerprinting for digital data
- On the complexity of differentially private data release
- Advances in Cryptology – CRYPTO 2004
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Theory of Cryptography
