Efficient Implementation of AND, OR and NOT Operators for ABCs

  title={Efficient Implementation of AND, OR and NOT Operators for ABCs},
  author={Antonio de la Piedra},
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 peudonyms, equality proofs of representation, verifiable encryption of attributes and proving properties of attributes via AND, NOT and OR operators… 



Towards a Full-Featured Implementation of Attribute Based Credentials on Smart Cards

This paper implements an efficient extended Pseudo-Random Number Generator PRNG for recomputing pseudorandomness and reconstructing variables and implements Idemix standard and domain pseudonyms, AND proofs based on prime-encoded attributes, and equality proofs of representation modulo a composite.

Design and implementation of the idemix anonymous credential system

The design and implementation of an anonymous credential system based on the protocols developed by [6] is described, based on new high-level primitives and interfaces allowing for easy integration into access control systems.

Efficient U-Prove Implementation for Anonymous Credentials on Smart Cards

This paper focuses on the implementation of Microsoft's U-Prove technology on the MULTOS smart card platform and argues that this approach should be considered in favour of Microsoft’s one.

Efficient implementation of anonymous credentials on Java Card smart cards

This work presents the first implementation of the (simplified) Direct Anonymous Attestation protocols suitable for contemporary Java Card smart cards, and points out performance bottlenecks and provides efficient solutions which allow the implementation to terminate within acceptable time.

An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

This paper proposes a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption modulo a safe prime product and is considerably superior to existing ones.

Practical Verifiable Encryption and Decryption of Discrete Logarithms

This paper presents a variant of the new public key encryption of Cramer and Shoup based on Paillier's decision composite residuosity assumption, along with efficient protocols for verifiable encryption and decryption of discrete logarithms.

A Signature Scheme with Efficient Protocols

This paper proposes a practical and provably secure signature scheme and shows protocols for issuing a signature on a committed value (so the signer has no information about the signed value), and for proving knowledge of a signing on a commit value.

Developing Efficient Blinded Attribute Certificates on Smart Cards via Pairings

This paper describes an elementary protocol to prove possession of anonymous credentials together with its implementation on smart cards. The protocol uses self-blindable attribute certificates

How to Prove Yourself: Practical Solutions to Identification and Signature Problems

Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.

Efficient Selective Disclosure on Smart Cards Using Idemix

This paper discusses an efficient implementation for selective disclosure of attribute-based credentials on smart cards using the MULTOS platform and compares Idemix with Microsoft's U-Prove technology, as the latter also offers selective Disclosure of attributes and has been implemented on a smart card.