Loading…
A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited
Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR&...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 98 |
container_issue | |
container_start_page | 92 |
container_title | |
container_volume | |
creator | Fukumitsu, Masayuki Hasegawa, Shingo |
description | Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR'17, Fukumitsu and Hasegawa proposed a GG09-like IBS (FH17 IBS). Although their scheme achieves a tight security in the random oracle model under the DDH assumption, the size of components and the computational time is much worse than the original GG09 IBS. In this paper, we revisit FH17 IBS and propose an IBS which is more efficient than FH17 IBS. Our proposed IBS has a tight security in the random oracle model under the DDH assumption as well as FH17 IBS and has about 2 times efficiency than FH17 scheme. The security proof of our scheme utilizes the property of our scheme that the user key generation algorithm is probabilistic. |
doi_str_mv | 10.1109/CANDAR.2018.00019 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8594748</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8594748</ieee_id><sourcerecordid>8594748</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-abfd0dc0cba8887de9d096dbd950eeff4c68ef20755eb00a8975c7f54fc43c6b3</originalsourceid><addsrcrecordid>eNotjNFOwjAUQKuJiYh8gPGlH2DxdlvX9nGiIsmiCWB8JF17C1dxmK1o-HtJ9Omch5PD2JWEsZRgbyfV8301H2cgzRgApD1hF1LlprTSZOqUDbJcWyGNLc_ZqO_fj01WmkIqPWBvFZ-6LbVhJ6au8-RETR_IZwHbROkg7lyPgS9o3bq075D_UNrwJa03iS_Q77tjw-cY9j7Rrr056jf1lDBcsrPotj2O_jlkr48Py8mTqF-ms0lVC5JaJeGaGCB48I0zxuiANoAtQxOsAsQYC18ajBlopbABcMZq5XVURfRF7ssmH7Lrvy8h4uqro0_XHVZG2UIXJv8F_C5S3Q</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited</title><source>IEEE Xplore All Conference Series</source><creator>Fukumitsu, Masayuki ; Hasegawa, Shingo</creator><creatorcontrib>Fukumitsu, Masayuki ; Hasegawa, Shingo</creatorcontrib><description>Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR'17, Fukumitsu and Hasegawa proposed a GG09-like IBS (FH17 IBS). Although their scheme achieves a tight security in the random oracle model under the DDH assumption, the size of components and the computational time is much worse than the original GG09 IBS. In this paper, we revisit FH17 IBS and propose an IBS which is more efficient than FH17 IBS. Our proposed IBS has a tight security in the random oracle model under the DDH assumption as well as FH17 IBS and has about 2 times efficiency than FH17 scheme. The security proof of our scheme utilizes the property of our scheme that the user key generation algorithm is probabilistic.</description><identifier>EISSN: 2379-1896</identifier><identifier>EISBN: 1538691825</identifier><identifier>EISBN: 9781538691823</identifier><identifier>DOI: 10.1109/CANDAR.2018.00019</identifier><identifier>CODEN: IEEPAD</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computational modeling ; DDH assumption ; Galindo Garcia identity based signature ; Games ; identity based signature ; Optimized production technology ; Probabilistic logic ; Public key ; tight security</subject><ispartof>2018 Sixth International Symposium on Computing and Networking (CANDAR), 2018, p.92-98</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8594748$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8594748$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fukumitsu, Masayuki</creatorcontrib><creatorcontrib>Hasegawa, Shingo</creatorcontrib><title>A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited</title><title>2018 Sixth International Symposium on Computing and Networking (CANDAR)</title><addtitle>CANDAR</addtitle><description>Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR'17, Fukumitsu and Hasegawa proposed a GG09-like IBS (FH17 IBS). Although their scheme achieves a tight security in the random oracle model under the DDH assumption, the size of components and the computational time is much worse than the original GG09 IBS. In this paper, we revisit FH17 IBS and propose an IBS which is more efficient than FH17 IBS. Our proposed IBS has a tight security in the random oracle model under the DDH assumption as well as FH17 IBS and has about 2 times efficiency than FH17 scheme. The security proof of our scheme utilizes the property of our scheme that the user key generation algorithm is probabilistic.</description><subject>Computational modeling</subject><subject>DDH assumption</subject><subject>Galindo Garcia identity based signature</subject><subject>Games</subject><subject>identity based signature</subject><subject>Optimized production technology</subject><subject>Probabilistic logic</subject><subject>Public key</subject><subject>tight security</subject><issn>2379-1896</issn><isbn>1538691825</isbn><isbn>9781538691823</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2018</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjNFOwjAUQKuJiYh8gPGlH2DxdlvX9nGiIsmiCWB8JF17C1dxmK1o-HtJ9Omch5PD2JWEsZRgbyfV8301H2cgzRgApD1hF1LlprTSZOqUDbJcWyGNLc_ZqO_fj01WmkIqPWBvFZ-6LbVhJ6au8-RETR_IZwHbROkg7lyPgS9o3bq075D_UNrwJa03iS_Q77tjw-cY9j7Rrr056jf1lDBcsrPotj2O_jlkr48Py8mTqF-ms0lVC5JaJeGaGCB48I0zxuiANoAtQxOsAsQYC18ajBlopbABcMZq5XVURfRF7ssmH7Lrvy8h4uqro0_XHVZG2UIXJv8F_C5S3Q</recordid><startdate>201811</startdate><enddate>201811</enddate><creator>Fukumitsu, Masayuki</creator><creator>Hasegawa, Shingo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201811</creationdate><title>A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited</title><author>Fukumitsu, Masayuki ; Hasegawa, Shingo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-abfd0dc0cba8887de9d096dbd950eeff4c68ef20755eb00a8975c7f54fc43c6b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computational modeling</topic><topic>DDH assumption</topic><topic>Galindo Garcia identity based signature</topic><topic>Games</topic><topic>identity based signature</topic><topic>Optimized production technology</topic><topic>Probabilistic logic</topic><topic>Public key</topic><topic>tight security</topic><toplevel>online_resources</toplevel><creatorcontrib>Fukumitsu, Masayuki</creatorcontrib><creatorcontrib>Hasegawa, Shingo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fukumitsu, Masayuki</au><au>Hasegawa, Shingo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited</atitle><btitle>2018 Sixth International Symposium on Computing and Networking (CANDAR)</btitle><stitle>CANDAR</stitle><date>2018-11</date><risdate>2018</risdate><spage>92</spage><epage>98</epage><pages>92-98</pages><eissn>2379-1896</eissn><eisbn>1538691825</eisbn><eisbn>9781538691823</eisbn><coden>IEEPAD</coden><abstract>Galindo-Garcia identity-based signature (GG09 IBS) is an efficient identity-based signature (IBS) based on Schnorr signature scheme. The security of GG09 IBS is proven in the random oracle model under the discrete-log assumption, however, the security proof achieves a loose security only. In CANDAR'17, Fukumitsu and Hasegawa proposed a GG09-like IBS (FH17 IBS). Although their scheme achieves a tight security in the random oracle model under the DDH assumption, the size of components and the computational time is much worse than the original GG09 IBS. In this paper, we revisit FH17 IBS and propose an IBS which is more efficient than FH17 IBS. Our proposed IBS has a tight security in the random oracle model under the DDH assumption as well as FH17 IBS and has about 2 times efficiency than FH17 scheme. The security proof of our scheme utilizes the property of our scheme that the user key generation algorithm is probabilistic.</abstract><pub>IEEE</pub><doi>10.1109/CANDAR.2018.00019</doi><tpages>7</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | EISSN: 2379-1896 |
ispartof | 2018 Sixth International Symposium on Computing and Networking (CANDAR), 2018, p.92-98 |
issn | 2379-1896 |
language | eng |
recordid | cdi_ieee_primary_8594748 |
source | IEEE Xplore All Conference Series |
subjects | Computational modeling DDH assumption Galindo Garcia identity based signature Games identity based signature Optimized production technology Probabilistic logic Public key tight security |
title | A Galindo-Garcia-Like Identity-Based Signature with Tight Security Reduction, Revisited |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T22%3A38%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=A%20Galindo-Garcia-Like%20Identity-Based%20Signature%20with%20Tight%20Security%20Reduction,%20Revisited&rft.btitle=2018%20Sixth%20International%20Symposium%20on%20Computing%20and%20Networking%20(CANDAR)&rft.au=Fukumitsu,%20Masayuki&rft.date=2018-11&rft.spage=92&rft.epage=98&rft.pages=92-98&rft.eissn=2379-1896&rft.coden=IEEPAD&rft_id=info:doi/10.1109/CANDAR.2018.00019&rft.eisbn=1538691825&rft.eisbn_list=9781538691823&rft_dat=%3Cieee_CHZPO%3E8594748%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-abfd0dc0cba8887de9d096dbd950eeff4c68ef20755eb00a8975c7f54fc43c6b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8594748&rfr_iscdi=true |