Tight security for signature schemes without random oracles
From MaRDI portal
Publication:2516531
DOI10.1007/s00145-013-9173-6zbMath1356.94091OpenAlexW2007784833MaRDI QIDQ2516531
Publication date: 3 August 2015
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-013-9173-6
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- EUROCRYPT 2011. 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15--19, 2011. Proceedings
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How (not) to design strong-RSA signatures
- Tight Proofs for Signature Schemes without Random Oracles
- Adaptive Pseudo-free Groups and Applications
- Constant-Size Dynamic k-TAA
- Programmable Hash Functions and Their Applications
- 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
- Advances in Cryptology – CRYPTO 2004
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Proving Tight Security for Rabin-Williams Signatures
- Theory of Cryptography
This page was built for publication: Tight security for signature schemes without random oracles