A provably secure short signature scheme based on discrete logarithms
From MaRDI portal
Publication:2456500
DOI10.1016/j.ins.2007.05.039zbMath1134.94010MaRDI QIDQ2456500
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
11T71: Algebraic coding theory; cryptography (number-theoretic aspects)
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94A62: Authentication, digital signatures and secret sharing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient signature generation by smart cards
- Security arguments for digital signatures and blind signatures
- Security Proofs for Signature Schemes
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- A New Signature Scheme Without Random Oracles from Bilinear Pairings
- Short Signature and Universal Designated Verifier Signature Without Random Oracles
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- Short Signatures in the Random Oracle Model
- On the Security of HFE, HFEv- and Quartz
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Finding Collisions in the Full SHA-1
- Public Key Cryptography – PKC 2004
