Non-Interactive Zero-Knowledge Proofs for Composite Statements - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Shashank Agrawal, Chaya Ganesh, Payman Mohassel. Non-Interactive Zero-Knowledge Proofs for Composite Statements. IACR Cryptology ePrint Archive, 2018:557, 2018. [doi]

The following publications are possibly variants of this publication:

Non-Interactive Zero-Knowledge Proofs for Composite StatementsShashank Agrawal, Chaya Ganesh, Payman Mohassel. crypto 2018: 643-673 [doi]

Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized CostZhangxiang Hu, Payman Mohassel, Mike Rosulek. iacr, 2015:497, 2015. [doi]

Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized CostZhangxiang Hu, Payman Mohassel, Mike Rosulek. crypto 2015: 150-169 [doi]

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving CredentialsMelissa Chase, Chaya Ganesh, Payman Mohassel. crypto 2016: 499-530 [doi]

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving CredentialsMelissa Chase, Chaya Ganesh, Payman Mohassel. iacr, 2016:583, 2016. [doi]

runs on WebDSL