Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

By Dan Boneh, Xavier Boyen. Journal of Cryptology, 2008

612 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, Information Systems

View Paper: https://www.semanticscholar.org/paper/4634825ba407273945f4e7d10568afe99ec0a843

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 Geometry and Topology

In Information Systems

Citations in the corpus

The Algebraic Group Model and its Applications (2018, methodology): “Following the generic bound for Boneh and Boyen’s SDH assumption [BB08], we may assume that Adv q -dlog G , B alg ≥ q 2 p − 1 .”
Secure provenance: the essential of bread and butter of data forensics in cloud computing (2010, methodology): “(DBDH Problem) The Decisional Bilinear Di.e-Hellman (DBDH) problem in Gis as follows: Given an element g of G, a tuple (g x ,gy,g z,T ) for unknown x, y, z .”
Verifiable Delegation of Computation over Large Datasets (2011, methodology): “More recently, bilinear versions of the assumptions, starting with the works of Boneh and Boyen [11, 12], were used in several applications (e.g. [23, 15]).”
Pseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in VANETs (2012, methodology): “1) Construction: Our proposed KPSD scheme is based on the Boneh–Boyen short signature [24] and the conditional privacy preservation authentication technology [5], [25], which mainly consists of the following four parts: system initialization; key generation; pseudonym self-delegated generation; and ”
Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings (2019, methodology): “Following the generic bound for Boneh and Boyen’s SDH assumption [20] we may assume that Advq-DLOG bp,Balg ≥ q2 p−1 ; i.”
Short Randomizable Signatures (2016, background): “However, as illustrated by [19, 11, 2], relying on proofs in the generic group model or on non-standard assumptions (themselves proved in this model), allows more efficient constructions.”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “If we require the BB short signature [7] as a SEU signature, the verification key(1) is (u, v) ∈ G(2)1, and the signature is (σ, r) ∈ G1 × Zp.”