Short Signatures Without Random Oracles

By Dan Boneh, Xavier Boyen. 2004

1,488 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

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, methodology): “They show that their scheme can be instantiated securely using both RSA accumulators [59] and the Boneh-Boyen signature scheme [60].”
Geppetto: Versatile Verifiable Computation (2015, background): “Assumption 3 (q-SDH [15, 31]) The q-strong Diffie-Hellman (q-SDH) assumption holds for G if for all A:”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, background): “original assumption proposed in the Eurocrypt 2004 extended abstract [9].”
Attribute-Based Signatures (2011, methodology): “We identify Z∗p with the universe of attributes, where p is the size of the cyclic group used in the scheme.4 Boneh-Boyen signatures We briefly review the Boneh-Boyen digital signature scheme [8].”
Constant-Size Dynamic k-TAA (2006, neutral): “The q-SDH assumption is shown to be true in the generic group model [2].”
Group signatures with verifier-local revocation (2004, background): “Revocation is critical in such systems if the private key in a TCG chip is exposed, all signatures from that chip must be invalidated since otherwise attestation becomes meaningless.”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “y-Decisional Diffie-Hellman Inversion (y-DDHI) [5, 32]: Suppose that g ∈ G is a random generator of order q ∈ Θ(2).”
A Verifiable Random Function with Short Proofs and Keys (2005, methodology): “u t It turns out that in a generic group model algorithm A that solves the qDBDHI problem has advantage, which is roughly twice as much as an advantage of an algorithm solving the q-SDH problem (see [4], Section 5).”
Additive Combinatorics and Discrete Logarithm Based Range Protocols (2010, methodology): “Definition 3 (Strong Diffie-Hellman Assumption [3]).”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, methodology): “Argument Sketch: This claim can be verified by inspecting the generic-group argument for the computational q-DHI problem on a prime-order group given in [4], because generic arguments for decisional rather than computational problems are identical, and all that this specific argument requires is tha”
Structure-Preserving Signatures and Commitments to Group Elements (2010, methodology): “Our last assumption is a variant of the q-strong Diffie–Hellman (SDH) assumption [22].”
GSIS: A Secure and Privacy-Preserving Protocol for Vehicular Communications (2007, background): “Furthermore, we assume that the strong Diffie–Hellman (SDH) assumption holds on (G1,G2) and that the linear Diffie–Hellman assumption holds on G1 [33].”
Efficient Identity-Based Signatures Secure in the Standard Model (2006, methodology): “This technique was used by Boneh, Lynn and Shacham [BLS04] to construct short signatures from the IBE scheme of Boneh and Franklin [BF01], and likewise by Boneh and Boyen to obtain another short signature scheme [ BB04c ] from an IBE scheme due to the same authors [BB04a].”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, methodology): “We instantiate the signature scheme used for signing the gi with a variant of the weakly secure Boneh-Boyen scheme [24].”