Aggregate and Verifiably Encrypted Signatures from Bilinear Maps

By Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham. International Conference on the Theory and Application of Cryptographic Techniques, 2003

2,058 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/dab56166e49905226ded911a135f239f27de97bc

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

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”
Security and privacy for storage and computation in cloud computing (2014, methodology): “Scheme Individual verify Batch verify RSA g TRSA NA ECDSA g TECDSA NA BGLS [7] 2g Tpair (g + 1) Tpair Our scheme 2g Tpair 2 Tpair L.”
Remote data checking using provable data possession (2011, methodology): “We emphasize that techniques based on aggregate signatures [Boneh et al. 2003]; multi-signatures [Micali et al. 2001; Okamoto 1988]; batch RSA [Fiat 1990]; batch veri.cation of RSA [Harn 1998; Bellare et al. 1998]; condensed RSA [Mykletun et al. 2004], etc, would all fail to provide blockless…”
Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing (2010, methodology): “A bilinear map is a map e : G1×G2 → GT with the following properties [15]: 1) Computable: there”
Efficient Identity-Based Signatures Secure in the Standard Model (2006, background): “The above game can easily be extended to cover strong unforgeability [ ADR02 ] by changing the third requirement in the forgery stage to “ was not output as a response to a sign query”.”
Security Proofs for Identity-Based Identification and Signature Schemes (2008, background): “4 with signature schemes permitting aggregation [14] will reduce the communication costs.”
A Survey of Provably Secure Searchable Encryption (2014, neutral): “The authors would like to thank Luan Ibraimi, Arjan Jeckmans, Eleftheria Makri, and the anonymous reviewers for their insightful comments.”
Named Data Networking (NDN) Project (2010, neutral): “[68]), techniques that allow semi-trusted proxies to sign on behalf of weak devices [25, 26, 24], as well as methods for aggregate signature generation and verification (from simple and efficient Merkle Hash Trees (MHTs) [60] to recent cryptographic research using bilinear maps over elliptic curves ”
Query Execution Assurance for Outsourced Databases (2005, background): “Different signature schemes (DSA, RSA, Merkle trees [27] and BGLS [9]) are explored as potential alternatives for data authentication primitives (corresponding to our identity-hash mechanism).”
Public Key Encryption with Keyword Search Revisited (2008, methodology): “Proposed Scheme. In this section we describe our secure channel free PEKS scheme based on the aggregation technique proposed in [ 5 ].”
Provable data possession at untrusted stores (2007, methodology): “We emphasize that techniques based on aggregate signatures [13], multi-signatures [33, 38], batch RSA [18], batch verification of RSA [22, 4], condensed RSA [36], etc.”
Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing (2009, methodology): “The key idea is to use the bilinear aggregate signature scheme [ 18 ], which has the following property: for any u1, u2, v ∈ G, e(u1u2, v) = e(u1, v) � e(u2, v) and for any u, v ∈ G, e(ψ(u), v) = e(ψ(v), u). As in the BLS scheme, the aggregate signature scheme allows the creation of signatures on ar”
Preserving data integrity for smart grid data aggregation (2012, methodology): “The basis of our approach is the bilinear map [21].”
An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks (2008, methodology): “Next, we compare the proposed IBV scheme with ECDSA and BLS [22], [36] in terms of the verification delay.”
Multi-signatures in the plain public-Key model and a general forking lemma (2006, background): “However, [12] also suggest a workaround to the message distinctness assumption.”