Efficient trapdoor commitment as secure as factoring with useful properties

Taek Young Youn, Young Ho Park, Jong In Lim

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)2520-2523
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE92-D
Issue number12
DOIs
Publication statusPublished - 2009 Dec 1

Fingerprint

Hardness

Keywords

  • Integer factoring problem
  • Key exposure freeness
  • Security
  • Strong trapdoor opening
  • Trapdoor commitment

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Software
  • Artificial Intelligence
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

Cite this

Efficient trapdoor commitment as secure as factoring with useful properties. / Youn, Taek Young; Park, Young Ho; Lim, Jong In.

In: IEICE Transactions on Information and Systems, Vol. E92-D, No. 12, 01.12.2009, p. 2520-2523.

Research output: Contribution to journalArticle

@article{a097706454b246b5a9d053a8214dfcaf,
title = "Efficient trapdoor commitment as secure as factoring with useful properties",
abstract = "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.",
keywords = "Integer factoring problem, Key exposure freeness, Security, Strong trapdoor opening, Trapdoor commitment",
author = "Youn, {Taek Young} and Park, {Young Ho} and Lim, {Jong In}",
year = "2009",
month = "12",
day = "1",
doi = "10.1587/transinf.E92.D.2520",
language = "English",
volume = "E92-D",
pages = "2520--2523",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Efficient trapdoor commitment as secure as factoring with useful properties

AU - Youn, Taek Young

AU - Park, Young Ho

AU - Lim, Jong In

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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.

AB - 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.

KW - Integer factoring problem

KW - Key exposure freeness

KW - Security

KW - Strong trapdoor opening

KW - Trapdoor commitment

UR - http://www.scopus.com/inward/record.url?scp=77950257265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950257265&partnerID=8YFLogxK

U2 - 10.1587/transinf.E92.D.2520

DO - 10.1587/transinf.E92.D.2520

M3 - Article

AN - SCOPUS:77950257265

VL - E92-D

SP - 2520

EP - 2523

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 12

ER -