Interactive Oracle Proofs of Proximity (IOPP)
tl;dr: A relaxation of IOPs that is central to hash-based proof systems like FRI, STIR[^ACFY24eSTIR] and WHIR.
Error-correcting codes
tl;dr: Too many FRI[^BBHR18FRI] conjectures that need to be understood, so here we are…
Pedersen commitments
tl;dr: Pedersen commitments[^Pede91Comm] are one of the most important cryptographic primitives for a beginner to understand, in my opinion.
Zero-knowledge proofs for Aptos Keyless
tl;dr: Notes on our current use of Groth16 for Aptos Keyless and how we might improve upon it.
Should have applications to anonymous payments, confidential assets, zkVM proof wrapping etc.
Papamanthou-Shi-Tamassia (PST) multivariate polynomial commitments
tl;dr: The 1st multivariate polynomial commitment scheme based on a non-trivial generalization of KZG.
Cryptography on Aptos
tl;dr: (Almost?) all of the cryptography deployed on Aptos. For users, for developers and for general security.
DeKART: ZK range proofs from univariate polynomials
tl;dr: We fix up our previous non-ZK, univariate DeKART scheme and also speed up its verifier by trading off prover time.
This is joint work with Dan Boneh, Trisha Datta, Kamilla Nazirkhanova and Rex Fernando.
88 post articles, 11 pages.