Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security
- 25 May 2022
- book chapter
- Published by Springer Nature
- p. 305-335
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability2015
- New Techniques for Noninteractive Zero-KnowledgeJournal of the ACM, 2012
- Efficient Non-interactive Proof Systems for Bilinear Groups2008
- Unconditional Characterizations of Non-interactive Zero-Knowledge2005
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems2000
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Non-interactive zero-knowledge and its applications1988
- Lower bounds on the size of bounded depth circuits over a complete basis with logical additionMathematical Notes, 1987
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC11986
- Secure communications over insecure channelsCommunications of the ACM, 1978