DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2014 · 1.2K citations · 8 references
ComputingComputer ScienceComputer SystemsData StructuresDistributed SystemsStorage SystemsBlock StorageContent-addressable StorageDistributed StorageDistributed Storage SystemsFile SystemsPeer-to-peer SystemsContent-addressable File SystemsData Structure GeneralizationDistributed Block StorageDistributed File System ArchitectureFile System ArchitecturePeer-to-peer StorageVersioned Storage
A certification system is responsible for issuing digital credentials, which attest claims about a subject, e.g., an academic diploma. Such credentials are valuable for individuals and society, and widespread adoption requires a trusted certification system. Trust can be gained by being transparent when issuing and verifying digital credentials. However, there is a fundamental tradeoff between privacy and transparency. For instance, admitting a student to an academic program must preserve the student’s privacy, i.e., the student’s grades must not be revealed to unauthorized parties. At the same time, other applicants may demand transparency to ensure fairness in the admission process. Thus, building a certification system with the right balance between privacy and transparency is challenging. This paper proposes a novel design for a certification system that provides sufficient transparency and preserves privacy through selective disclosure of claims such that authorized parties can verify them. Moreover, unauthorized parties can also verify the correctness of the certification process without compromising privacy. We achieve this using an incremental Merkle tree of cryptographic commitments to users' credentials. The commitments are added to the tree based on verifying zero-knowledge issuance proofs. Users store credentials off-chain and can prove the ownership and authenticity of credentials without revealing their commitments. Further, our approach enables users to prove statements about the credential’s claims in zero-knowledge. Our design offers a cost-efficient solution, reducing the amount of linkable on-chain data by up to 79% per credential compared to prior work, while maintaining transparency.
8
Incentives Build Robustness in Bit-Torrent
Bram Cohen · 2003 · 2.7K citations
John Kubiatowicz, David Bindel, Yan Chen et al. · ACM SIGPLAN Notices · 2000 · 2K citations · Full text
Scale and performance in a distributed file system
John H. Howard, Michael L. Kazar, Sherri G. Menees et al. · ACM Transactions on Computer Systems · 1988 · 1.4K citations
Democratizing content publication with coral
Michael J. Freedman, Eric Freudenthal, David Mazières · 2004 · 476 citations
Dave Levin, Katrina LaCurts, Neil Spring et al. · ACM SIGCOMM Computer Communication Review · 2008 · 174 citations