Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 27 for “"Pairing-Based Cryptography"”.
-
Hardware processors for pairing-based cryptography
Bilinear pairings can be used to construct cryptographic systems with very desirable properties. A pairing performs a mapping on members of groups on elliptic and genus 2 hyperelliptic curves to an extension of the finite field on which the curves are defined. The finite fields must, however, be …
-
Privacy Enhancing Protocols using Pairing Based Cryptography
… study in recent years. Our constructions are based on a special type of algebraic group called bilinear groups. We present existing cryptographic constructions which use bilinear pairings, namely Identity-Based Encryption (IBE). We define a desirable property of digital signatures, blindness, …
-
Constructing suitable parameters for pairing-based cryptography
Pairings were introduced by André Weil back in 1940 and they were initially viewed as a tool for attacking the elliptic curve discrete logarithm problem. After almost 60 years from their discovery, pairings became one of the major research subjects in cryptography. One of the most important …
-
High-Speed Elliptic Curve and Pairing-Based Cryptography
Elliptic Curve Cryptography (ECC), independently proposed by Miller [Mil86] and Koblitz [Kob87] in mid 80’s, is finding momentum to consolidate its status as the public-key system of choice in a wide range of applications and to further expand this position to settings traditionally occupied by RSA …
-
Efficient Implementations of Pairing-Based Cryptography on Embedded Systems
Many cryptographic applications use bilinear pairing such as identity based signature, instance identity-based key agreement, searchable public-key encryption, short signature scheme, certificate less encryption and blind signature. Elliptic curves over finite field are the most secure and …
-
Genus 2 curves in pairing-based cryptography and the minimal embedding field
A pairing-friendly hyperelliptic curve over a finite field Fq is one whose group of Fq-rational points of its Jacobian has size divisible by a large prime and whose embedding degree is small enough for computations to be feasible but large enough for the discrete logarithm problem in the embedding …
-
The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms
The security of pairing-based cryptography can be reduced to the difficulty of the discrete logarithm problem (DLP) in finite fields of medium characteristic. The number field sieve is the best known algorithm for this problem. We look at a recent improvement to the number field sieve (NFS) by Joux …
-
On the implementation of composite-order bilinear groups in cryptographic protocols
… the latest developments in composite-order pairing based cryptography. We first develop the necessary mathematical background. We describe elliptic curves over finite fields, as well as rational functions and divisors on such curves. Bilinear pairings on elliptic curves are explained. We …
-
On Prime-Order Elliptic Curves with Embedding Degrees 3, 4 and 6
Bilinear pairings on elliptic curves have many cryptographic applications such as identity based encryption, one-round three-party key agreement protocols, and short signature schemes. The elliptic curves which are suitable for pairing-based cryptography are called pairing friendly curves. The …
-
Efficient Pairings on Various Platforms
Pairings have found a range of applications in many areas of cryptography. As such, to utilize the enormous potential of pairing-based protocols one needs to efficiently compute pairings across various computing platforms. In this thesis, we give an introduction to pairing-based cryptography and …
-
On Efficient Polynomial Multiplication and Its Impact on Curve based Cryptosystems
… achieved using elliptic/hyperelliptic curve and pairing based cryptography. Polynomial multiplication is used in the underlying operations of these protocols. Therefore, as part of this thesis different recursive algorithms are studied; these algorithms include Karatsuba, Toom, and Bernstein. In …
-
Developing an Automatic Generation Tool for Cryptographic Pairing Functions
Pairing-Based Cryptography is receiving steadily more attention from industry, mainly because of the increasing interest in Identity-Based protocols. Although there are plenty of applications, efficiently implementing the pairing functions is often difficult as it requires more knowledge than …
-
Cryptographic Pairings: Efficiency and DLP security
… studies two important aspects of the use of pairings in cryptography, efficient algorithms and security. Pairings are very useful tools in cryptography, originally used for the cryptanalysis of elliptic curve cryptography, they are now used in key exchange protocols, signature schemes and …
-
Xiezhi: Toward Succinct Proofs of Solvency
… and more ideal settings for succinctness (e.g., pairing-based cryptography) with a novel mapping approach. Finally, we discuss how to adapt the protocol to the concrete parameters of bls12-381 (which is relevant because the bit-decomposition of all user balances will exceed the largest root of …
-
Supersingular Curves in Cryptography
… curves makes them unsuitable for elliptic curve cryptography that relies on the group structure of points on an elliptic curve over a finite field. However, their pairing friendliness and rich endomorphism ring structure make them ideal candidates for pairing-based and isogeny-based cryptography, …
-
Pairing computation on hyperelliptic curves of genus 2
Bilinear pairings have been recently used to construct cryptographic schemes with new and novel properties, the most celebrated example being the Identity Based Encryption scheme of Boneh and Franklin. As pairing computation is generally the most computationally intensive part of any painng-based …
-
On the Efficiency and Security of Cryptographic Pairings
Pairing-based cryptography has been employed to obtain several advantageous cryptographic protocols. In particular, there exist several identity-based variants of common cryptographic schemes. The computation of a single pairing is a comparatively expensive operation, since it often requires many …
-
Crytographic applications of bilinear maps
… In 1984, Shamir developed the first identity based signature scheme, and posed the construction of an identity based encryption scheme as an open problem [118]. Subsequently identity based identification and identity based key agreement schemes were proposed. However, identity based encryption …
Page 1 of 2