Lossy identification schemes from decisional RSA

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

    1 Citation (Scopus)

    Abstract

    Lossy identification schemes derive tightly secure signature schemes via the Fiat-Shamir transformation. There exist several instantiations of lossy identification schemes by using several cryptographic assumptions. In this paper, we propose a new construction of lossy identification scheme from the decisional RSA assumption which are introduced by Groth. Our lossy identification scheme has efficient response algorithm because it requires no modular exponentiation.

    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.
    Pages143-147
    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
    CountryAustralia
    CityMelbourne
    Period14/10/2614/10/29

    ASJC Scopus subject areas

    • Computer Science Applications
    • Information Systems

    Cite this

    Hasegawa, S., & Isobe, S. (2014). Lossy identification schemes from decisional RSA. In Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014 (pp. 143-147). [6979820] (Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014). Institute of Electrical and Electronics Engineers Inc..