Loading…

Strongly Secure Certificateless Signature Scheme Supporting Batch Verification

We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each use...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering 2014-01, Vol.2014 (1)
Main Authors: Fan, Chun-I, Ho, Pei-Hsiu, Tseng, Yi-Feng
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53
cites cdi_FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53
container_end_page
container_issue 1
container_start_page
container_title Mathematical problems in engineering
container_volume 2014
creator Fan, Chun-I
Ho, Pei-Hsiu
Tseng, Yi-Feng
description We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each user's signing key, so it can generate a signature which is indistinguishable from the signature generated by the user. This is a serious problem because the property of signature nonrepudiation will not be achieved. In our proposed scheme, it is impossible for PKG to produce a signature which is indistinguishable from any signature produced by a user. Compared with existing signature schemes with batch verification, although our proposed scheme is not the most efficient one, it achieves Girault's level-3 security, while the others have Girault's level-1 or level-2 security only. We also formally prove that the proposed scheme is unforgeable and satisfies Girault's level-3 security based on hard problems.
doi_str_mv 10.1155/2014/854135
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1551105811</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1551105811</sourcerecordid><originalsourceid>FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53</originalsourceid><addsrcrecordid>eNp90E1LxDAQBuAgCq6rJ_9AwYsodTP5anvU4hcseqiKt5KmyW6WbluTFtl_b5Z68uBpBuaZYXgROgd8A8D5gmBgi5QzoPwAzYALGnNgyWHoMWExEPp5jE6832BMgEM6Qy_F4Lp21eyiQqvR6SjXbrDGKjnoRnsfFXbVymE_KdRab0MZ-74Lpl1Fd3JQ6-hDu2nBdu0pOjKy8frst87R-8P9W_4UL18fn_PbZayoEEOcMFMZXjGKiaRGJVCrisiaGQEVMSlwoymrgSoigNQmqwlPhclkik0msorTObqc7vau-xq1H8qt9Uo3jWx1N_oyhAGAeQoQ6MUfuulG14bvghKCp1kCIqjrSSnXee-0KXtnt9LtSsDlPttyn205ZRv01aTXtq3lt_0X_wBSkXhe</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1566589716</pqid></control><display><type>article</type><title>Strongly Secure Certificateless Signature Scheme Supporting Batch Verification</title><source>Publicly Available Content Database</source><source>Wiley_OA刊</source><source>IngentaConnect Journals</source><creator>Fan, Chun-I ; Ho, Pei-Hsiu ; Tseng, Yi-Feng</creator><contributor>Zhou, Jian Guo</contributor><creatorcontrib>Fan, Chun-I ; Ho, Pei-Hsiu ; Tseng, Yi-Feng ; Zhou, Jian Guo</creatorcontrib><description>We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each user's signing key, so it can generate a signature which is indistinguishable from the signature generated by the user. This is a serious problem because the property of signature nonrepudiation will not be achieved. In our proposed scheme, it is impossible for PKG to produce a signature which is indistinguishable from any signature produced by a user. Compared with existing signature schemes with batch verification, although our proposed scheme is not the most efficient one, it achieves Girault's level-3 security, while the others have Girault's level-1 or level-2 security only. We also formally prove that the proposed scheme is unforgeable and satisfies Girault's level-3 security based on hard problems.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2014/854135</identifier><language>eng</language><publisher>New York: Hindawi Publishing Corporation</publisher><subject>Cybersecurity ; Data encryption ; Digital signatures ; Electronic banking ; Generators ; Mathematical analysis ; Mathematical problems ; Network security ; Public Key Infrastructure ; Security ; Signatures ; Verification</subject><ispartof>Mathematical problems in engineering, 2014-01, Vol.2014 (1)</ispartof><rights>Copyright © 2014 Chun-I Fan et al.</rights><rights>Copyright © 2014 Chun-I Fan et al. Chun-I Fan et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53</citedby><cites>FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53</cites><orcidid>0000-0002-7512-1291</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1566589716/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1566589716?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,25731,27901,27902,36989,36990,44566,74869</link.rule.ids></links><search><contributor>Zhou, Jian Guo</contributor><creatorcontrib>Fan, Chun-I</creatorcontrib><creatorcontrib>Ho, Pei-Hsiu</creatorcontrib><creatorcontrib>Tseng, Yi-Feng</creatorcontrib><title>Strongly Secure Certificateless Signature Scheme Supporting Batch Verification</title><title>Mathematical problems in engineering</title><description>We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each user's signing key, so it can generate a signature which is indistinguishable from the signature generated by the user. This is a serious problem because the property of signature nonrepudiation will not be achieved. In our proposed scheme, it is impossible for PKG to produce a signature which is indistinguishable from any signature produced by a user. Compared with existing signature schemes with batch verification, although our proposed scheme is not the most efficient one, it achieves Girault's level-3 security, while the others have Girault's level-1 or level-2 security only. We also formally prove that the proposed scheme is unforgeable and satisfies Girault's level-3 security based on hard problems.</description><subject>Cybersecurity</subject><subject>Data encryption</subject><subject>Digital signatures</subject><subject>Electronic banking</subject><subject>Generators</subject><subject>Mathematical analysis</subject><subject>Mathematical problems</subject><subject>Network security</subject><subject>Public Key Infrastructure</subject><subject>Security</subject><subject>Signatures</subject><subject>Verification</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNp90E1LxDAQBuAgCq6rJ_9AwYsodTP5anvU4hcseqiKt5KmyW6WbluTFtl_b5Z68uBpBuaZYXgROgd8A8D5gmBgi5QzoPwAzYALGnNgyWHoMWExEPp5jE6832BMgEM6Qy_F4Lp21eyiQqvR6SjXbrDGKjnoRnsfFXbVymE_KdRab0MZ-74Lpl1Fd3JQ6-hDu2nBdu0pOjKy8frst87R-8P9W_4UL18fn_PbZayoEEOcMFMZXjGKiaRGJVCrisiaGQEVMSlwoymrgSoigNQmqwlPhclkik0msorTObqc7vau-xq1H8qt9Uo3jWx1N_oyhAGAeQoQ6MUfuulG14bvghKCp1kCIqjrSSnXee-0KXtnt9LtSsDlPttyn205ZRv01aTXtq3lt_0X_wBSkXhe</recordid><startdate>20140101</startdate><enddate>20140101</enddate><creator>Fan, Chun-I</creator><creator>Ho, Pei-Hsiu</creator><creator>Tseng, Yi-Feng</creator><general>Hindawi Publishing Corporation</general><general>Hindawi Limited</general><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-7512-1291</orcidid></search><sort><creationdate>20140101</creationdate><title>Strongly Secure Certificateless Signature Scheme Supporting Batch Verification</title><author>Fan, Chun-I ; Ho, Pei-Hsiu ; Tseng, Yi-Feng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Cybersecurity</topic><topic>Data encryption</topic><topic>Digital signatures</topic><topic>Electronic banking</topic><topic>Generators</topic><topic>Mathematical analysis</topic><topic>Mathematical problems</topic><topic>Network security</topic><topic>Public Key Infrastructure</topic><topic>Security</topic><topic>Signatures</topic><topic>Verification</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fan, Chun-I</creatorcontrib><creatorcontrib>Ho, Pei-Hsiu</creatorcontrib><creatorcontrib>Tseng, Yi-Feng</creatorcontrib><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access Journals</collection><collection>CrossRef</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East &amp; Africa Database</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fan, Chun-I</au><au>Ho, Pei-Hsiu</au><au>Tseng, Yi-Feng</au><au>Zhou, Jian Guo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Strongly Secure Certificateless Signature Scheme Supporting Batch Verification</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2014-01-01</date><risdate>2014</risdate><volume>2014</volume><issue>1</issue><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>We propose a strongly secure certificateless signature scheme supporting batch verification, which makes it possible for a verifier to verify a set of signatures more efficiently than verifying them one by one. In an identity-based digital signature scheme, private key generator (PKG) knows each user's signing key, so it can generate a signature which is indistinguishable from the signature generated by the user. This is a serious problem because the property of signature nonrepudiation will not be achieved. In our proposed scheme, it is impossible for PKG to produce a signature which is indistinguishable from any signature produced by a user. Compared with existing signature schemes with batch verification, although our proposed scheme is not the most efficient one, it achieves Girault's level-3 security, while the others have Girault's level-1 or level-2 security only. We also formally prove that the proposed scheme is unforgeable and satisfies Girault's level-3 security based on hard problems.</abstract><cop>New York</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2014/854135</doi><orcidid>https://orcid.org/0000-0002-7512-1291</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1024-123X
ispartof Mathematical problems in engineering, 2014-01, Vol.2014 (1)
issn 1024-123X
1563-5147
language eng
recordid cdi_proquest_miscellaneous_1551105811
source Publicly Available Content Database; Wiley_OA刊; IngentaConnect Journals
subjects Cybersecurity
Data encryption
Digital signatures
Electronic banking
Generators
Mathematical analysis
Mathematical problems
Network security
Public Key Infrastructure
Security
Signatures
Verification
title Strongly Secure Certificateless Signature Scheme Supporting Batch Verification
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T10%3A32%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Strongly%20Secure%20Certificateless%20Signature%20Scheme%20Supporting%20Batch%20Verification&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Fan,%20Chun-I&rft.date=2014-01-01&rft.volume=2014&rft.issue=1&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2014/854135&rft_dat=%3Cproquest_cross%3E1551105811%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c366t-74fbf5b4302a3fc71dcb2ad4f61b2f815fe34d13c2612df9d2586f9a80f969b53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1566589716&rft_id=info:pmid/&rfr_iscdi=true