Proceedings ArticleDOI
Tampering Attacks in Pairing-Based Cryptography
Johannes Blömer,Peter Günther,Gennadij Liske +2 more
- pp 1-7
TLDR
The applicability of timing, power, or fault attacks to implementations of pairings is an important research topic and some of the known results in this area are reviewed.Abstract:
In the last decade pairings have become an important, and often indispensable, ingredient in the construction of identity-based and attribute-based cryptosystems, as well as group signatures and credential systems. Consequently, the applicability of timing, power, or fault attacks to implementations of pairings is an important research topic. We will review some of the known results in this area.read more
Citations
More filters
Journal ArticleDOI
Using modular extension to provably protect Edwards curves against fault attacks
TL;DR: In this article, the modular extension protection scheme in previously existing and newly contributed variants of the countermeasure on elliptic curve scalar multiplication (ECSM) algorithms is investigated.
Posted Content
Using Modular Extension to Provably Protect Edwards Curves Against Fault Attacks
TL;DR: In this article, a test-free variant of the modular extension scheme was proposed to guarantee the integrity of the computation result, hence covering most existing and future fault attacks, and the authors proved the correctness and security of modular extension: specifically, the fault nondetection probability is inversely proportional to the security parameter.
Journal Article
Using Modular Extension to Provably Protect Edwards Curves Against Fault Attacks
TL;DR: This paper studies the modular extension protection scheme in previously existing and newly contributed variants of the countermeasure on elliptic curve scalar multiplication (ECSM) algorithms and formally proves the correctness and security of modular extension.
Book ChapterDOI
Pairing-Based Cryptography
TL;DR: Cryptography has been modified countless times and yet, each form it has taken has had the sole purpose of being nearly impossible to crack, i.e. decrypt without knowing the secret keys.
References
More filters
Book ChapterDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption scheme (IBE) based on the Weil pairing that has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational Diffie-Hellman problem.
Journal ArticleDOI
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: 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.
Journal ArticleDOI
The Weil Pairing, and Its Efficient Calculation
TL;DR: The definition of the Weil Pairing is given, efficient algorithms to calculate it are described, two applications are given, and the motivation to considering it is described.
Journal ArticleDOI
Optimal Pairings
TL;DR: An algorithm to construct optimal ate pairings on all parametrized families of pairing friendly elliptic curves and conjecture that any nondegenerate pairing on an elliptic curve without efficiently computable endomorphisms different from powers of Frobenius requires at least 2-sub Miller iterations.
Book
Mathematics of Public Key Cryptography
TL;DR: In this paper, the major ideas and techniques of public key cryptography are discussed, with historical remarks and insightful perspectives on the development of the subject, as well as several examples, proofs and exercises.