Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem

DOI10.1007/978-3-642-03298-1_1MaRDI QIDQ3392897zbMATH OpenOpenAlexFDO

Authors David D. Yao, Kayo Yoshida

Publication date 18 August 2009

Published in Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03298-1_1

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2009970
• Public Key Cryptography - PKC 2006
• Signcryption schemes based on the Diffie-Hellman problem
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Boneh-Boyen encryption and signature scheme on the Jacobian of a hyperelliptic curve
• On the security of the verifiably-encrypted signature scheme of Boneh, Gentry, Lynn and Shacham
• Security in Communication Networks
• On tight security proofs for Schnorr signatures
• On tight security proofs for Schnorr signatures
• The Diffie-Hellman problem and generalization of Verheul's theorem

Cites work

• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Another look at generic groups
• Another look at non-standard discrete log and Diffie-Hellman problems
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• On random walks for Pollard's rho method
• Pairing-Friendly Elliptic Curves of Prime Order
• Pairings for cryptographers
• Public Key Cryptography - PKC 2005
• Remarks on Cheon’s Algorithms for Pairing-Related Problems
• Security Analysis of the Strong Diffie-Hellman Problem
• Short signatures without random oracles and the SDH assumption in bilinear groups
• The Uber-Assumption Family

Cited in

(10)

• Boneh et al.'s \(k\)-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption
• The random oracle model: a twenty-year retrospective
• Digital signatures
• Revisiting BBS signatures
• Verifiable random functions from standard assumptions
• A reduction of security notions in designated confirmer signatures
• Optimal generic attack against basic Boneh-Boyen signatures
• Computing interval discrete logarithm problem with restricted jump method
• Computing discrete logarithms in an interval
• Discrete logarithm problems with auxiliary inputs

Describes a project that uses

Uses Software

• Magma
• PBC Library

This page was built for publication: Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392897)