Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System

DOI10.1007/978-3-642-37682-5_35zbMath1342.68118OpenAlexW1589015433MaRDI QIDQ4922899

Nobuo Funabiki, Toru Nakanishi, Nasima Begum

Publication date: 4 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37682-5_35

Mathematics Subject Classification ID

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

Related Items (4)

A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials ⋮ MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system ⋮ Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme ⋮ An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users

This page was built for publication: Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System