Non-interactive zero-knowledge proofs for composite statements
type: Item
instance of: scholarly article
title: Non-interactive zero-knowledge proofs for composite statements
zbMATH Open document ID: 1457.94088
DOI: 10.1007/978-3-319-96878-0_22
author: Shashank Agrawal
author: Chaya Ganesh
author: Payman Mohassel
publication date: 2020-06-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 91B64
zbMATH DE Number: 7216162
zbMATH Keywords: Sigma protocols
zbMATH Keywords: QAP-based SNARKs
MaRDI profile type: Publication
full work available at URL: 978-3-319-96878-0 22
OpenAlex ID: W2882986534
Recommended article: Non-interactive zero-knowledge proofs to multiple verifiers
Recommended article: Composition of Zero-Knowledge Proofs with Efficient Provers
Recommended article: Q4250778
Recommended article: Non-interactive zero-knowledge proofs with fine-grained security
Recommended article: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
Recommended article: Q3789104
Recommended article: Q4038698
Recommended article: On the Composition of Zero-Knowledge Proof Systems
Recommended article: Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
Recommended article: Non-Interactive Zero-Knowledge Proofs of Non-Membership
description: scientific article; zbMATH DE number 7216162