Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
MetadataShow full item record
The Boneh-Boyen signature scheme is a short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman (SDH) assumption. The primary objective of this thesis is to examine the relationship between the Boneh-Boyen signature scheme and SDH. The secondary objective is to survey surrounding topics such as the generic group model, related signature schemes, intractability assumptions, and the relationship to identity-based encryption (IBE) schemes. Along these lines, we analyze the plausibility of the SDH assumption using the generic bilinear group model. We present the security proofs for the Boneh-Boyen signature scheme, with the addition of a small improvement in one of the probability bounds. Our main contribution is to give the reduction in the reverse direction; that is, to show that if the SDH problem can be solved then the Boneh-Boyen signature scheme can be forged. This contribution represents the first known proof of equivalence between the SDH problem and Boneh-Boyen signatures. We also discuss the algorithm of Cheon for solving the SDH problem. We analyze the implications of Cheon's algorithm for the security of the Boneh-Boyen signature scheme, accompanied by a brief discussion on how to counter the attack.
Cite this version of the work
Kayo Yoshida (2009). Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem. UWSpace. http://hdl.handle.net/10012/4219
Showing items related by title, author, creator and subject.
Knapp, Edward (University of Waterloo, 2009-01-21)In 2001, Boneh, Lynn, and Shacham presented a pairing-based signature scheme known as the BLS signature scheme. In 2003, Boneh, Gentry, Lynn, and Shacham presented the first aggregate signature scheme called the BGLS ...
Carignan-Dugas, Arnaud (University of Waterloo, 2019-09-17)The construction of large scale quantum computing devices might be one of the most exciting and promising endeavors of the 21st century, but it also comes with many challenges. As quantum computers are supplemented with ...
Tasbihi, Amir (University of Waterloo, 2016-08-30)In a CDMA or SCMA system, users can use a fixed signature for the whole transmission interval. But there is the possibility for two users to have highly correlated signatures. Hence, high interference exists in the system, ...