Identity-Based Deterministic Signature Scheme without Forking-Lemma
From MaRDI portal
Publication:3098000
DOI10.1007/978-3-642-25141-2_6zbMath1344.94084OpenAlexW2131362130MaRDI QIDQ3098000
S. Sree Vivek, S. Sharmila Deva Selvi, C. Pandu Rangan
Publication date: 10 November 2011
Published in: Advances in Information and Computer Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25141-2_6
signaturedeterministicprovable securityforking lemmaidentity-based cryptographyrandom oracle modeltight security
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security proofs for identity-based identification and signature schemes
- Improving the exact security of digital signature schemes
- Short signatures from the Weil pairing
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Security Proofs for Signature Schemes
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Identity-Based Cryptosystems and Signature Schemes
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
- Public Key Cryptography – PKC 2004
This page was built for publication: Identity-Based Deterministic Signature Scheme without Forking-Lemma