Linear Algebra with Sub-linear Zero-Knowledge Arguments

DOI10.1007/978-3-642-03356-8_12MaRDI QIDQ3183565zbMATH OpenOpenAlexFDO

Authors 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

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Round-efficient sub-linear zero-knowledge arguments for linear algebra
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• scientific article; zbMATH DE number 1302863

Cited in

(29)

• Efficient lattice-based polynomial evaluation and batch ZK arguments
• Efficient proof of RAM programs from any public-coin zero-knowledge system
• Sigma protocols from verifiable secret sharing and their applications
• Sublinear zero-knowledge arguments for RAM programs
• A general, flexible and efficient proof of inclusion and exclusion
• An algebraic framework for universal and updatable SNARKs
• Lattice-based inner product argument
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Structure-preserving signatures and commitments to group elements
• Attribute-based versions of Schnorr and ElGamal
• scientific article; zbMATH DE number 7746256 (Why is no real title available?)
• Shorter pairing-based arguments under standard assumptions
• QA-NIZK arguments of same opening for bilateral commitments
• Ligero: lightweight sublinear arguments without a trusted setup
• Practical sublinear proofs for R1CS from lattices
• Algebraic reductions of knowledge
• Malleable commitments from group actions and zero-knowledge proofs for circuits based on isogenies
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Removing the strong RSA assumption from arguments over the integers
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• On publicly-accountable zero-knowledge and small shuffle arguments
• Two-sided malicious security for private intersection-sum with cardinality
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• An efficient ZK compiler from SIMD circuits to general circuits
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Succinct Diophantine-satisfiability arguments
• How to verifiably encrypt many bits for an election?
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Round-efficient sub-linear zero-knowledge arguments for linear algebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183565)