A signcryption scheme based on integer factorization

Ron Steinfeld, Yuliang Zheng

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    72 Citations (Scopus)


    Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable 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 g ∈ ℤ* N is an asymmetric basis of large order less than a bound S/2 ≪ √N.
    Original languageEnglish
    Title of host publicationInformation Security
    Subtitle of host publicationThird International Workshop, ISW 2000 Wollongong, Australia, December 20-21, 2000 Proceedings
    EditorsJosef Pieprzyk, Eiji Okamoto, Jennifer Seberry
    Place of PublicationBerlin Germany
    Number of pages15
    ISBN (Print)3540414169
    Publication statusPublished - 2000
    EventInformation Security Workshop 2000 - Wollongong, Australia
    Duration: 20 Dec 200021 Dec 2000
    Conference number: 3rd
    https://link.springer.com/book/10.1007%2F3-540-44456-4 (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferenceInformation Security Workshop 2000
    Abbreviated titleISW 2000
    Internet address

    Cite this