Every graph has a canonical finite abelian group attached to it. This group has appeared in the literature under a variety of names including the sandpile group, critical group, Jacobian group, and Picard group. The construction of this group closely mirrors the construction of the Jacobian variety of an algebraic curve. Motivated by this analogy, it was recently suggested by Norman Biggs that ...

This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identificatio...

An aggregate signature scheme allows anyone to compress multiple individual signatures from various users into a single compact signature. The main objective of such a scheme is to reduce the costs on storage, communication and computation. However, among existing aggregate signature schemes in the identity-based setting, some of them fail to achieve constant-length aggregate signature or requi...

Bilinear pairings on elliptic curves have many applications in cryptography and cryptanalysis. Pairing computation is more complicated compared to that of other popular public-key cryptosystems. Efficient implementation of cryptographic pairing, both softwareand hardware-based approaches, has thus received increasing interest. In this paper, we focus on hardware implementation and present the d...

The Industrial Internet of Things (IIoT) collects a large amount data through various types sensors and intelligently processes this using cloud computing, which is flexible, efficient, cost-effective. Since IIoT stored on the service provider’s server, must be encrypted to protect user’s privacy. However, faces search problem, usually solved by Public Key Encryption with Keyword Search (PEKS)....

hosen ciphertext security (CCA security)hosen ciphertext security (CCA security)C is now a widely accepted necessary security notion for public key encryption. CCA secure public verifiable public key encryption has many applications such as threshold public key encryption and proxy re-encryption etc. Furthermore, these years “random oracle model” has seen risen criticize by many cryptographers....

Several pairing-based cryptographic protocols are recently proposed with a wide variety of new novel applications including the ones in emerging technologies like cloud computing, internet of things (IoT), e-health systems and wearable technologies. There have been however a wide range of incorrect use of these primitives. The paper of Galbraith, Paterson, and Smart (2006) pointed out most of t...

In recent years there has been much interest in the development and the fast computation of bilinear pairings due to their practical and myriad applications in cryptography. Well known efficient examples are the Weil and Tate pairings and their variants such as the Eta and Ate pairings on the Jacobians of (hyper-)elliptic curves. In this paper, we consider the use of projective coordinates for ...

Attribute-based blind signature is used to realize the of messages by multiple people, and it suitable for electronic payment services in cloud. Most existing attribute-based schemes have complex bilinear pairing operations process verification, which leads low algorithm efficiency. To solve this problem, study, an efficient pairing-free scheme based on ordered binary decision diagram proposed,...

In Eurocrypt 2012, Lewko presented a fully secure IBE scheme in the prime order setting based on the decisional linear assumption. We note that some random factor involved in the ciphertext can further be used to hide yet another message , and get a new fully secure IBE scheme with better message-ciphertext rate. Similar to Lewko’s scheme, we use dual pairing vector space in prime order bilinea...