An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations

DOI10.1007/978-3-030-26834-3_6MaRDI QIDQ6488934

Toru Nakanishi, Unnamed Author

Publication date: 14 March 2024

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Attribute-based anonymous credential: optimization for single-use and multi-use ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system

Cites Work

• Unnamed Item
• Anonymous credential system with efficient proofs for monotone formulas on attributes
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
• Structure-Preserving Signatures and Commitments to Group Elements
• Efficient Protocols for Set Membership and Range Proofs
• An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
• Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups

This page was built for publication: An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations