A ciphertext-policy attribute-based encryption protocol uses bilinear pairings to provide control access mechanisms, where the set of user's attributes is specified by means of a linear secret sharing scheme. In this paper we present the design of a software cryptographic library that achieves record timings for the computation of a 126-bit security level attribute-based encryption scheme. We developed all the required auxiliary building blocks and compared the computational weight that each of them adds to the overall performance of this protocol. In particular, our single pairing and multi-pairing implementations achieve state-of-the-art time performance at the 126-bit security level.
Nowadays, electoral processes can be automated, using electronic devices and communication networks. The electronic voting systems allow easy voter casting and fast vote counting for electoral entities. In this paper, an electronic voting scheme is proposed, it performs the communication among voters and electoral entities with a minimal number of phases and cryptographic operations. The scheme uses a combination of the blind signature scheme proposed by Boldyreva in 2003 and the short signature proposed by Boneh–Lynn–Shacham in 2001. Both signatures use pairing-based cryptography and a special hash function known as map-to-point. The scheme generates small ballots which consist of just two messages, one blind signature and one short signature. We present experimental data showing that our pairing-based scheme is considerably more efficient than other blind signature e-voting schemes recently proposed whose security is based on the integer factorization problem or on the discrete logarithm problem over prime fields.
1 January 2009 in Lecture Notes in Computer Science
Loyalty cards programs have been used by retailers to increase customer retention. Loyality cards provide means to identify a particular customer and to collect customer-specific data, thus enabling individualized marketing; however, operating a loyalty program is complicated for retailers since they require to manage balances, collections, and transfers of customers. This is exactly the same problem the retailers were facing before credit cards were readily available. A new problem is that customers now have too many cards, customers may forget, or even deliberately decide to carry only a selection of their cards. This paper proposes a loyalty program based on a blockchain that does not require a physical card for identifying customers as it associates customers to their phone numbers, since nowadays people always carry their phone. In this perspective, companies can reduce overhead costs associated to managing the loyalty program. This paper reviews the technology required and describes the implementation of a loyalty program based on blockchains. Finally, it also enumerates the reasons for choosing the blockchain technology for this application.
1 September 2014 in Finite Fields and Their Applications