George Danezis's Projects
Experiments with authenticated data structures
A js graph that illustrates the relations between a number of authors and venues. Powered by DBLP, d3, fisheye and requests.
Binary Count Sketch for Set Difference
Extracting consensus from a block DAG
A bilinear pairing library for petlib
Coconut: Threshold Issuance Selective Disclosure Credentials with Applications to Distributed Ledgers.
A model of COVID Prevalence based on public data
A mock, single threaded cspace implemnetation
A web app for ranking computer science departments according to their research output in selective venues, and for finding active faculty across a wide range of areas.
A repository of teaching material for the ENGS102P Computer Science course.
An implementation of the DWORK, LYNCH & STOCKMEYER partial synchronous consensus protocol.
FastPay: High-Performance Byzantine Fault Tolerant Settlement
Two efficient Private genetic dosage & susceptibility testing protocols
Libraโs mission is to enable a simple global payment system and financial infrastructure that empowers billions of people.
Libra Improvement Proposals
An anonymous messaging systems that runs loops around traffic analysis.
Home of the Move programming language
Narwhal and Tusk: A DAG-based Mempool and Efficient BFT Consensus.
Nym provides strong network-level privacy against sophisticated end-to-end attackers, and anonymous transactions using blinded, re-randomizable, decentralized credentials.
Reference code for Off-chain Dynamic Subaddress Proposals
An off-chain reference implementation: Supports exchanging payment information, KYC data and attestation of KYC data between VASPs.
TLS/SSL and crypto library
PANORAMIX repo
Exercises in Privacy Enhancing Technologies (UCL Information Security MSc; Course COMPGA17)
A python library that implements a number of Privacy Enhancing Technolgies
Experiments with pBFT
A pure Python / Numpy implementation of Information-Theoretic Private Information Retrieval (IT-PIR)
The RAIL project
A project using the UK REF data sets to collaborativelly re-rank the publishing venues in Computer Science
An hash-chain with efficient O(1) append and O(logN) proof.