Non-interactive zero-knowledge proofs for composite statements

DOI10.1007/978-3-319-96878-0_22zbMath1457.94088OpenAlexW2882986534MaRDI QIDQ776004

Chaya Ganesh, Shashank Agrawal, Payman Mohassel

Publication date: 30 June 2020

Full work available at URL: https://doi.org/10.1007/978-3-319-96878-0_22

zbMATH Keywords

QAP-based SNARKsSigma protocols

Mathematics Subject Classification ID

Cryptography (94A60) Macroeconomic theory (monetary models, models of taxation) (91B64)

Related Items (13)

Balancing privacy and accountability in blockchain identity management ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ On black-box extension of a non-interactive zero-knowledge proof system for secret equality ⋮ Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs ⋮ Short-lived zero-knowledge proofs and signatures ⋮ Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds) ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ An Introduction to the Use of zk-SNARKs in Blockchains ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular

This page was built for publication: Non-interactive zero-knowledge proofs for composite statements