Fiat-Shamir security of FRI and related snarks
We establish new results on the Fiat-Shamir (FS) security of several protocols that are widely
used in practice, and we provide general tools for establishing similar results for others …
used in practice, and we provide general tools for establishing similar results for others …
Constant-size zk-SNARKs in ROM from falsifiable assumptions
We prove that the seminal KZG polynomial commitment scheme (PCS) is black-box
extractable under a simple falsifiable assumption ARSDH. To create an interactive …
extractable under a simple falsifiable assumption ARSDH. To create an interactive …
Revisiting the nova proof system on a cycle of curves
Nova is an efficient recursive proof system built from an elegant folding scheme for (relaxed)
R1CS statements. The original Nova paper (CRYPTO'22) presented Nova using a single …
R1CS statements. The original Nova paper (CRYPTO'22) presented Nova using a single …
Not-So-Low Hanging Fruit: Security and Privacy Research Opportunities for IETF Protocols
CA Wood - Proceedings of the Applied Networking Research …, 2023 - dl.acm.org
The IETF is actively developing technical specifications for state-of-the-art cryptographic
protocols that aim to improve user privacy in the areas of privacy-preserving measurement …
protocols that aim to improve user privacy in the areas of privacy-preserving measurement …
Muxproofs: Succinct arguments for machine computation from tuple lookups
Proofs for machine computation allow for proving the correct execution of arbitrary programs
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
that operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …
Generic Security of the SAFE API and Its Applications
We provide security foundations for SAFE, a recently introduced API framework for sponge-
based hash functions tailored to prime-field-based protocols. SAFE aims to provide a robust …
based hash functions tailored to prime-field-based protocols. SAFE aims to provide a robust …
Zero-knowledge proof vulnerability analysis and security auditing
X Tang, L Shi, X Wang, K Charbonnet… - Cryptology ePrint …, 2024 - eprint.iacr.org
Abstract Zero-Knowledge Proof (ZKP) technology marks a revolutionary advancement in the
field of cryptography, enabling the verification of certain information ownership without …
field of cryptography, enabling the verification of certain information ownership without …
Cdls: Proving knowledge of committed discrete logarithms with soundness
The works of CRYPTO'18 and SAC'21 exist in the Σ-protocol setting in order to prove
knowledge that a commitment to a scalar is the discrete logarithm of the commitment to an …
knowledge that a commitment to a scalar is the discrete logarithm of the commitment to an …
Shaken, not Stirred-Automated Discovery of Subtle Attacks on Protocols using Mix-Nets
J Dreier, P Lafourcade, D Mahmoud - Usenix Security Symposium, 2024 - uca.hal.science
Mix-Nets are used to provide anonymity by passing a list of inputs through a collection of mix
servers. Each server mixes the entries to create a new anonymized list, so that the …
servers. Each server mixes the entries to create a new anonymized list, so that the …
[图书][B] Improving the Privacy Scalability and Ecological Impact of Blockchains
B Buenz - 2023 - search.proquest.com
Despite the excitement around them, Blockchains today still suffer from major limitations.
Popular blockchains have high transaction fees, limited privacy, and substantial ecological …
Popular blockchains have high transaction fees, limited privacy, and substantial ecological …