Non-Interactive Zero-Knowledge Proofs of Non-Membership

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

zbMATH Keywords

zero knowledgesmooth projective hash functionGroth-Sahai proof systemwitness elimination

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Generic plaintext equality and inequality proofs ⋮ Structure-Preserving Smooth Projective Hashing

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

This page was built for publication: Non-Interactive Zero-Knowledge Proofs of Non-Membership