Prover-efficient commit-and-prove zero-knowledge snarks

DOI10.1504/IJACT.2017.089355zbMath1428.94085OpenAlexW3203017069MaRDI QIDQ1626134

Helger Lipmaa

Publication date: 26 November 2018

Published in: International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijact.2017.089355

zbMATH Keywords

batch verificationCRSsubset-sumcommon reference stringCaPcommit-and-proveNIZKnon-interactive zero knowledgenumerical NP-complete languagesrange proofzk-SNARK

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

A PCP theorem for interactive proofs and applications

This page was built for publication: Prover-efficient commit-and-prove zero-knowledge snarks