Pages that link to "Item:Q4922899"
From MaRDI portal
The following pages link to Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System (Q4922899):
Displaying 5 items.
- Anonymous credential system with efficient proofs for monotone formulas on attributes (Q1800596) (← links)
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users (Q2336893) (← links)
- MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system (Q2691596) (← links)
- Privacy-preserving and efficient attributes proof based on selective aggregate CL-signature scheme (Q2804885) (← links)
- A New Approach to Efficient Revocable Attribute-Based Anonymous Credentials (Q3460098) (← links)