An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks
Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emerge...
Gespeichert in:
| Veröffentlicht in: | IEEE open journal of the Computer Society 2023-01, Vol.4, p.1-12 |
|---|---|
| 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 | 12 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | IEEE open journal of the Computer Society |
| container_volume | 4 |
| creator | Zhu, Xinjie He, Debiao Bao, Zijian Luo, Min Peng, Cong |
| description | Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emergence of decentralized identity (DID) can solve these problems. However, most existing DID systems have some privacy issues that a user's attributes value are disclosed while accessing service. In this paper, we design a DID protocol to solve these challenges. The proposed protocol includes a range proof protocol to provide attribute privacy. The range proof protocol works with anonymous credentials and does not need a trusted setup. Moreover, the identity model behind the DID protocol is extended from an existing model, which achieves identity revocation. Finally, we implement a system prototype on the blockchain for evaluation. The security analysis shows that our protocol provides stronger privacy protection. The performance evaluation indicates that the computation cost and blockchain overheads of our protocol are acceptable in OSNs. |
| doi_str_mv | 10.1109/OJCS.2023.3258188 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_proquest_journals_2799861055</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10073618</ieee_id><doaj_id>oai_doaj_org_article_a00f335ae81140f19f367cb4abbb9716</doaj_id><sourcerecordid>2799861055</sourcerecordid><originalsourceid>FETCH-LOGICAL-c403t-8e381f9898eee6c334264a241b74d42b1d9d3f65496b2b1ad1c2d3dbf479e6463</originalsourceid><addsrcrecordid>eNpNkU1vEzEQhleoSFSlPwCJg6Wek3psr9c-tukHQYUiAlcsrz2OnCbr1t4KhV-Pl1Sop_nQM-_M6G2aD0DnAFSf339erOaMMj7nrFWg1JvmmEkhZsCkOnqVv2tOS9lQSlkLALw9bn5dDOQ6hOgiDiO5QldDttv4Bz1Z-lrEcU--2MGucTcRq30ZcUcubalAGsh3O6yRfMspBRJSJqvkot2Srzj-TvmhvG_eBrstePoST5qfN9c_Fp9md_e3y8XF3cwJyseZQq4gaKUVIkrHuagnWyag74QXrAevPQ-yFVr2tbIeHPPc90F0GqWQ_KRZHnR9shvzmOPO5r1JNpp_jZTXxuYxui0aS2ngvLWoAAQNoAOXneuF7ftedzBpnR20HnN6esYymk16zkM937BOayWBtm2l4EC5nErJGP5vBWomV8zkiplcMS-u1JmPh5lY33zF045LUPwvhEKHaw</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2799861055</pqid></control><display><type>article</type><title>An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks</title><source>IEEE Open Access Journals</source><source>DOAJ Directory of Open Access Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>Zhu, Xinjie ; He, Debiao ; Bao, Zijian ; Luo, Min ; Peng, Cong</creator><creatorcontrib>Zhu, Xinjie ; He, Debiao ; Bao, Zijian ; Luo, Min ; Peng, Cong</creatorcontrib><description>Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emergence of decentralized identity (DID) can solve these problems. However, most existing DID systems have some privacy issues that a user's attributes value are disclosed while accessing service. In this paper, we design a DID protocol to solve these challenges. The proposed protocol includes a range proof protocol to provide attribute privacy. The range proof protocol works with anonymous credentials and does not need a trusted setup. Moreover, the identity model behind the DID protocol is extended from an existing model, which achieves identity revocation. Finally, we implement a system prototype on the blockchain for evaluation. The security analysis shows that our protocol provides stronger privacy protection. The performance evaluation indicates that the computation cost and blockchain overheads of our protocol are acceptable in OSNs.</description><identifier>ISSN: 2644-1268</identifier><identifier>EISSN: 2644-1268</identifier><identifier>DOI: 10.1109/OJCS.2023.3258188</identifier><identifier>CODEN: IOJCB2</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Blockchain ; Blockchains ; Cryptography ; Decentralized identity ; Performance evaluation ; Privacy ; privacy protection ; Protocols ; range proofs ; Security ; Servers ; social network ; Social networking (online) ; Social networks ; W3C</subject><ispartof>IEEE open journal of the Computer Society, 2023-01, Vol.4, p.1-12</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c403t-8e381f9898eee6c334264a241b74d42b1d9d3f65496b2b1ad1c2d3dbf479e6463</citedby><cites>FETCH-LOGICAL-c403t-8e381f9898eee6c334264a241b74d42b1d9d3f65496b2b1ad1c2d3dbf479e6463</cites><orcidid>0000-0002-2446-7436 ; 0000-0002-2145-9713 ; 0000-0002-9958-3255 ; 0000-0002-1819-9332 ; 0009-0003-5187-5341</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10073618$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,864,2102,27633,27924,27925,54933</link.rule.ids></links><search><creatorcontrib>Zhu, Xinjie</creatorcontrib><creatorcontrib>He, Debiao</creatorcontrib><creatorcontrib>Bao, Zijian</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Peng, Cong</creatorcontrib><title>An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks</title><title>IEEE open journal of the Computer Society</title><addtitle>OJCS</addtitle><description>Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emergence of decentralized identity (DID) can solve these problems. However, most existing DID systems have some privacy issues that a user's attributes value are disclosed while accessing service. In this paper, we design a DID protocol to solve these challenges. The proposed protocol includes a range proof protocol to provide attribute privacy. The range proof protocol works with anonymous credentials and does not need a trusted setup. Moreover, the identity model behind the DID protocol is extended from an existing model, which achieves identity revocation. Finally, we implement a system prototype on the blockchain for evaluation. The security analysis shows that our protocol provides stronger privacy protection. The performance evaluation indicates that the computation cost and blockchain overheads of our protocol are acceptable in OSNs.</description><subject>Blockchain</subject><subject>Blockchains</subject><subject>Cryptography</subject><subject>Decentralized identity</subject><subject>Performance evaluation</subject><subject>Privacy</subject><subject>privacy protection</subject><subject>Protocols</subject><subject>range proofs</subject><subject>Security</subject><subject>Servers</subject><subject>social network</subject><subject>Social networking (online)</subject><subject>Social networks</subject><subject>W3C</subject><issn>2644-1268</issn><issn>2644-1268</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNkU1vEzEQhleoSFSlPwCJg6Wek3psr9c-tukHQYUiAlcsrz2OnCbr1t4KhV-Pl1Sop_nQM-_M6G2aD0DnAFSf339erOaMMj7nrFWg1JvmmEkhZsCkOnqVv2tOS9lQSlkLALw9bn5dDOQ6hOgiDiO5QldDttv4Bz1Z-lrEcU--2MGucTcRq30ZcUcubalAGsh3O6yRfMspBRJSJqvkot2Srzj-TvmhvG_eBrstePoST5qfN9c_Fp9md_e3y8XF3cwJyseZQq4gaKUVIkrHuagnWyag74QXrAevPQ-yFVr2tbIeHPPc90F0GqWQ_KRZHnR9shvzmOPO5r1JNpp_jZTXxuYxui0aS2ngvLWoAAQNoAOXneuF7ftedzBpnR20HnN6esYymk16zkM937BOayWBtm2l4EC5nErJGP5vBWomV8zkiplcMS-u1JmPh5lY33zF045LUPwvhEKHaw</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Zhu, Xinjie</creator><creator>He, Debiao</creator><creator>Bao, Zijian</creator><creator>Luo, Min</creator><creator>Peng, Cong</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>ESBDL</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-2446-7436</orcidid><orcidid>https://orcid.org/0000-0002-2145-9713</orcidid><orcidid>https://orcid.org/0000-0002-9958-3255</orcidid><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0009-0003-5187-5341</orcidid></search><sort><creationdate>20230101</creationdate><title>An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks</title><author>Zhu, Xinjie ; He, Debiao ; Bao, Zijian ; Luo, Min ; Peng, Cong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c403t-8e381f9898eee6c334264a241b74d42b1d9d3f65496b2b1ad1c2d3dbf479e6463</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Blockchain</topic><topic>Blockchains</topic><topic>Cryptography</topic><topic>Decentralized identity</topic><topic>Performance evaluation</topic><topic>Privacy</topic><topic>privacy protection</topic><topic>Protocols</topic><topic>range proofs</topic><topic>Security</topic><topic>Servers</topic><topic>social network</topic><topic>Social networking (online)</topic><topic>Social networks</topic><topic>W3C</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhu, Xinjie</creatorcontrib><creatorcontrib>He, Debiao</creatorcontrib><creatorcontrib>Bao, Zijian</creatorcontrib><creatorcontrib>Luo, Min</creatorcontrib><creatorcontrib>Peng, Cong</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE Open Access Journals</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>IEEE open journal of the Computer Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu, Xinjie</au><au>He, Debiao</au><au>Bao, Zijian</au><au>Luo, Min</au><au>Peng, Cong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks</atitle><jtitle>IEEE open journal of the Computer Society</jtitle><stitle>OJCS</stitle><date>2023-01-01</date><risdate>2023</risdate><volume>4</volume><spage>1</spage><epage>12</epage><pages>1-12</pages><issn>2644-1268</issn><eissn>2644-1268</eissn><coden>IOJCB2</coden><abstract>Online social networks (OSNs) are becoming more and more popular in people's lives as the demand for online interaction continues to grow. Current OSNs are using centralized identity management system (IDM), which has some problems of single point of failure and privacy data leakage. The emergence of decentralized identity (DID) can solve these problems. However, most existing DID systems have some privacy issues that a user's attributes value are disclosed while accessing service. In this paper, we design a DID protocol to solve these challenges. The proposed protocol includes a range proof protocol to provide attribute privacy. The range proof protocol works with anonymous credentials and does not need a trusted setup. Moreover, the identity model behind the DID protocol is extended from an existing model, which achieves identity revocation. Finally, we implement a system prototype on the blockchain for evaluation. The security analysis shows that our protocol provides stronger privacy protection. The performance evaluation indicates that the computation cost and blockchain overheads of our protocol are acceptable in OSNs.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/OJCS.2023.3258188</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-2446-7436</orcidid><orcidid>https://orcid.org/0000-0002-2145-9713</orcidid><orcidid>https://orcid.org/0000-0002-9958-3255</orcidid><orcidid>https://orcid.org/0000-0002-1819-9332</orcidid><orcidid>https://orcid.org/0009-0003-5187-5341</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2644-1268 |
| ispartof | IEEE open journal of the Computer Society, 2023-01, Vol.4, p.1-12 |
| issn | 2644-1268 2644-1268 |
| language | eng |
| recordid | cdi_proquest_journals_2799861055 |
| source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Blockchain Blockchains Cryptography Decentralized identity Performance evaluation Privacy privacy protection Protocols range proofs Security Servers social network Social networking (online) Social networks W3C |
| title | An Efficient Decentralized Identity Management System Based on Range Proof for Social Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T07%3A24%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Efficient%20Decentralized%20Identity%20Management%20System%20Based%20on%20Range%20Proof%20for%20Social%20Networks&rft.jtitle=IEEE%20open%20journal%20of%20the%20Computer%20Society&rft.au=Zhu,%20Xinjie&rft.date=2023-01-01&rft.volume=4&rft.spage=1&rft.epage=12&rft.pages=1-12&rft.issn=2644-1268&rft.eissn=2644-1268&rft.coden=IOJCB2&rft_id=info:doi/10.1109/OJCS.2023.3258188&rft_dat=%3Cproquest_doaj_%3E2799861055%3C/proquest_doaj_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2799861055&rft_id=info:pmid/&rft_ieee_id=10073618&rft_doaj_id=oai_doaj_org_article_a00f335ae81140f19f367cb4abbb9716&rfr_iscdi=true |