Non-Interactive Zero-Knowledge Proofs of Non-Membership

DOI10.1007/978-3-319-16715-2_8MaRDI QIDQ2790035zbMATH OpenOpenAlexFDO

Authors 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

Groth-Sahai proof systemsmooth projective hash functionwitness eliminationzero knowledge

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4053065
• Non-interactive zero-knowledge proofs to multiple verifiers
• Non-interactive zero-knowledge proofs with fine-grained security
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Noninteractive Zero-Knowledge
• Pairing-based non-interactive zero-knowledge proofs
• Non-interactive zero-knowledge proofs for composite statements
• Short non-interactive zero-knowledge proofs
• scientific article; zbMATH DE number 4197461
• Theory of Cryptography

Cites work

• A general, flexible and efficient proof of inclusion and exclusion
• Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Protocols for Set Membership and Range Proofs
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• New techniques for SPHFs and efficient one-round PAKE protocols
• Probabilistic encryption
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Structure-preserving signatures and commitments to group elements
• Tightly Secure Signatures and Public-Key Encryption
• Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
• Zero-knowledge argument for polynomial evaluation with application to blacklists
• Zero-Knowledge Proofs with Witness Elimination

Cited in

(9)

• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Generic plaintext equality and inequality proofs
• Structure-preserving smooth projective hashing
• A general, flexible and efficient proof of inclusion and exclusion
• Noninteractive Zero-Knowledge
• scientific article; zbMATH DE number 1759347 (Why is no real title available?)
• Primary-secondary-resolver membership proof systems
• Set (non-)membership NIZKs from determinantal accumulators
• Non-interactive zero-knowledge proofs for composite statements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790035)