Non-Interactive Zero-Knowledge Proofs of Non-Membership
From MaRDI portal
Publication:2790035
DOI10.1007/978-3-319-16715-2_8zbMath1332.94058OpenAlexW247313899MaRDI QIDQ2790035
Olivier Blazy, Céline Chevalier, Damien Vergnaud
Publication date: 2 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_8
Related Items
Cites Work
- Probabilistic encryption
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- Tightly Secure Signatures and Public-Key Encryption
- A General, Flexible and Efficient Proof of Inclusion and Exclusion
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Structure-Preserving Signatures and Commitments to Group Elements
- Efficient Protocols for Set Membership and Range Proofs
- Zero-Knowledge Proofs with Witness Elimination
- Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles