Short Signatures from the Weil Pairing

By Dan Boneh, Ben Lynn, Hovav Shacham. 2001

4,798 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, 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

1. Dan Boneh
2. Brent Waters
3. Xavier Boyen
4. Craig Gentry
5. Jonathan Katz
6. Amit Sahai
7. Shai Halevi
8. Wenjing Lou

In Computer Vision and Pattern Recognition

1. Brent Waters
2. Dan Boneh
3. Xavier Boyen
4. Craig Gentry
5. Shai Halevi
6. Amit Sahai
7. Moni Naor
8. Kui Ren

In Information Systems

1. Brent Waters
2. Xavier Boyen
3. Dan Boneh
4. Jonathan Katz
5. Amit Sahai
6. Craig Gentry
7. Wenjing Lou
8. Kui Ren

Citations in the corpus

• Bulletproofs: Short Proofs for Confidential Transactions and More (2018, background): “See [63] for a concrete construction of hash function into an elliptic curve kth party’s message.”
• An Efficient Pseudonymous Authentication Scheme With Strong Privacy Preservation for Vehicular Communications (2010, methodology): “Second, the TA uses each secret key SKTA,Vi,k to sign Lw pseudonymous certificates based on the short signature algorithm [24] in lines 17–33.”
• Proxy Provable Data Possession in Public Clouds (2013, background): “A group with such a map ^ e is called a bilinear group, on which the Computational Diffie-Hellman (CDH) problem is assumed hard while the Decisional Diffie-Hellman (DDH) problem is easy to be solved [26].”
• A Security and Privacy Review of VANETs (2015, methodology): “More performance evaluation of these schemes should be conducted on a large-scale VANET, with varying vehicle mobility models, like creating a stronger threat model in which an adversary can utilize more character factors to track a vehicle.”
• Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005, methodology): “We use the following notation [18, 8]: 1.”
• Untangling Blockchain: A Data Processing View of Blockchain Systems (2017, background): “, [59], [60], can be employed (albeit not without major changes in the current design).”
• Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing (2009, methodology): “Bilinear Map. A bilinear map is a map e : G × G → GT, where G is a Gap Diffie-Hellman (GDH) group andGT is another multiplicative cyclic group of prime order p with the following properties [ 16 ]: (i) Computable: there exists an efficiently computable algorithm for computinge; (ii) Bilinear: for al”
• PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval (2011, methodology): “To minimize overhead, we use the threshold BLS signature scheme [3] since signatures in that scheme are single group elements (22 bytes, for example, for 80-bit security), regardless of the number of directory authorities issuing signatures.”
• Toward Hierarchical Identity-Based Encryption (2002, background): “Additionally, a bilinear function is needed in a recently described short signature scheme [3].”
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles (2006, methodology): “Boneh et al. [8] presented the first aggregate signature scheme, which was based on the BLS signature [9] in groups with efficiently computable bilinear maps.”
• Publicly verifiable delegation of large polynomials and matrix computations, with applications (2012, neutral): “The co-Computational Diffie-Hellman problem was introduced by Boneh, Lynn and Shacham as a natural generalization of the Computational Diffie-Hellman problem in asymmetric bilinear groups [6].”
• Compact Multi-Signatures for Smaller Blockchains (2018, methodology): “Our pairing-based multi-signature with public-key aggregation MSP is built from the BLS signature scheme [13].”
• Preserving data integrity for smart grid data aggregation (2012, methodology): “posed to support multivariate polynomial evaluation [20]–[22].”
• Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System (2007, methodology): “We can use the fact that G1 is of size approximately 2170, elements in G1 are 171-bit strings, and the discrete log in G1 is as hard as the discrete log in Zq where q is 1020 bits [10,15,28].”
• Hierarchical ID-Based Cryptography (2002, methodology): “Concrete Schemes: For our HIDE and HIDS schemes, one can use the same elliptic curves or abelian varieties as those in [6], [7], or [15].”
• Charm: a framework for rapidly prototyping cryptosystems (2013, neutral): “BLS03 [21] Short signature Pairing ROM 23”
• Aggregate and Verifiably Encrypted Signatures from Bilinear Maps (2003, methodology): “We note that recently Boldyreva [4] showed that general gap groups are suffi-cient for constructing multisignatures from BLS signatures.”
• Sequential Aggregate Signatures from Trapdoor Permutations (2004, background): “A signature scheme is (t, qH , qS, )- existentially unforgeable under an adaptive chosen-message attack if no forger (t, qH , qS, )-breaks it.”