원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.6 No.4
2012.10
pp.119-130
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
This study describes a modular arithmetic-based signing scheme called NDSP which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing, verification takes one RSA encryption plus some hashing, and the size of the signature is the size of the modulus. Assuming the underlying hash functions are ideal, our schemes are not only provably secure, but are so in a tight way— an ability to forge signatures with a certain amount of computational resources implies the ability to invert RSA (on the same size modulus) with about the same computational effort.
목차
Abstract
1. Introduction
1.1 Full Domain Hash Scheme
1.2 Related Work
2. Notations and Definitions
2.1 Signature Schemes
2.2 Security of Signature Schemes
2.3 Approach to Reductions
3. The Full-Domain-Hash Scheme – FDH
4. A Non-deterministic Digital Signature Protocol (NDSP)
4.1 Description of the NDSP
4.2 Security of the Nondeterministic Signature Protocol
5. Conclusion
Acknowledgements
References
1. Introduction
1.1 Full Domain Hash Scheme
1.2 Related Work
2. Notations and Definitions
2.1 Signature Schemes
2.2 Security of Signature Schemes
2.3 Approach to Reductions
3. The Full-Domain-Hash Scheme – FDH
4. A Non-deterministic Digital Signature Protocol (NDSP)
4.1 Description of the NDSP
4.2 Security of the Nondeterministic Signature Protocol
5. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보