Generalization of perfect concurrent signatures
Recently, Susilo et al.'s perfect concurrent signature scheme (PCS1) and Wang et al.'s improved perfect concurrent signature scheme (iPCS1) are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generi...
Gespeichert in:
| Veröffentlicht in: | Journal of China universities of posts and telecommunications 2012-12, Vol.19 (6), p.94-104 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 104 |
|---|---|
| container_issue | 6 |
| container_start_page | 94 |
| container_title | Journal of China universities of posts and telecommunications |
| container_volume | 19 |
| creator | YE, Qing ZHENG, Shi-hui GUO, Hong-fu YANG, Yi-xian |
| description | Recently, Susilo et al.'s perfect concurrent signature scheme (PCS1) and Wang et al.'s improved perfect concurrent signature scheme (iPCS1) are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.'s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given. |
| doi_str_mv | 10.1016/S1005-8885(11)60323-3 |
| format | Article |
| fullrecord | <record><control><sourceid>wanfang_jour_proqu</sourceid><recordid>TN_cdi_wanfang_journals_zgydgxxb_e201206014</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><wanfj_id>zgydgxxb_e201206014</wanfj_id><els_id>S1005888511603233</els_id><sourcerecordid>zgydgxxb_e201206014</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2414-446c6a82198280c729f9416a70f1bad009d6bb4f6cb939daecaa4257d11fef013</originalsourceid><addsrcrecordid>eNqFkEFLwzAUx3tQcE4_gtDjROry0jRtTyJDpyB4UM8hTV9KRpfMpNVtn95uFa-eHjx-___j_aLoCsgtEODzNyAkS4qiyGYA15ykNE3Sk2jytz6LzkNYEcIoJXwSzZdo0cvW7GVnnI2djjfoNaouVs6q3nu0XRxMY2XXewwX0amWbcDL3zmNPh4f3hdPycvr8nlx_5IoyoAljHHFZUGhLGhBVE5LXTLgMicaKlkTUta8qpjmqirTspaopGQ0y2sAjZpAOo1uxt5vabW0jVi53tvhotg3u7rZbiuBlMDwAwE20LOR3nj32WPoxNoEhW0rLbo-CKBFynNgUA5oNqLKuxA8arHxZi39TgARB4XiqFAcXAkAcVQo0iF3N-Zw-PrLoBdBGbQKa-MHW6J25p-GH6hFebM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1283671419</pqid></control><display><type>article</type><title>Generalization of perfect concurrent signatures</title><source>Alma/SFX Local Collection</source><creator>YE, Qing ; ZHENG, Shi-hui ; GUO, Hong-fu ; YANG, Yi-xian</creator><creatorcontrib>YE, Qing ; ZHENG, Shi-hui ; GUO, Hong-fu ; YANG, Yi-xian</creatorcontrib><description>Recently, Susilo et al.'s perfect concurrent signature scheme (PCS1) and Wang et al.'s improved perfect concurrent signature scheme (iPCS1) are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.'s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given.</description><identifier>ISSN: 1005-8885</identifier><identifier>DOI: 10.1016/S1005-8885(11)60323-3</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Algorithms ; China ; Concretes ; fair exchange ; generalization ; perfect concurrent signature ; Proving ; Schnorr ; Security ; Signatures ; Telecommunications ; variant</subject><ispartof>Journal of China universities of posts and telecommunications, 2012-12, Vol.19 (6), p.94-104</ispartof><rights>2012 The Journal of China Universities of Posts and Telecommunications</rights><rights>Copyright © Wanfang Data Co. Ltd. All Rights Reserved.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2414-446c6a82198280c729f9416a70f1bad009d6bb4f6cb939daecaa4257d11fef013</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://www.wanfangdata.com.cn/images/PeriodicalImages/zgydgxxb-e/zgydgxxb-e.jpg</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>YE, Qing</creatorcontrib><creatorcontrib>ZHENG, Shi-hui</creatorcontrib><creatorcontrib>GUO, Hong-fu</creatorcontrib><creatorcontrib>YANG, Yi-xian</creatorcontrib><title>Generalization of perfect concurrent signatures</title><title>Journal of China universities of posts and telecommunications</title><description>Recently, Susilo et al.'s perfect concurrent signature scheme (PCS1) and Wang et al.'s improved perfect concurrent signature scheme (iPCS1) are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.'s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given.</description><subject>Algorithms</subject><subject>China</subject><subject>Concretes</subject><subject>fair exchange</subject><subject>generalization</subject><subject>perfect concurrent signature</subject><subject>Proving</subject><subject>Schnorr</subject><subject>Security</subject><subject>Signatures</subject><subject>Telecommunications</subject><subject>variant</subject><issn>1005-8885</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNqFkEFLwzAUx3tQcE4_gtDjROry0jRtTyJDpyB4UM8hTV9KRpfMpNVtn95uFa-eHjx-___j_aLoCsgtEODzNyAkS4qiyGYA15ykNE3Sk2jytz6LzkNYEcIoJXwSzZdo0cvW7GVnnI2djjfoNaouVs6q3nu0XRxMY2XXewwX0amWbcDL3zmNPh4f3hdPycvr8nlx_5IoyoAljHHFZUGhLGhBVE5LXTLgMicaKlkTUta8qpjmqirTspaopGQ0y2sAjZpAOo1uxt5vabW0jVi53tvhotg3u7rZbiuBlMDwAwE20LOR3nj32WPoxNoEhW0rLbo-CKBFynNgUA5oNqLKuxA8arHxZi39TgARB4XiqFAcXAkAcVQo0iF3N-Zw-PrLoBdBGbQKa-MHW6J25p-GH6hFebM</recordid><startdate>201212</startdate><enddate>201212</enddate><creator>YE, Qing</creator><creator>ZHENG, Shi-hui</creator><creator>GUO, Hong-fu</creator><creator>YANG, Yi-xian</creator><general>Elsevier Ltd</general><general>Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China%School of Aerospace Engineering, Beijing Institute of Technology, Beijing 100081, China</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>2B.</scope><scope>4A8</scope><scope>92I</scope><scope>93N</scope><scope>PSX</scope><scope>TCJ</scope></search><sort><creationdate>201212</creationdate><title>Generalization of perfect concurrent signatures</title><author>YE, Qing ; ZHENG, Shi-hui ; GUO, Hong-fu ; YANG, Yi-xian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2414-446c6a82198280c729f9416a70f1bad009d6bb4f6cb939daecaa4257d11fef013</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>China</topic><topic>Concretes</topic><topic>fair exchange</topic><topic>generalization</topic><topic>perfect concurrent signature</topic><topic>Proving</topic><topic>Schnorr</topic><topic>Security</topic><topic>Signatures</topic><topic>Telecommunications</topic><topic>variant</topic><toplevel>online_resources</toplevel><creatorcontrib>YE, Qing</creatorcontrib><creatorcontrib>ZHENG, Shi-hui</creatorcontrib><creatorcontrib>GUO, Hong-fu</creatorcontrib><creatorcontrib>YANG, Yi-xian</creatorcontrib><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Wanfang Data Journals - Hong Kong</collection><collection>WANFANG Data Centre</collection><collection>Wanfang Data Journals</collection><collection>万方数据期刊 - 香港版</collection><collection>China Online Journals (COJ)</collection><collection>China Online Journals (COJ)</collection><jtitle>Journal of China universities of posts and telecommunications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>YE, Qing</au><au>ZHENG, Shi-hui</au><au>GUO, Hong-fu</au><au>YANG, Yi-xian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Generalization of perfect concurrent signatures</atitle><jtitle>Journal of China universities of posts and telecommunications</jtitle><date>2012-12</date><risdate>2012</risdate><volume>19</volume><issue>6</issue><spage>94</spage><epage>104</epage><pages>94-104</pages><issn>1005-8885</issn><abstract>Recently, Susilo et al.'s perfect concurrent signature scheme (PCS1) and Wang et al.'s improved perfect concurrent signature scheme (iPCS1) are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.'s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. Security proofs and efficiency analysis are also given.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/S1005-8885(11)60323-3</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1005-8885 |
| ispartof | Journal of China universities of posts and telecommunications, 2012-12, Vol.19 (6), p.94-104 |
| issn | 1005-8885 |
| language | eng |
| recordid | cdi_wanfang_journals_zgydgxxb_e201206014 |
| source | Alma/SFX Local Collection |
| subjects | Algorithms China Concretes fair exchange generalization perfect concurrent signature Proving Schnorr Security Signatures Telecommunications variant |
| title | Generalization of perfect concurrent signatures |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T19%3A10%3A32IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wanfang_jour_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Generalization%20of%20perfect%20concurrent%20signatures&rft.jtitle=Journal%20of%20China%20universities%20of%20posts%20and%20telecommunications&rft.au=YE,%20Qing&rft.date=2012-12&rft.volume=19&rft.issue=6&rft.spage=94&rft.epage=104&rft.pages=94-104&rft.issn=1005-8885&rft_id=info:doi/10.1016/S1005-8885(11)60323-3&rft_dat=%3Cwanfang_jour_proqu%3Ezgydgxxb_e201206014%3C/wanfang_jour_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1283671419&rft_id=info:pmid/&rft_wanfj_id=zgydgxxb_e201206014&rft_els_id=S1005888511603233&rfr_iscdi=true |