Efficient Trapdoor Commitment as Secure as Factoring with Useful Properties
- Authors
- Youn, Taek-Young; Park, Young-Ho; Lim, Jongin
- Issue Date
- Dec-2009
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- security; trapdoor commitment; key exposure freeness; strong trapdoor opening; integer factoring problem
- Citation
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, v.E92D, no.12, pp.2520 - 2523
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- Volume
- E92D
- Number
- 12
- Start Page
- 2520
- End Page
- 2523
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/118879
- DOI
- 10.1587/transinf.E92.D.2520
- ISSN
- 0916-8532
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.