Earticle

초록

영어

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

키워드

저자

• Odule [ Department of Mathematical Sciences, Olabisi Onabanjo University ] Correspondence author
• Tola John [ Department of Mathematical Sciences, Olabisi Onabanjo University ]
• Olatubosun Abiodun Kaka [ Department of Computer Science, Tai Solarin College of Education ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605