Linear Algebra with Sub-linear Zero-Knowledge Arguments

DOI10.1007/978-3-642-03356-8_12zbMath1252.94068OpenAlexW1541538376MaRDI QIDQ3183565

Jens Groth

Publication date: 20 October 2009

Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_12

zbMATH Keywords

linear algebracircuit satisfiabilityPedersen commitmentspublic-coin special honest verifier zero-knowledgesub-linear size zero-knowledge arguments

Mathematics Subject Classification ID

Related Items (17)

An algebraic framework for universal and updatable SNARKs ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Structure-preserving signatures and commitments to group elements ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ How to verifiably encrypt many bits for an election? ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Lattice-based inner product argument ⋮ Succinct Diophantine-satisfiability arguments ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Unnamed Item ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Two-sided malicious security for private intersection-sum with cardinality ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics

This page was built for publication: Linear Algebra with Sub-linear Zero-Knowledge Arguments