政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/77973

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 109953/140903 (78%)
Visitors : 46056263 Online Users : 1017

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大機構典藏 > 資訊學院 > 資訊科學系 > 期刊論文 > Item 140.119/77973

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/77973

Title:	Strongly secure certificateless short signatures
Authors:	Tso, Raylin 左瑞麟 Susilo, Willy Huang, Xinyi
Contributors:	資科系
Keywords:	Bilinear pairing;Certificateless signature;Random oracle;Short signature;Strongly secure
Date:	2012-06
Issue Date:	2015-08-24 15:20:11 (UTC+8)
Abstract:	Short certificateless signatures have come into limelight in recent years. On the one hand, the property of certificateless eliminates the certificate management problem in traditional PKI and the key-escrow problem in some ID-based signature schemes. On the other hand, due to the short signature length, short certificateless signatures can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones. However, there has been a trade-off between short certificateless signature schemes and their security levels. All existing short certificateless signature schemes can only be proven secure against a normal type adversary rather than a stronger one, who can obtain valid certificateless signatures under public keys replaced by the adversary. In this paper, we solve this open problem by given an efficient strongly secure short certificateless signature scheme. The proposed scheme has the following features. Firstly, it is strongly unforgeable. Secondly, the security can be reduced to the Computational Diffie–Hellman (CDH) assumption – a classic complexity assumption. Lastly, the proposed scheme is provably secure against adversaries with access to a super signing oracle which generates valid certificateless signatures of messages and public keys chosen by the adversary (without providing the corresponding secret values).
Relation:	Journal of Systems and Software, 85(6), 1409-1417
Data Type:	article
DOI 連結:	http://dx.doi.org/10.1016/j.jss.2012.01.016
DOI:	10.1016/j.jss.2012.01.016
Appears in Collections:	[資訊科學系] 期刊論文

Files in This Item:

File	Description	Size	Format
1409-1417.pdf		408Kb	Adobe PDF2	590	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback