Identity-Based Encryption from the Weil Pairing

By Dan Boneh, M. Franklin. 2001

10,227 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, background): “Speciﬁcally, let e be a non-trivial bi-linear map [13] e : G 1 × G 2 → G T and let g 1 , g 2 be generators of G 1 and G 2 respectively.”
Pinocchio: Nearly Practical Verifiable Computation (2013, background): “Let e be a non-trivial bilinear map [34] e : G×G→GT , and let g be a generator of G.”
Proactively Accountable Anonymous Messaging in Verdict (2012, background): “To be useful, the map must also be nondegenerate (if P is a generator of G1, ê(P,P) is a generator of G2) and efficiently computable [8].”
Anonymous communications in mobile ad hoc networks (2005, background): “The computational overhead introduced by cryptographic operations should be low, which is achieved by utilizing a new cryptographic concept called pairing [8], efficient hash functions, and symmetric-key algorithms.”
Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud (2013, background): “Let G1 and G2 be an additive cyclic group and a multiplicative cyclic group of the same prime order q, respectively [11].”
Blockchain-Assisted Secure Device Authentication for Cross-Domain Industrial IoT (2020, background): “Identity-based cryptography (IBC) [10] is a type of public-key cryptography in which a publicly known string representing the identity of an entity is used as the public key.”
EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications (2012, neutral): “In Section 3, we recall the bilinear pairings [18] and Paillier cryptosystem as the preliminaries.”
Securing wireless sensor networks: a survey (2008, methodology): “Identity-based cryptography [76] is a shortcut to avoid the problem.”
Location-based compromise-tolerant security mechanisms for wireless sensor networks (2006, background): “We refer to [19], [20] for a more comprehensive description of how these pairing parameters should be selected in practice for efficiency and security.”
Efficient pairing computation on supersingular Abelian varieties (2007, methodology): “As a case study we consider the Boneh-Franklin identity-based encryption scheme [7] (similar ideas can speed up aspects of other pairing-based cryptosystems, we refer to Frey and Lange [13] for further discussion).”
Practical Identity-Based Encryption Without Random Oracles (2006, background): “(Though, inconveniently for our narrative, Boneh and Franklin's IBE system slightly pre-dates its associated signature scheme.)”
Guide to Elliptic Curve Cryptography (2004, methodology): “Constructive applications of supersingular curves (and bilinear maps in general) include the three-party one-round Diffie-Hellman protocol of Joux [227], the identity-based public-key encryption scheme of Boneh and Franklin [58, 59], the hierarchical identity-based encryption and signature schemes o”
Signature Schemes and Anonymous Credentials from Bilinear Maps (2004, methodology): “Following prior work (for example, Boneh and Franklin [6]), e is a function, e : G × G → G, such that = 1, where 1 is the identity of G. – (Efficient) There exists an efficient algorithm for computing e.”
An Efficient Signature Scheme from Bilinear Pairings and Its Applications (2004, methodology): “BLS short signature needs a special hash function [6, 1, 8].”
Identity-based encryption with efficient revocation (2008, methodology): “As a solution to this problem for IBE, Boneh and Franklin [7] suggested that users renew their private keys periodically, e.g. every week, and senders use the receivers' identities concatenated with the current time period, e.g. " week 15 of 2008 " .”