Efficient Rabin-type Digital Signature Scheme

Authors:
Kaoru Kurosawa;Wakaha Ogata
Affiliations:
Department of Electrical and Electronic Engineering, Faculty of Engineering, Tokyo Institute of Technology, 2–12–1 O-okayama, Meguro-ku, Tokyo 152–8552, Japan;Department of Computer Engineering, Faculty of Engineering, Himeji Institute of Technology, 2167 Shosha, Himeji, Hyogo 671-2201, Japan
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 6
Cited 4

A course in number theory and cryptography

A course in number theory and cryptography
Public key cryptosystem using a reciprocal number with same intractability as factoring a large number

Cryptologia
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION

DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Efficient public key encryption with smallest ciphertext expansion from factoring

Designs, Codes and Cryptography
Proving tight security for Rabin-Williams signatures

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Relations among security notions for undeniable signature schemes

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
A generalization and a variant of two threshold cryptosystems based on factoring

ISC'07 Proceedings of the 10th international conference on Information Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rabin‘s cryptosystem was proved to be ashard as factorization. However, Rabin‘s digital signature schemesis probabilistic. This paper shows two efficient Rabin typedigital signature schemes, a basic scheme and an improved scheme.Both schemes run much faster than Rabin‘s scheme. They are deterministicand the size of a signature is much smaller than that of a signaturein Rabin‘s scheme. Furthermore, it is proved that, by applyingthe technique of Bellare and Rogaway, the proposed scheme issecure against chosen plaintext attack. More precisely, breakingthe proposed digital signature scheme by chosen plaintext attackis as hard as factoring N.