A signcryption scheme based on integer factorization

Ron Steinfeld, Yuliang Zheng

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

69 Citations (Scopus)

Abstract

Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and non-repudiatable origin authenticity, at a lower computational and communication overhead cost than the conventional `sign-then-encrypt' approach. We propose a new signcryption scheme which gives a partial solution to an open problem posed by Zheng, namely to find a signcryption scheme based on the integer factorization problem. In particular, we prove that our scheme is existentially unforgeable, in the random oracle model, subject to the assumption that factoring an RSA modulus N = pq (with p and q prime) is hard even when given the additional pair (g; S), where is an asymmetric basis of large order less than a bound.

Original languageEnglish
Title of host publicationInformation Security - 3rd International Workshop, ISW 2000, Proceedings
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages308-322
Number of pages15
Volume1975
ISBN (Print)3540414169, 9783540414162
Publication statusPublished - 2000
Event3rd International Workshop on Information Security, ISW 2000 - Wollongong, Australia
Duration: 20 Dec 200021 Dec 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1975
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other3rd International Workshop on Information Security, ISW 2000
CountryAustralia
CityWollongong
Period20/12/0021/12/00

Fingerprint Dive into the research topics of 'A signcryption scheme based on integer factorization'. Together they form a unique fingerprint.

Cite this