One-Time Digital Signature and Pseudo k-Time Digital Signature (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In Asiacrypt'96, Bleichenbacher et al. showed the upper limit of the efficiency of one-time digital signature scheme using a directed graph of tree structure as its base. They also claimed that there exists more effective signature scheme on general directed graphs, and showed an example of a method to construct more effective signature schemes as a witness. Unfortunately, their example does not achieve the efficiency as they claimed. This paper shows the upper limit of the efficiency of the signature scheme on general directed graphs by showing no signature scheme is more effective than the optimal signature scheme on trees (or forests). Further, we introduce another signature scheme named pseudo k-timc signature scheme. This signature scheme allows signers to sign k-time which is no less efficient than the one time signature scheme.

• 社団法人電子情報通信学会の論文
• 1998-01-25

著者

• Miyano H

  Yokohama Research Center Telecommunications Advancement Organization Of Japan

• MIYANO Hiroshi

  Yokohama Research Center, Telecommunications Advancement Organization of Japan

• Miyano Hiroshi

  Yokohama Research Center Telecommunications Advancement Organization Of Japan

関連論文

• One-Time Digital Signature and Pseudo k-Time Digital Signature (Special Section on Cryptography and Information Security)
• Addend Dependency of Differential/Linear Probability of Addition (Special Section on Cryptography and Information Security)

スポンサーリンク