A provably secure short signature scheme based on discrete logarithms

DOI10.1016/J.INS.2007.05.039MaRDI QIDQ2456500zbMATH OpenOpenAlexFDO

Authors Zuhua Shao

Publication date 18 October 2007

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2007.05.039

zbMATH Keywords

random oracle modelreductionist security proof

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• scientific article; zbMATH DE number 2081084
• Short signatures from the Weil pairing
• Publication:4502515
• scientific article; zbMATH DE number 2009970
• Enhanced short signature scheme with hybrid problems

Cites work

• scientific article; zbMATH DE number 1617933 (Why is no real title available?)
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1759351 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A new signature scheme without random oracles from bilinear pairings
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient signature generation by smart cards
• Finding Collisions in the Full SHA-1
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• New directions in cryptography
• On the Security of HFE, HFEv- and Quartz
• Public Key Cryptography – PKC 2004
• Security arguments for digital signatures and blind signatures
• Security proofs for signature schemes
• Short Signature and Universal Designated Verifier Signature Without Random Oracles
• Short Signatures in the Random Oracle Model
• The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
• The exact security of digital signatures -- how to sign with RSA and Rabin

Cited in

(9)

• Strong Designated Verifier Signature Scheme Based on Discrete Logarithm Problem
• An efficient ID-based cryptographic transformation model for extended chaotic-map-based cryptosystem
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• Security properties of one ``short signature scheme
• Enhanced short signature scheme with hybrid problems
• Short signatures from the Weil pairing
• Efficient generic on-line/off-line (threshold) signatures without key exposure
• An approach to shorten digital signature length

This page was built for publication: A provably secure short signature scheme based on discrete logarithms

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