New Identity-Based Ring Signature Schemes
Identity-based (ID-based) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 39 |
|---|---|
| container_issue | |
| container_start_page | 27 |
| container_title | |
| container_volume | |
| creator | Herranz, Javier Sáez, Germán |
| description | Identity-based (ID-based) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification of a ring signature, where a user anonymously signs a message on behalf of a set of users including himself, requires to authenticate the public keys of all the members of the set.
We use bilinear pairings to design a new ID-based ring signature scheme. We give bounds on the concrete security of our scheme in the random oracle model, under the assumption that the Computational Diffie-Hellman problem is hard to solve. Then we extend this scheme to scenarios where a subset of users anonymously sign on behalf of some access structure of different subsets. |
| doi_str_mv | 10.1007/978-3-540-30191-2_3 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16334591</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16334591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c277t-821a483de781c9567b109bd2f4e4ed790998678d1b6c086bc6c63137a50bbe863</originalsourceid><addsrcrecordid>eNotkMtOwzAQRc1LIpR-AZtsWLAweDyJH0uoeFSqQKKwtmzHCYE2reIg1L_HNMxmNHOPRppDyAWwa2BM3mipKNKyYBQZaKDc4AE5w7TYz_KQZCAAKGKhj8aAYylQH5MsIZxqWeApmcb4yVIhRy1kRq6ew08-r0I3tMOO3tkYqvy17Zp82TadHb77kC_9R1iHeE5OaruKYfrfJ-T94f5t9kQXL4_z2e2Cei7lQBUHWyisglTgdSmkA6ZdxesiFKGSmmmthFQVOOGZEs4LLxBQ2pI5F5TACbkc725t9HZV97bzbTTbvl3bfmdApA9LDYmDkYsp6prQG7fZfEUDzPwJM0mYQZM0mL0gk4ThLyIlVs4</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>New Identity-Based Ring Signature Schemes</title><source>Springer Books</source><creator>Herranz, Javier ; Sáez, Germán</creator><contributor>Qing, Sihan ; Lopez, Javier ; Okamoto, Eiji</contributor><creatorcontrib>Herranz, Javier ; Sáez, Germán ; Qing, Sihan ; Lopez, Javier ; Okamoto, Eiji</creatorcontrib><description>Identity-based (ID-based) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification of a ring signature, where a user anonymously signs a message on behalf of a set of users including himself, requires to authenticate the public keys of all the members of the set.
We use bilinear pairings to design a new ID-based ring signature scheme. We give bounds on the concrete security of our scheme in the random oracle model, under the assumption that the Computational Diffie-Hellman problem is hard to solve. Then we extend this scheme to scenarios where a subset of users anonymously sign on behalf of some access structure of different subsets.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540235639</identifier><identifier>ISBN: 9783540235637</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540301917</identifier><identifier>EISBN: 9783540301912</identifier><identifier>DOI: 10.1007/978-3-540-30191-2_3</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Access Structure ; Applied sciences ; Blind Signature ; Computer science; control theory; systems ; Cryptography ; Exact sciences and technology ; Hash Function ; Information, signal and communications theory ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Random Oracle ; Ring Signature ; Signal and communications theory ; Software ; Telecommunications and information theory</subject><ispartof>Information and Communications Security, 2004, p.27-39</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c277t-821a483de781c9567b109bd2f4e4ed790998678d1b6c086bc6c63137a50bbe863</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-30191-2_3$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-30191-2_3$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16334591$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Qing, Sihan</contributor><contributor>Lopez, Javier</contributor><contributor>Okamoto, Eiji</contributor><creatorcontrib>Herranz, Javier</creatorcontrib><creatorcontrib>Sáez, Germán</creatorcontrib><title>New Identity-Based Ring Signature Schemes</title><title>Information and Communications Security</title><description>Identity-based (ID-based) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification of a ring signature, where a user anonymously signs a message on behalf of a set of users including himself, requires to authenticate the public keys of all the members of the set.
We use bilinear pairings to design a new ID-based ring signature scheme. We give bounds on the concrete security of our scheme in the random oracle model, under the assumption that the Computational Diffie-Hellman problem is hard to solve. Then we extend this scheme to scenarios where a subset of users anonymously sign on behalf of some access structure of different subsets.</description><subject>Access Structure</subject><subject>Applied sciences</subject><subject>Blind Signature</subject><subject>Computer science; control theory; systems</subject><subject>Cryptography</subject><subject>Exact sciences and technology</subject><subject>Hash Function</subject><subject>Information, signal and communications theory</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Random Oracle</subject><subject>Ring Signature</subject><subject>Signal and communications theory</subject><subject>Software</subject><subject>Telecommunications and information theory</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540235639</isbn><isbn>9783540235637</isbn><isbn>3540301917</isbn><isbn>9783540301912</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2004</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkMtOwzAQRc1LIpR-AZtsWLAweDyJH0uoeFSqQKKwtmzHCYE2reIg1L_HNMxmNHOPRppDyAWwa2BM3mipKNKyYBQZaKDc4AE5w7TYz_KQZCAAKGKhj8aAYylQH5MsIZxqWeApmcb4yVIhRy1kRq6ew08-r0I3tMOO3tkYqvy17Zp82TadHb77kC_9R1iHeE5OaruKYfrfJ-T94f5t9kQXL4_z2e2Cei7lQBUHWyisglTgdSmkA6ZdxesiFKGSmmmthFQVOOGZEs4LLxBQ2pI5F5TACbkc725t9HZV97bzbTTbvl3bfmdApA9LDYmDkYsp6prQG7fZfEUDzPwJM0mYQZM0mL0gk4ThLyIlVs4</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Herranz, Javier</creator><creator>Sáez, Germán</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>New Identity-Based Ring Signature Schemes</title><author>Herranz, Javier ; Sáez, Germán</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c277t-821a483de781c9567b109bd2f4e4ed790998678d1b6c086bc6c63137a50bbe863</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Access Structure</topic><topic>Applied sciences</topic><topic>Blind Signature</topic><topic>Computer science; control theory; systems</topic><topic>Cryptography</topic><topic>Exact sciences and technology</topic><topic>Hash Function</topic><topic>Information, signal and communications theory</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Random Oracle</topic><topic>Ring Signature</topic><topic>Signal and communications theory</topic><topic>Software</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Herranz, Javier</creatorcontrib><creatorcontrib>Sáez, Germán</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Herranz, Javier</au><au>Sáez, Germán</au><au>Qing, Sihan</au><au>Lopez, Javier</au><au>Okamoto, Eiji</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>New Identity-Based Ring Signature Schemes</atitle><btitle>Information and Communications Security</btitle><date>2004</date><risdate>2004</risdate><spage>27</spage><epage>39</epage><pages>27-39</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540235639</isbn><isbn>9783540235637</isbn><eisbn>3540301917</eisbn><eisbn>9783540301912</eisbn><abstract>Identity-based (ID-based) cryptosystems avoid the necessity of certificates to authenticate public keys in a digital communications system. This is desirable, specially for these applications which involve a large number of public keys in each execution. For example, any computation and verification of a ring signature, where a user anonymously signs a message on behalf of a set of users including himself, requires to authenticate the public keys of all the members of the set.
We use bilinear pairings to design a new ID-based ring signature scheme. We give bounds on the concrete security of our scheme in the random oracle model, under the assumption that the Computational Diffie-Hellman problem is hard to solve. Then we extend this scheme to scenarios where a subset of users anonymously sign on behalf of some access structure of different subsets.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-30191-2_3</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Information and Communications Security, 2004, p.27-39 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16334591 |
| source | Springer Books |
| subjects | Access Structure Applied sciences Blind Signature Computer science control theory systems Cryptography Exact sciences and technology Hash Function Information, signal and communications theory Memory and file management (including protection and security) Memory organisation. Data processing Random Oracle Ring Signature Signal and communications theory Software Telecommunications and information theory |
| title | New Identity-Based Ring Signature Schemes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T12%3A56%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=New%20Identity-Based%20Ring%20Signature%20Schemes&rft.btitle=Information%20and%20Communications%20Security&rft.au=Herranz,%20Javier&rft.date=2004&rft.spage=27&rft.epage=39&rft.pages=27-39&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540235639&rft.isbn_list=9783540235637&rft_id=info:doi/10.1007/978-3-540-30191-2_3&rft_dat=%3Cpascalfrancis_sprin%3E16334591%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540301917&rft.eisbn_list=9783540301912&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |