Short signatures without random oracles and the SDH assumption in bilinear groups

DOI10.1007/s00145-007-9005-7zbMath1140.94373MaRDI QIDQ2425530

Dan Boneh, Xavier Boyen

Publication date: 6 May 2008

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-007-9005-7

zbMATH Keywords

Digital signatures; Standard model; Bilinear pairings; Strong unforgeability

Mathematics Subject Classification ID

94A62: Authentication, digital signatures and secret sharing

Related Items

Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES, An Anonymous Designated Verifier Signature Scheme with Revocation: How to Protect a Company’s Reputation, A Timed-Release Proxy Re-encryption Scheme and Its Application to Fairly-Opened Multicast Communication, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Efficient Dynamic Broadcast Encryption and Its Extension to Authenticated Dynamic Broadcast Encryption, An Efficient On-Line/Off-Line Signature Scheme without Random Oracles, On the Equivalence of Generic Group Models, Discrete logarithm problems with auxiliary inputs, How to achieve non-repudiation of origin with privacy protection in cloud computing, Programmable hash functions and their applications, Efficient selective identity-based encryption without random oracles, Time-selective convertible undeniable signatures with short conversion receipts, PRE: stronger security notions and efficient construction with non-interactive opening, On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited, On the analysis of cryptographic assumptions in the generic ring model, Predicate encryption supporting disjunctions, polynomial equations, and inner products, Elliptic curve cryptography: the serpentine course of a paradigm shift, A Signature Scheme with Efficient Proof of Validity, Towards Restricting Plaintext Space in Public Key Encryption, Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem, Security of Verifiably Encrypted Signatures and a Construction without Random Oracles, Programmable Hash Functions and Their Applications, Divisible On-Line/Off-Line Signatures, On Randomizing Hash Functions to Strengthen the Security of Digital Signatures

Uses Software

• PBC Library

Cites Work

• Short signatures from the Weil pairing
• The Weil pairing, and its efficient calculation
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• Efficient pairing computation on supersingular abelian varieties
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• The Eta Pairing Revisited
• Security Analysis of the Strong Diffie-Hellman Problem
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Reducing elliptic curve logarithms to logarithms in a finite field
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• On the Security of HFE, HFEv- and Quartz
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Elliptic Curve Cryptography
• Public Key Cryptography - PKC 2005
• Public Key Cryptography – PKC 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item