A generic construction of tight security signatures in the non-programmable random oracle model

Masayuki Fukumitsu, Shingo Hasegawa

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

    Abstract

    We propose a generic construction of tightly secure signature schemes in the non-programmable random oracle model. Our construction employs the dual-mode commitment and the lossy identification schemes. Since there are many instantiation of lossy identification schemes, we can obtain many tightly secure signature schemes in the non-programmable random oracle model.

    Original languageEnglish
    Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages96-100
    Number of pages5
    ISBN (Electronic)9784885523090
    Publication statusPublished - 2017 Feb 2
    Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
    Duration: 2016 Oct 302016 Nov 2

    Other

    Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
    CountryUnited States
    CityMonterey
    Period16/10/3016/11/2

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Hardware and Architecture
    • Information Systems
    • Signal Processing
    • Library and Information Sciences

    Fingerprint Dive into the research topics of 'A generic construction of tight security signatures in the non-programmable random oracle model'. Together they form a unique fingerprint.

    Cite this