Corpus ID: 15701238

On the Disadvantages of Pairing-based Cryptography

@article{Cao2015OnTD,
  title={On the Disadvantages of Pairing-based Cryptography},
  author={Zhengjun Cao and Lihua Liu},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={84}
}
Pairing-based cryptography (PBC) has many elegant properties. It is claimed that PBC can offer a desired security level with smaller parameters as the general elliptic curve cryptography (ECC). In the note, we remark that this view is misleading. Suppose that an elliptic curve E is defined over the field Fq. Then ECC is working with elements which are defined over Fq. But PBC is working with the functions and elements defined over Fqk , where k is the embedding degree. The security of PBC… Expand
Elliptic Curve-Based Secure Multidimensional Aggregation for Smart Grid Communications
TLDR
This paper proposes a scheme that considers multidimensional aggregation with privacy preserving and an efficient verification of smart grid data that is based on elliptic curve cryptography along with homomorphic encryption and without pairings. Expand
An efficient Secure Electronic Mail System based on Elliptic Curve Certificateless Signcryption
TLDR
A CLC-ECsigncryption based secure E-mail system is proposed which provides all the security services: confidentiality, integrity, authentication, non-repudiation and forward secrecy with high efficiency compared with other recently existing schemes. Expand
A Pairing Free Secure Identity-based Aggregate Signature Scheme Under Random Oracle
TLDR
This paper introduces a new efficient and secure pairing free signature scheme based on the idea of aggregation and offers lower computational cost than other schemes from pairings as it saves 68.69% from computations. Expand
Pairing free identity based aggregate signcryption scheme
TLDR
The goal of this study is to propose a secure provably identity based aggregate signcryption scheme ID-ASC without pairings over the elliptic curve cryptography that is provable secure against confidentiality and unforgeability under random oracle model. Expand
Design of secure authentication protocol for dynamic user addition in distributed Internet-of-Things
TLDR
A novel authentication scheme with partially involved TTP nomenclatured Secure Dynamic User Addition Protocol (SDUAP) based on JWT (JSON Web Token) challenge and response game using symmetric key cryptography is proposed. Expand
Security of Low Computing Power Devices: A Survey of Requirements, Challenges & Possible Solutions
TLDR
Common attributes, security requirements and security challenges of all kinds of low computing power devices in one place so that common security solutions for these can be designed and implemented rather than doing this for each individual device type. Expand
Secure and Efficient Dealing with Node Capture Attack in Wireless Sensor Networks
ix List of Symbols and Acronyms xii
Pairing-Based Cryptography
  • Ansh Riyal, Geetansh Kumar, Deepak K. Sharma
  • Computer Science
  • 2021

References

SHOWING 1-10 OF 29 REFERENCES
Pairing-Based Cryptography: Past, Present, and Future
  • D. Boneh
  • Mathematics, Computer Science
  • ASIACRYPT
  • 2012
TLDR
This talk surveys some of the existing applications of pairings to cryptography, but mostly focus on open problems that cannot currently be solved using pairings, and explains where the current techniques fail and outline a few potential directions for future progress. Expand
Reducing elliptic curve logarithms to logarithms in a finite field
TLDR
The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logariths problem in the multiplicative group of an extension of the underlying finite field, thus providing a probabilistic subexponential time algorithm for the former problem. Expand
The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone Algorithm
TLDR
It is proved that, under a mild condition that always holds in practical applications, the condition that l|(qk-1) is also sufficient for realizing the MOV algorithm, and an improved upper bound is given for the frequency of occurrence of pairs of primes l. Expand
Guide to Elliptic Curve Cryptography
TLDR
This guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment, as well as side-channel attacks and countermeasures. Expand
Identity-Based Cryptosystems and Signature Schemes
TLDR
A novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party. Expand
Efficient Selective Identity-Based Encryption Without Random Oracles
We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles in groups equipped with a bilinear map. Selective-identityExpand
Chosen-Ciphertext Security from Identity-Based Encryption
TLDR
This work proposes a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme, which avoids non-interactive proofs of “well-formedness” which were shown to underlie most previous constructions. Expand
Identity-Based Encryption from the Weil Pairing
TLDR
This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems. Expand
Hierarchical Identity Based Encryption with Constant Size Ciphertext
TLDR
A Hierarchical Identity Based Encryption system where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, regardless of the hierarchy depth, which is proved to be as efficient as in other HIBE systems. Expand
Elliptic curve cryptosystems
We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure,Expand
...
1
2
3
...