An improved group signatures scheme based on discrete logarithm problem
A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 269 |
|---|---|
| container_issue | |
| container_start_page | 266 |
| container_title | |
| container_volume | 2 |
| creator | Chengming Qi |
| description | A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some redundant bits to each message block, to avoid the conspiracy attack. The security of the proposed scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number. The size of the group signature and the verification time of the group signature are equivalent to that of an individual signature. |
| doi_str_mv | 10.1109/PACIIA.2009.5406650 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5406650</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5406650</ieee_id><sourcerecordid>5406650</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-569f73b073e55d60dc0286cfeb2b9967b2d214a874182f45897b86d1b85ed86e3</originalsourceid><addsrcrecordid>eNotj0tqwzAYhAUl0CbNCbLRBezqbWlpTJsaAu0i-yBZvx0Vv5CcQm9fl2Y2w_AxA4PQgZKcUmJePsuqrsucEWJyKYhSkjygLRVMCKHWuEHbP2aIoJw-on1KX2SVkFxy_YSO5YjDMMfpGzzu4nSbcQrdaJdbhIRTc4UBsLNppdOIfUhNhAVwP3U2huU64LXqehie0aa1fYL93Xfo_PZ6rt6z08exrspTFgxZMqlMW3BHCg5SekV8Q5hWTQuOOWNU4ZhnVFhdCKpZK6Q2hdPKU6cleK2A79DhfzYAwGWOYbDx53L_zX8B0YpMeA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An improved group signatures scheme based on discrete logarithm problem</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Chengming Qi</creator><creatorcontrib>Chengming Qi</creatorcontrib><description>A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some redundant bits to each message block, to avoid the conspiracy attack. The security of the proposed scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number. The size of the group signature and the verification time of the group signature are equivalent to that of an individual signature.</description><identifier>ISBN: 1424446066</identifier><identifier>ISBN: 9781424446063</identifier><identifier>DOI: 10.1109/PACIIA.2009.5406650</identifier><identifier>LCCN: 2009904131</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computational intelligence ; Computer industry ; conspiracy attack ; Digital signatures ; Discrete logarithm problems ; Galois fields ; Group signatures ; Identity management systems ; Protocols ; Public key ; Public key cryptography ; Security ; threshold signature</subject><ispartof>2009 Asia-Pacific Conference on Computational Intelligence and Industrial Applications (PACIIA), 2009, Vol.2, p.266-269</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/5406650$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5406650$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chengming Qi</creatorcontrib><title>An improved group signatures scheme based on discrete logarithm problem</title><title>2009 Asia-Pacific Conference on Computational Intelligence and Industrial Applications (PACIIA)</title><addtitle>PACIIA</addtitle><description>A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some redundant bits to each message block, to avoid the conspiracy attack. The security of the proposed scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number. The size of the group signature and the verification time of the group signature are equivalent to that of an individual signature.</description><subject>Computational intelligence</subject><subject>Computer industry</subject><subject>conspiracy attack</subject><subject>Digital signatures</subject><subject>Discrete logarithm problems</subject><subject>Galois fields</subject><subject>Group signatures</subject><subject>Identity management systems</subject><subject>Protocols</subject><subject>Public key</subject><subject>Public key cryptography</subject><subject>Security</subject><subject>threshold signature</subject><isbn>1424446066</isbn><isbn>9781424446063</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj0tqwzAYhAUl0CbNCbLRBezqbWlpTJsaAu0i-yBZvx0Vv5CcQm9fl2Y2w_AxA4PQgZKcUmJePsuqrsucEWJyKYhSkjygLRVMCKHWuEHbP2aIoJw-on1KX2SVkFxy_YSO5YjDMMfpGzzu4nSbcQrdaJdbhIRTc4UBsLNppdOIfUhNhAVwP3U2huU64LXqehie0aa1fYL93Xfo_PZ6rt6z08exrspTFgxZMqlMW3BHCg5SekV8Q5hWTQuOOWNU4ZhnVFhdCKpZK6Q2hdPKU6cleK2A79DhfzYAwGWOYbDx53L_zX8B0YpMeA</recordid><startdate>200911</startdate><enddate>200911</enddate><creator>Chengming Qi</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200911</creationdate><title>An improved group signatures scheme based on discrete logarithm problem</title><author>Chengming Qi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-569f73b073e55d60dc0286cfeb2b9967b2d214a874182f45897b86d1b85ed86e3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Computational intelligence</topic><topic>Computer industry</topic><topic>conspiracy attack</topic><topic>Digital signatures</topic><topic>Discrete logarithm problems</topic><topic>Galois fields</topic><topic>Group signatures</topic><topic>Identity management systems</topic><topic>Protocols</topic><topic>Public key</topic><topic>Public key cryptography</topic><topic>Security</topic><topic>threshold signature</topic><toplevel>online_resources</toplevel><creatorcontrib>Chengming Qi</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>Chengming Qi</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An improved group signatures scheme based on discrete logarithm problem</atitle><btitle>2009 Asia-Pacific Conference on Computational Intelligence and Industrial Applications (PACIIA)</btitle><stitle>PACIIA</stitle><date>2009-11</date><risdate>2009</risdate><volume>2</volume><spage>266</spage><epage>269</epage><pages>266-269</pages><isbn>1424446066</isbn><isbn>9781424446063</isbn><abstract>A group signature scheme allows a group member to sign a message anonymously on behalf of the group. In case of a dispute, the group manager can reveal the actual identity of signer. In this paper, we propose an efficient group signature scheme, which divide the document M into m blocks and add some redundant bits to each message block, to avoid the conspiracy attack. The security of the proposed scheme is based on the difficulty of computing the discrete logarithm modulo for a composite number. The size of the group signature and the verification time of the group signature are equivalent to that of an individual signature.</abstract><pub>IEEE</pub><doi>10.1109/PACIIA.2009.5406650</doi><tpages>4</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISBN: 1424446066 |
| ispartof | 2009 Asia-Pacific Conference on Computational Intelligence and Industrial Applications (PACIIA), 2009, Vol.2, p.266-269 |
| issn | |
| language | eng |
| recordid | cdi_ieee_primary_5406650 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computational intelligence Computer industry conspiracy attack Digital signatures Discrete logarithm problems Galois fields Group signatures Identity management systems Protocols Public key Public key cryptography Security threshold signature |
| title | An improved group signatures scheme based on discrete logarithm problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T12%3A38%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20improved%20group%20signatures%20scheme%20based%20on%20discrete%20logarithm%20problem&rft.btitle=2009%20Asia-Pacific%20Conference%20on%20Computational%20Intelligence%20and%20Industrial%20Applications%20(PACIIA)&rft.au=Chengming%20Qi&rft.date=2009-11&rft.volume=2&rft.spage=266&rft.epage=269&rft.pages=266-269&rft.isbn=1424446066&rft.isbn_list=9781424446063&rft_id=info:doi/10.1109/PACIIA.2009.5406650&rft_dat=%3Cieee_6IE%3E5406650%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5406650&rfr_iscdi=true |