{"id":13825389,"url":"https://github.com/facebookresearch/asynchronousratchetingtree","last_synced_at":"2025-07-08T21:32:21.857Z","repository":{"id":66082547,"uuid":"114402137","full_name":"facebookresearch/asynchronousratchetingtree","owner":"facebookresearch","description":"On Ends-to-Ends Encryption: Asynchronous Group Messaging with Strong Security Guarantees","archived":true,"fork":false,"pushed_at":"2021-08-31T20:03:51.000Z","size":50,"stargazers_count":263,"open_issues_count":2,"forks_count":36,"subscribers_count":22,"default_branch":"main","last_synced_at":"2024-08-05T09:14:10.563Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/facebookresearch.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null}},"created_at":"2017-12-15T18:56:01.000Z","updated_at":"2024-07-12T04:30:02.000Z","dependencies_parsed_at":"2023-04-22T01:48:31.122Z","dependency_job_id":null,"html_url":"https://github.com/facebookresearch/asynchronousratchetingtree","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/facebookresearch%2Fasynchronousratchetingtree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/facebookresearch%2Fasynchronousratchetingtree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/facebookresearch%2Fasynchronousratchetingtree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/facebookresearch%2Fasynchronousratchetingtree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/facebookresearch","download_url":"https://codeload.github.com/facebookresearch/asynchronousratchetingtree/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225465291,"owners_count":17478518,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-04T09:01:20.016Z","updated_at":"2024-11-20T03:31:12.003Z","avatar_url":"https://github.com/facebookresearch.png","language":"Java","readme":"# Asynchronous Ratcheting Tree\n\nAsynchronous Ratcheting Tree (ART) is a protocol for end-to-end encrypted group\nmessaging. It aims to provide scalable group messaging while maintaining strong\nsecurity guarantees.\n\nThis repository contains the implementation used for the results in\n[our ART paper](https://eprint.iacr.org/2017/666). It contains implementations of\nART and a pairwise Diffie-Hellman based ratcheting protocol which we used for\ncomparison.\n\nThe implementation in this repository is purely academic example code, and should\nnot be used in any production or security-critical system.\n\n## Requirements\n\nAsynchronous Ratcheting Trees requires or works with:\n* Java 1.8.\n* Apache Maven 1.8.\n* Java Cryptography Extension (JCE) Unlimited Strength Jurisdiction Policy Files\n  (http://www.oracle.com/technetwork/java/javase/downloads/jce8-download-2133166.html).\n* Apache Thrift 0.10.0 (just for rebuilding the Thrift definitions).\n\n## Building and executing\nThe Makefile in this directory will compile our source and then run the\nbenchmarks; simply run\n\n\tmake run\n\n## The Team\n\nThe team who worked on the Asynchronous Ratcheting Tree paper are as follows:\n\nFrom Facebook:\n* Jon Millican\n\nFrom Oxford University:\n* Katriel Cohn-Gordon\n* Cas Cremers\n* Luke Garratt\n* Kevin Milner\n\nWe are grateful to our collaborators from Oxford University for the considerable\ntime and expertise that they put in to this paper, and into the formal proofs of\nthe ART protocol.\n\n## Contributing\n\nSee the CONTRIBUTING file for how to help out.\n\n## License\n\nAsynchronous Ratcheting Tree is CC-BY-NC-licensed.\n","funding_links":[],"categories":["Java"],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffacebookresearch%2Fasynchronousratchetingtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffacebookresearch%2Fasynchronousratchetingtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffacebookresearch%2Fasynchronousratchetingtree/lists"}