https://github.com/facebookresearch/asynchronousratchetingtree

On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees
https://github.com/facebookresearch/asynchronousratchetingtree

Last synced: 3 months ago
JSON representation

On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees

• Host: GitHub
• URL: https://github.com/facebookresearch/asynchronousratchetingtree
• Owner: facebookresearch
• License: other
• Archived: true
• Created: 2017-12-15T18:56:01.000Z (almost 7 years ago)
• Default Branch: main
• Last Pushed: 2021-08-31T20:03:51.000Z (about 3 years ago)
• Last Synced: 2024-07-18T05:35:55.261Z (4 months ago)
• Language: Java
• Size: 48.8 KB
• Stars: 263
• Watchers: 22
• Forks: 36
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING.md
  • License: LICENSE
  • Code of conduct: CODE_OF_CONDUCT.md

Awesome Lists containing this project

README

        
# Asynchronous Ratcheting Tree

Asynchronous Ratcheting Tree (ART) is a protocol for end-to-end encrypted group

messaging. It aims to provide scalable group messaging while maintaining strong

security guarantees.

This repository contains the implementation used for the results in

[our ART paper](https://eprint.iacr.org/2017/666). It contains implementations of

ART and a pairwise Diffie-Hellman based ratcheting protocol which we used for

comparison.

The implementation in this repository is purely academic example code, and should

not be used in any production or security-critical system.

## Requirements

Asynchronous Ratcheting Trees requires or works with:

* Java 1.8.

* Apache Maven 1.8.

* Java Cryptography Extension (JCE) Unlimited Strength Jurisdiction Policy Files

  (http://www.oracle.com/technetwork/java/javase/downloads/jce8-download-2133166.html).

* Apache Thrift 0.10.0 (just for rebuilding the Thrift definitions).

## Building and executing

The Makefile in this directory will compile our source and then run the

benchmarks; simply run

	make run

## The Team

The team who worked on the Asynchronous Ratcheting Tree paper are as follows:

From Facebook:

* Jon Millican

From Oxford University:

* Katriel Cohn-Gordon

* Cas Cremers

* Luke Garratt

* Kevin Milner

We are grateful to our collaborators from Oxford University for the considerable

time and expertise that they put in to this paper, and into the formal proofs of

the ART protocol.

## Contributing

See the CONTRIBUTING file for how to help out.

## License

Asynchronous Ratcheting Tree is CC-BY-NC-licensed.