Corpus ID: 195798902

Key Event Receipt Infrastructure (KERI)

@article{Smith2019KeyER,
  title={Key Event Receipt Infrastructure (KERI)},
  author={Samuel M. Smith},
  journal={ArXiv},
  year={2019},
  volume={abs/1907.02143}
}
A decentralized key management infrastructure (DKMI) that uses the design principle of minimally sufficient means is presented. [...] Key Method KERI is designed to support DIDs but its core services are identifier independent (this includes DID method independence). This makes KERI a candidate for a universal portable DKMI.Expand
3 Citations
Self-Sovereign Identity: A Systematic Map and Review
TLDR
This study identified and aggregated evidence from publications to answer four research questions, resulting in a classification scheme used to categorize and review publications, and provides recommendations for future work. Expand
Sovrin: An Identity Metasystem for Self-Sovereign Identity
  • P. Windley
  • Computer Science
  • Frontiers in Blockchain
  • 2021
TLDR
The architecture of an identity metasystem called the Sovrin Network is presented that aims to improve the user experience, increase flexibility, and reduce overall costs while supporting better privacy and security. Expand

References

SHOWING 1-10 OF 46 REFERENCES
A DID for Everything
The decentralized identifer (DID) is a new and open standard type of globally unique identifer that ofers a model for lifetime-scope portable digital identity that does not depend on any centralizedExpand
Self-certifying file system
TLDR
While other file systems need key management to map file names to encryption keys, SFS file names effectively contain public keys, making them self-certifying pathnames, making SFS more versatile than any file system with built-in key management. Expand
Escaping the evils of centralized control with self-certifying pathnames
TLDR
With a simple, self-certifying pathnames, SFS lets users escape the evils of centralized control, a secure, global, decalized file system permitting easy cross-administrative realm collaboration. Expand
Recommendation for Key Management: Part 2 Best Practices for Key Management Organizations
NIST Special Publication (SP) 800-57 provides cryptographic key management guidance. It consists of three parts. Part 1 provides general guidance and best practices for the management ofExpand
Self-Certified Public Keys
TLDR
Self-certified public keys contribute to reduce the amount of storage and computations in public key schemes, while secret keys are still chosen by the user himself and remain unknown to the authority. Expand
Efficient Sparse Merkle Trees - Caching Strategies and Secure (Non-)Membership Proofs
TLDR
This work is the first to provide complete, succinct, and recursive definitions of a sparse Merkle tree and related operations, and shows that these definitions enable efficient space-time trade-offs for different caching strategies, and verifiable audit paths can be generated to prove (non-)membership in practically constant time when using SHA-512/256. Expand
Introduction to Autonomic Concepts Applied to Future Self-Managed Networks
This chapter presents an overview of the autonomic concept as applied to networking and to network management. It highlights the different challenges faced by academia and industry. Despite theExpand
The latest gossip on BFT consensus
TLDR
Tendermint is presented, a new protocol for ordering events in a distributed network under adversarial conditions that modernizes classic academic work on the subject and simplifies the design of the BFT algorithm by relying on a peer-to-peer gossip protocol among nodes. Expand
Certificate Transparency
TLDR
On August 28, 2011, a mis-issued wildcard HTTPS certificate for google.com was used to conduct a man-in-the-middle attack against multiple users in Iran, and DigiNotar was declared bankrupt. Expand
Status Report on the First Round of the NIST Post-Quantum Cryptography Standardization Process
TLDR
The evaluation criteria and selection process is described, based on public feedback and internal review of the first-round candidates, and the 26 candidate algorithms announced on January 30, 2019 for moving forward to the second round of the competition are summarized. Expand
...
1
2
3
4
5
...