Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System (Q4922899)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System |
scientific article; zbMATH DE number 6170410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System |
scientific article; zbMATH DE number 6170410 |
Statements
Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System (English)
0 references
4 June 2013
0 references
0.9121467
0 references
0.86548555
0 references
0.8517269
0 references
0.85093194
0 references
0.8508445
0 references
0.8484257
0 references
