Short signatures from Diffie-Hellman: realizing almost compact public key

DOI10.1007/s00145-016-9234-8zbMath1377.94072OpenAlexW2503130960MaRDI QIDQ2408586

Jae Hong Seo

Publication date: 12 October 2017

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

Full work available at URL: https://doi.org/10.1007/s00145-016-9234-8

zbMATH Keywords

standard modeldigital signaturecomputational Diffie-Hellman

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Efficient digital signatures from RSA without random oracles ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programmable hash functions and their applications
• Efficient selective identity-based encryption without random oracles
• Comparing two pairing-based aggregate signature schemes
• Efficient signature generation by smart cards
• Short signatures from the Weil pairing
• Confined guessing: new signatures from standard assumptions
• Short signatures from Diffie-Hellman: realizing almost compact public key
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Waters Signatures with Optimal Security Reduction
• Space Efficient Signature Schemes from the RSA Assumption
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Short Signatures from Weaker Assumptions
• How Risky Is the Random-Oracle Model?
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Short and Stateless Signatures from the RSA Assumption
• New Generation of Secure and Practical RSA-Based Signatures
• Trapdoors for hard lattices and new cryptographic constructions
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Secure Hash-and-Sign Signatures Without the Random Oracle
• The Cramer-Shoup Strong-RSA Signature Scheme Revisited
• Shorter IBE and Signatures via Asymmetric Pairings
• Practical Signatures from Standard Assumptions
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Advances in Cryptology - CRYPTO 2003
• On the Generic Insecurity of the Full Domain Hash
• Theory of Cryptography
• Discrete logarithm problems with auxiliary inputs

This page was built for publication: Short signatures from Diffie-Hellman: realizing almost compact public key