On the security notions of signcryption

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

    Abstract

    Libert and Quisquater introduced several strong security notions of signcryptions. Recently, Wang, Manulis, Au and Susilo investigated the relationships among them and showed the key invisibility is the strongest one in a sense that the key invisibility implies the other notions. In this paper, we revisit the WMAS's results. We introduce an intermediate notion called the weak key invisibility and show that the combination of the indistinguishability and the ciphertext anonymity implies the weak key invisibility. We also give a condition so that the weak key invisibility is equivalent to the key invisibility.

    Original languageEnglish
    Title of host publicationProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages231-235
    Number of pages5
    ISBN (Electronic)9784885522925
    Publication statusPublished - 2014 Dec 8
    Event2014 International Symposium on Information Theory and Its Applications, ISITA 2014 - Melbourne, Australia
    Duration: 2014 Oct 262014 Oct 29

    Publication series

    NameProceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

    Other

    Other2014 International Symposium on Information Theory and Its Applications, ISITA 2014
    Country/TerritoryAustralia
    CityMelbourne
    Period14/10/2614/10/29

    ASJC Scopus subject areas

    • Computer Science Applications
    • Information Systems

    Cite this