A New Provably Secure Signature Scheme(Information Security)(<Special Section>Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we construct a new signature scheme which is provably secure against adaptive chosen message attack in the standard model under the strong RSA assumption. The proposed scheme is different from Cramer-Shoup scheme and Camenisch-Lysyanskaya scheme and is more efficient than them. The tradeoff of the proposed scheme is a slight increase of the secret key.

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

著者

• Yi X

  School Of Computer Sci. And Mathematics Victoria Aus

• Siew Chee-kheong

  School Of Electrical & Electronic Engineering Nanyang Technological University

• TAN Chik-How

  the School of Electrical & Electronic Engineering, Nanyang Technological University

• YI Xun

  the School of Electrical & Electronic Engineering, Nanyang Technological University

• SIEW Chee-Kheong

  the School of Electrical & Electronic Engineering, Nanyang Technological University

• Tan C‐h

  Nanyang Technological Univ. Singapore

関連論文

• On Diffie-Hellman Problems in 3rd Order Shift Register(Discrete Mathematics and Its Applications)
• A New Provably Secure Signature Scheme(Information Security)(Information Theory and Its Applications)
• On the n-th Order Shift Register Based Discrete Logarithm
• New Signature Schemes Based on 3rd Order Shift Registers(Special Section on Cryptography and Information Security)

スポンサーリンク