Generic security-amplifying methods of ordinary digital signatures

Authors:
Jin Li;Kwangjo Kim;Fangguo Zhang;Duncan S. Wong
Affiliations:
International Research center for Information Security, Information and Communications University, Daejeon, Korea;International Research center for Information Security, Information and Communications University, Daejeon, Korea;School of Information Science and Technology, Sun Yat-Sen University, Guangzhou, P.R. China;Department of Computer Science, City University of Hong Kong, Hong Kong, China
Venue:
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Year:
2008

Citing 23
Cited 2

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks

SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The longtime behavior of solutions to a quasilinear combustion model

Nonlinear Analysis: Theory, Methods & Applications
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption

ACM Transactions on Information and System Security (TISSEC)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Twin signatures: an alternative to the hash-and-sign paradigm

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
The BiBa one-time signature and broadcast authentication protocol

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Escure Signature Schemes based on Interactive Protocols

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
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
Secure hash-and-sign signatures without the random oracle

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Security analysis of the Gennaro-Halevi-Rabin signature scheme

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A simpler construction of CCA2-secure public-key encryption under general assumptions

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A signature scheme as secure as the Diffie-Hellman problem

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strongly unforgeable signatures based on computational diffie-hellman

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A generic construction of secure signatures without random oracles

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
A practical and tightly secure signature scheme without hash function

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
How to strengthen any weakly unforgeable signature into a strongly unforgeable signature

CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology

Short generic transformation to strongly unforgeable signature in the standard model

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Generic security-amplifying methods of ordinary digital signatures

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), from any signatures satisfy only a weak security notion called existentially unforgeable against weak chosen message attacks (weakly-secure, in short). The new transformations from a weakly-secure signature scheme to fullysecure signature scheme are generic, simple, and provably secure in the standard model. Moreover, these two new paradigms are built only on weakly-secure signatures. They are different from the previous methods, which also relied on some other cryptographic protocols or non-standard models. By using two new paradigms, several efficient instantiations without random oracles are also presented, which are based on two previous weakly-secure signature schemes. These fully-secure signature schemes have many special interesting properties compared with the previous related signature schemes.