Paper 2015/1117 Original: eprint.iacr.org/2015/1117 ↗
Efficient implementation of AND, OR and NOT operators for ABCs
Abstract
In the last few years several practitioners have proposed different strategies for implementing Attribute-based credentials (ABCs) on smart cards. ABCs allow citizens to prove certain properties about themselves without necessarily revealing their full identity. The Idemix ABC is the most versatile ABC system proposed in the literature, supporting pseudonyms, equality proofs of representation, verifiable encryption of attributes and proving properties of attributes via AND, NOT and OR operators. Recently, Vullers et al. and De La Piedra et al. addressed the implementation of the selective disclosure operations, pseudonyms and multi-credential proofs such as equality proofs of representation. In this manuscript, we present implementation strategies for proving properties of user attributes via these operators and show how to combine them via external and internal commitment reordering.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2015-12-03: last updated
- 2015-11-18: published
- Short URL
- https://ia.cr/2015/1117
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/1117,
author = {Antonio de la Piedra},
title = {Efficient implementation of AND, OR and NOT operators for ABCs},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/1117},
year = {2015},
url = {https://eprint.iacr.org/2015/1117}
}