Practical Inner Product Encryption with Constant Private Key

Inner product encryption, first introduced by Katz et al., is a type of predicate encryption in which a ciphertext and a private key correspond to an attribute vector and a predicate vector, respectively. Only if the attribute and predicate vectors satisfy the inner product predicate will the decryption in this scheme be correct. In addition, the ability to use inner product encryption as an underlying building block to construct other useful cryptographic primitives has been demonstrated in the context of anonymous identity-based encryption and hidden vector encryption. However, the computing cost and communication cost of performing inner product encryption are very high at present. To resolve this problem, we introduce an efficient inner product encryption approach in this work. Specifically, the size of the private key is only one G element and one Zp element, and decryption requires only one pairing computation. The formal security proof and implementation result are also demonstrated. Compared with other state-of-the-art schemes, our scheme is the most efficient in terms of the number of pairing computations for decryption and the private key length.

Design of Montgomery Multiplier for High Speed Pairing Computation with Modified Compressor for Floating-point Unit

Pairings are adorable and captive cryptographic primitives for endowing different unique and effective information security schemes. Cryptosystem is generally attained using repeated modular multiplication for integers in large volume. To gear the security providing process high speed Montgomery multiplication modular VLSI architectures and algorithms and adapt addition by carry save method to prevent the carry propagation for every addition operation in add-shift loop. The suggested architecture consumes less energy and through put is high. In extension the compressor is modified with modified Kogge-stone adder to prominently increase the speed of the circuit.

Faster Ate pairing computation on Selmer's model of elliptic curves

This paper revisits the computation of pairings on a model of elliptic curve called Selmer curves. We extend the work of Zhang, Wang, Wang and Ye