A Digital Signature Scheme Based on NP-Complete Lattice Problems

スポンサーリンク

概要

• 論文の詳細を見る

• In [13], we proposed new decision problems related to lattices, and proved their NP-completeness. In this paper, we present a new public-key identification scheme and a digital signature scheme based on one of the problems in [13]. We also prove the security of our schemes under certain assumptions, and analyze the efficiency of ours.

• （社）電子情報通信学会の論文
• 2008-05-01

著者

• Hayashi Shunichi

  Graduate School Of Science And Technology Chiba University

• Tada Mitsuru

  Institute Of Media And Information Technology Chiba University

関連論文

• Provably Secure Multi-signature Scheme with Signers' Intentions
• Probabilistic Multi-Signature Schemes Using a One-Way Trapdoor Permutation(Discrete Mathematics and Its Applications)
• On the Security and the Efficiency of Multi-Signature Schemes Based on a Trapdoor One-Way Permutation(Discrete Mathematics and Its Applications)
• A Secure Multisignature Scheme with Signing Order Verifiability(Special Section on Cryptography and Information Security)
• A Digital Signature Scheme Based on NP-Complete Lattice Problems
• New NP-Complete Problems Associated with Lattices(Discrete Mathematics and Its Applications)

スポンサーリンク