Distributed Construction of Trust Anchor with the Hyper-Powering Signature Scheme

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we explore a strategy for recovering a PKI system without reconstructing the whole one when the trust anchor has been broken. Specifically, we propose two distributed signature schemes based on the hyper-powering discrete logarithm problem, which is a two-dimensional extension of the discrete logarithm problem. We show that these schemes are existentially unforgeable against the adaptively chosen message attack.

著者

• SHIZUYA Hiroki

  Graduate School of Information Sciences, Tohoku University

• Shizuya Hiroki

  Graduate School Of Information Sciences Tohoku University

• KOIZUMI Eisuke

  Graduate School of Information Sciences, Tohoku University

• MINAGAWA Marika

  Graduate School of Information Sciences, Tohoku University

関連論文

• 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

スポンサーリンク