sdiehl

Bulletproofs are short non-interactive zero-knowledge proofs that require no trusted setup

Arithmetic circuits for zero knowledge proof systems

Double ratchet algorithm for E2E encryption

Finite field and algebraic extension field arithmetic

Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings

Oblivious transfer for multiparty computation

Finite field polynomial arithmetic based on fast Fourier transforms

Concurrent timer