Set (non-)membership NIZKs from determinantal accumulators

DOI10.1007/978-3-031-44469-2_18zbMATH Open1547.94386MaRDI QIDQ6619944

Roberto Parisella, Helger Lipmaa

Publication date: 16 October 2024

zbMATH Keywords

non-interactive zero-knowledgecommit-and-proveset (non-)membership argumentuniversal accumulator

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Structure-preserving signatures and commitments to group elements
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Generic plaintext equality and inequality proofs
• Shorter quadratic QA-NIZK proofs
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability
• Revocation for Delegatable Anonymous Credentials
• Universal Accumulators with Efficient Nonmembership Proofs
• Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
• On QA-NIZK in the BPK Model
• P-signatures and Noninteractive Anonymous Credentials
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Topics in Cryptology – CT-RSA 2005
• Efficient NIZKs for algebraic sets

This page was built for publication: Set (non-)membership NIZKs from determinantal accumulators

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