2,360 research outputs found
Computability in the lattice of equivalence relations
We investigate computability in the lattice of equivalence relations on the
natural numbers. We mostly investigate whether the subsets of appropriately
defined subrecursive equivalence relations -for example the set of all
polynomial-time decidable equivalence relations- form sublattices of the
lattice.Comment: In Proceedings DICE-FOPARA 2017, arXiv:1704.0516
Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments
Decentralized systems are a subset of distributed systems where multiple
authorities control different components and no authority is fully trusted by
all. This implies that any component in a decentralized system is potentially
adversarial. We revise fifteen years of research on decentralization and
privacy, and provide an overview of key systems, as well as key insights for
designers of future systems. We show that decentralized designs can enhance
privacy, integrity, and availability but also require careful trade-offs in
terms of system complexity, properties provided, and degree of
decentralization. These trade-offs need to be understood and navigated by
designers. We argue that a combination of insights from cryptography,
distributed systems, and mechanism design, aligned with the development of
adequate incentives, are necessary to build scalable and successful
privacy-preserving decentralized systems
- …