Efficient Trapdoor Commitment as Secure as Factoring with Useful Properties

スポンサーリンク

概要

• 論文の詳細を見る

• Trapdoor commitment schemes are widely used for adding valuable properties to ordinary signatures or enhancing the security of weakly secure signatures. In this letter, we propose a trapdoor commitment scheme based on RSA function, and prove its security under the hardness of the integer factoring. Our scheme is very efficient in computing a commitment. Especially, it requires only three multiplications for evaluating a commitment when e=3 is used as a public exponent of RSA function. Moreover, our scheme has two useful properties, key exposure freeness and strong trapdoor opening, which are useful for designing secure chameleon signature schemes and converting a weakly secure signature to a strongly secure signature, respectively.

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

著者

• Park Young‐ho

  Sejong Cyber Univ. Seoul Kor

• Park Young-ho

  The Faculty Of The Department Of Information Security Sejong Cyber University

• Park Young-ho

  Dept. Of Information Security Sejong Cyber Univ.

• LIM Jongin

  Graduate School of Information Management and Security (CIST)

• Park Young-ho

  Dept. Of Information Security Systems Sejong Cyber University

• YOUN Taek-Young

  Graduate School of Information Management and Security, Korea University

• Youn Taek‐young

  Graduate School Of Information Management And Security Korea University

• Lim Jongin

  Graduate School Of Information Management And Security Korea University

• Youn Taek-young

  Graduate School Of Information Management And Security Korea University

関連論文

• Impersonation Attack on a Strong ID-Based Key Distribution
• Efficient Trapdoor Commitment as Secure as Factoring with Useful Properties
• An Efficient Signature Scheme with Fast Online Signing
• Efficient Flexible Batch Signing Techniques for Imbalanced Communication Applications
• New Hardware Architecture for Multiplication over GF(2^m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
• Enhanced Exhaustive Search Attack on Randomized BSD Type Countermeasure(Discrete Mathematics and Its Applications)
• Partial Key Exposure Attacks on Unbalanced RSA with the CRT (Information Security)
• Security Vulnerability of ID-Based Key Sharing Schemes

スポンサーリンク