Non-interactive zero-knowledge proofs for composite statements

DOI10.1007/978-3-319-96878-0_22MaRDI QIDQ776004zbMATH OpenOpenAlexFDO

Authors Shashank Agrawal, Chaya Ganesh, 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

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

Recommendations

• Non-interactive zero-knowledge proofs to multiple verifiers
• Composition of zero-knowledge proofs with efficient provers
• scientific article; zbMATH DE number 1304087
• Non-interactive zero-knowledge proofs with fine-grained security
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• scientific article; zbMATH DE number 4053065
• scientific article; zbMATH DE number 177820
• On the Composition of Zero-Knowledge Proof Systems
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Non-Interactive Zero-Knowledge Proofs of Non-Membership

Cited in

(22)

• An introduction to the use of zk-SNARKs in blockchains
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Balancing privacy and accountability in blockchain identity management
• Verifiable decentralized multi-client functional encryption for inner product
• Fully homomorphic NIZK and NIWI proofs
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Short-lived zero-knowledge proofs and signatures
• Towards zero knowledge argument for double discrete logarithm with constant cost
• Hierarchical integrated signature and encryption. (or: key separation vs. key reuse: enjoy the best of both worlds)
• \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
• 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
• Non-interactive composition of sigma-protocols via Share-then-Hash
• \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
• Succinct attribute-based signatures for bounded-size circuits by combining algebraic and arithmetic proofs
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Rinocchio: SNARKs for ring arithmetic
• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
• Sigma protocols from verifiable secret sharing and their applications
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions

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

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