Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS

    This paper introduces a SNARK called Brakedown. Brakedown targets R1CS, a popular NP-complete problem that generalizes circuit-satisfiability. It is the first built system that provides a linear-time prover, mean...

    Alexander Golovnev, Jonathan Lee, Srinath Setty in Advances in Cryptology – CRYPTO 2023 (2023)

  2. Chapter and Conference Paper

    Bounded Verification for Finite-Field-Blasting

    Zero Knowledge Proofs (ZKPs) are cryptographic protocols by which a prover convinces a verifier of the truth of a statement without revealing any other information. Typically, statements are expressed in a hig...

    Alex Ozdemir, Riad S. Wahby, Fraser Brown, Clark Barrett in Computer Aided Verification (2023)

  3. No Access

    Chapter and Conference Paper

    An Airdrop that Preserves Recipient Privacy

    A common approach to bootstrap** a new cryptocurrency is an airdrop, an arrangement in which existing users give away currency to entice new users to join. But current airdrops offer no recipient privacy: they ...

    Riad S. Wahby, Dan Boneh, Christopher Jeffrey in Financial Cryptography and Data Security (2020)