The RSA Group is adaptive pseudo-free under the RSA assumption

    研究成果: Article査読

    2 被引用数 (Scopus)

    抄録

    The notion of pseudo-free groups was first introduced and formalized by Hohenberger and Rivest in order to unify cryptographic assumptions. Catalano, Fiore and Warinschi proposed a generalized notion called adaptive pseudo-free groups, and showed that the RSA group Z × N is adaptive pseudo-free with some specific parametric distribution under the strong RSA assumption. In this paper, we develop an alternative parametric distribution and show that the RSA group Z × N is adaptive pseudo-free with the parametric distribution under the RSA assumption rather than the strong RSA assumption. Copyright c

    本文言語English
    ページ(範囲)200-214
    ページ数15
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E97-A
    1
    DOI
    出版ステータスPublished - 2014 1

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    フィンガープリント 「The RSA Group is adaptive pseudo-free under the RSA assumption」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル