The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption

スポンサーリンク

概要

• 論文の詳細を見る

• 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^\times$ 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^\times$ is adaptive pseudo-free with the parametric distribution under the RSA assumption rather than the strong RSA assumption.

著者

• Isobe Shuji

  Graduate School Of Information Sciences Tohoku University

• Shizuya Hiroki

  Graduate School Of Information Sciences Tohoku University

• FUKUMITSU Masayuki

  Graduate School of Information Sciences, Tohoku University

• HASEGAWA Shingo

  Graduate School of Information Sciences, Tohoku University

関連論文

• Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
• On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
• One-Way Functions over Finite Near-Rings
• Digital Money–A Survey
• Distributed Construction of Trust Anchor with the Hyper-Powering Signature Scheme
• The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption
• Distributed Construction of Trust Anchor with the Hyper-Powering Signature Scheme

スポンサーリンク