QED Logo
latest

The Project

  • Overview
    • What’s QED
    • Why
    • How
  • Quick start
    • 1. Environment set up
    • 2. Adding events.
    • 3. Proof of event insertion.
      • 3.1 Querying proof.
      • 3.2 Getting snapshots from the snapshot store.
      • 3.3 Verifying proof (manually).
      • 3.4 Auto-verifying proofs.
    • 4. Incremental proof between 2 events.
      • 4.1 Querying proof.
      • 4.2 Getting snapshots from the snapshot store.
      • 4.3 Verifying proofs (manually).
      • 4.4 Auto-verifying proofs.
  • Trust Model
    • Description
    • Simple scenario
  • Frequently Asked Questions
    • 1. Why would anyone want to verify other’s activities?
    • 2. What is considered a user in QED?
    • 3. Can QED ensure an event is legit?
    • 4. But how can QED help me to achieve that guarantees?
      • 4.1 And with only those two proofs, can we achieve all those functionalities?
    • 5. How is QED different from digital signatures or blockchain?
    • 6. Is it secure?
    • 7. Will QED alert me from changes or tampering attempts?
    • 8. Is QED a data store? Can I save my data into QED to secure it?

Use Cases

  • Commit certification
    • Theory and operation
      • First step: source committing
      • Second step: artifact building
      • Third step: uploading artifact
      • Fourth step: artifact deployment
    • Working example
      • Adding transparency to a GIT repository
      • Adding transparency to the artifacts repository
  • Certification of Documents, Emails, Agreements, etc.
    • Theory and Operation
    • Working example
  • Lie Detector for Tweeter feeds
    • Theory and Operation
    • Working example

Internals

  • Architecture and components
  • How does it works (long version)
  • Security Model
  • Glossary
    • Cryptographic primitives
      • Hash functions
    • Digital signatures
    • Tree-based data structures
      • Binary tree
      • Perfect binary tree
      • Full binary tree
      • Complete binary tree
    • Merkle tree
      • Membership proof
      • Merkle audit path
    • History tree
      • Persistent nature
      • Incremental proof
    • Binary search tree
    • Heap
    • Treap
    • Hash treap
    • Sparse Merkle tree

Advanced usage

  • Cluster mode
    • 1. Environment set up
    • 2. Checking cluster information.
    • 3. Adding events.
    • 4. Querying membership proof.
    • 5. Shutting down a server
    • 6. Repeat steps 2-4 several times.
  • Backup and Restore
    • Backup
      • 1. Environment set up
      • 2. Adding events.
      • 3. Creating backups.
      • 4. Listing backups.
      • 5. Repeat steps 2-4 several times.
      • 6. Deleting backups.
    • Restore
      • 1. Environment set up.
      • 2. Restore process.
      • 3. Check event membersip.

Contributing

  • Contributing
  • Pull requests

References

  • Github related projects
  • Related papers
QED
  • Docs »
  • Github related projects
  • Edit on GitHub

Github related projects¶

  • Balloon
  • GoSMT
  • Trillian
  • Continusec

Related papers¶

  • https://github.com/google/trillian/blob/master/docs/VerifiableDataStructures.pdf
  • http://tamperevident.cs.rice.edu/papers/paper-treehist.pdf
  • http://kau.diva-portal.org/smash/get/diva2:936353/FULLTEXT01.pdf
  • http://www.links.org/files/sunlight.html
  • http://www.links.org/files/RevocationTransparency.pdf
  • https://eprint.iacr.org/2015/007.pdf
  • https://eprint.iacr.org/2016/683.pdf
Previous

© Copyright 2019, BBVA-Labs Team Revision dc74bcf1.

Built with Sphinx using a theme provided by Read the Docs.
Read the Docs v: latest
Versions
latest
stable
Downloads
pdf
html
epub
On Read the Docs
Project Home
Builds
Free document hosting provided by Read the Docs.