Composable Anonymous Proof-of-Location with User-controlled Offline Access
A proof-of-location ( pol ) is a digital credential issued to a user after proving their location to an issuer. The user can use the pol at a later time to prove to a verifier that they have been present at a claimed location. A secure Proof-of-Location (POL) system requires that pols be unforgeable...
Gespeichert in:
Veröffentlicht in: | IEEE access 2023-01, Vol.11, p.1-1 |
---|---|
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 | 1 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | IEEE access |
container_volume | 11 |
creator | Akand, Mamunur Safavi-Naini, Reihaneh Avizheh, Sepideh |
description | A proof-of-location ( pol ) is a digital credential issued to a user after proving their location to an issuer. The user can use the pol at a later time to prove to a verifier that they have been present at a claimed location. A secure Proof-of-Location (POL) system requires that pols be unforgeable and non-transferable to other users. POL systems can be used to provide fine-grained authentication and authorization and must ensure the privacy of the pol owner against the issuer and the verifier while allowing efficient presentation of pols combined with other credentials when needed. Efficiency is in terms of communication overhead in user-verifier POL sessions, which has particular significance in high-volume pol verification scenarios. We first propose a POL system that (i) is provably secure in a simulation-based framework, allowing a pol to be securely used with other credentials, and (ii) provides anonymity against the issuer and the verifier. We then extend the system to allow pols to be stored on a public distributed ledger system and selectively be presented to the verifiers by the user. This is the first POL system that satisfies the above properties. We implement POL algorithms on a mobile phone and present our experimental results showing the practicality of the system. Our proposed scheme is highly scalable compared to existing systems, reducing the user-verifier POL communication overhead by up to a factor of 94. |
doi_str_mv | 10.1109/ACCESS.2023.3279395 |
format | Article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_10132439</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10132439</ieee_id><doaj_id>oai_doaj_org_article_901d7512a04b4bf1ad5dfb2f423cbe93</doaj_id><sourcerecordid>2821715361</sourcerecordid><originalsourceid>FETCH-LOGICAL-c359t-2174ae725f094b6e10752a485fa4924babcccd474f7d2e9b71beb589b83c965e3</originalsourceid><addsrcrecordid>eNpNUdtKxDAQDaKgqF-gDwWfu-baNI9L8bKysIL6HJJ0ol26zZp0Ef_eaBfZYWCGw5wzwxyErgieEYLV7bxp7l5eZhRTNmNUKqbEETqjpFIlE6w6PuhP0WVKa5yjzpCQZ-ipCZttSMb2UMyHMHxvwi4VzzEEX-ZcBmfGLgzFVzd-FG8JYunCMMbQ99AWK-_7bshE5yClC3TiTZ_gcl_P0dv93WvzWC5XD4tmviwdE2osKZHcgKTCY8VtBQRLQQ2vhTdcUW6Ndc61XHIvWwrKSmLBilrZmjlVCWDnaDHptsGs9TZ2GxO_dTCd_gNCfNcmjp3rQStMWikINZhbbj0xrWi9pZ5T5iwolrVuJq1tDJ87SKNeh10c8vma1vlSkp9G8hSbplwMKUXw_1sJ1r8e6MkD_euB3nuQWdcTqwOAAwZhlDPFfgDYqoKE</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2821715361</pqid></control><display><type>article</type><title>Composable Anonymous Proof-of-Location with User-controlled Offline Access</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>Akand, Mamunur ; Safavi-Naini, Reihaneh ; Avizheh, Sepideh</creator><creatorcontrib>Akand, Mamunur ; Safavi-Naini, Reihaneh ; Avizheh, Sepideh</creatorcontrib><description>A proof-of-location ( pol ) is a digital credential issued to a user after proving their location to an issuer. The user can use the pol at a later time to prove to a verifier that they have been present at a claimed location. A secure Proof-of-Location (POL) system requires that pols be unforgeable and non-transferable to other users. POL systems can be used to provide fine-grained authentication and authorization and must ensure the privacy of the pol owner against the issuer and the verifier while allowing efficient presentation of pols combined with other credentials when needed. Efficiency is in terms of communication overhead in user-verifier POL sessions, which has particular significance in high-volume pol verification scenarios. We first propose a POL system that (i) is provably secure in a simulation-based framework, allowing a pol to be securely used with other credentials, and (ii) provides anonymity against the issuer and the verifier. We then extend the system to allow pols to be stored on a public distributed ledger system and selectively be presented to the verifiers by the user. This is the first POL system that satisfies the above properties. We implement POL algorithms on a mobile phone and present our experimental results showing the practicality of the system. Our proposed scheme is highly scalable compared to existing systems, reducing the user-verifier POL communication overhead by up to a factor of 94.</description><identifier>ISSN: 2169-3536</identifier><identifier>EISSN: 2169-3536</identifier><identifier>DOI: 10.1109/ACCESS.2023.3279395</identifier><identifier>CODEN: IAECCG</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Access control ; Algorithms ; Anonymity ; Composability ; Cryptography ; Distributed ledger ; Libraries ; Privacy ; Proof-of-location ; Protocols ; Public key ; Security</subject><ispartof>IEEE access, 2023-01, Vol.11, p.1-1</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><cites>FETCH-LOGICAL-c359t-2174ae725f094b6e10752a485fa4924babcccd474f7d2e9b71beb589b83c965e3</cites><orcidid>0000-0003-1655-6225 ; 0000-0001-5994-133X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10132439$$EHTML$$P50$$Gieee$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,860,2095,27612,27903,27904,54911</link.rule.ids></links><search><creatorcontrib>Akand, Mamunur</creatorcontrib><creatorcontrib>Safavi-Naini, Reihaneh</creatorcontrib><creatorcontrib>Avizheh, Sepideh</creatorcontrib><title>Composable Anonymous Proof-of-Location with User-controlled Offline Access</title><title>IEEE access</title><addtitle>Access</addtitle><description>A proof-of-location ( pol ) is a digital credential issued to a user after proving their location to an issuer. The user can use the pol at a later time to prove to a verifier that they have been present at a claimed location. A secure Proof-of-Location (POL) system requires that pols be unforgeable and non-transferable to other users. POL systems can be used to provide fine-grained authentication and authorization and must ensure the privacy of the pol owner against the issuer and the verifier while allowing efficient presentation of pols combined with other credentials when needed. Efficiency is in terms of communication overhead in user-verifier POL sessions, which has particular significance in high-volume pol verification scenarios. We first propose a POL system that (i) is provably secure in a simulation-based framework, allowing a pol to be securely used with other credentials, and (ii) provides anonymity against the issuer and the verifier. We then extend the system to allow pols to be stored on a public distributed ledger system and selectively be presented to the verifiers by the user. This is the first POL system that satisfies the above properties. We implement POL algorithms on a mobile phone and present our experimental results showing the practicality of the system. Our proposed scheme is highly scalable compared to existing systems, reducing the user-verifier POL communication overhead by up to a factor of 94.</description><subject>Access control</subject><subject>Algorithms</subject><subject>Anonymity</subject><subject>Composability</subject><subject>Cryptography</subject><subject>Distributed ledger</subject><subject>Libraries</subject><subject>Privacy</subject><subject>Proof-of-location</subject><subject>Protocols</subject><subject>Public key</subject><subject>Security</subject><issn>2169-3536</issn><issn>2169-3536</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ESBDL</sourceid><sourceid>RIE</sourceid><sourceid>DOA</sourceid><recordid>eNpNUdtKxDAQDaKgqF-gDwWfu-baNI9L8bKysIL6HJJ0ol26zZp0Ef_eaBfZYWCGw5wzwxyErgieEYLV7bxp7l5eZhRTNmNUKqbEETqjpFIlE6w6PuhP0WVKa5yjzpCQZ-ipCZttSMb2UMyHMHxvwi4VzzEEX-ZcBmfGLgzFVzd-FG8JYunCMMbQ99AWK-_7bshE5yClC3TiTZ_gcl_P0dv93WvzWC5XD4tmviwdE2osKZHcgKTCY8VtBQRLQQ2vhTdcUW6Ndc61XHIvWwrKSmLBilrZmjlVCWDnaDHptsGs9TZ2GxO_dTCd_gNCfNcmjp3rQStMWikINZhbbj0xrWi9pZ5T5iwolrVuJq1tDJ87SKNeh10c8vma1vlSkp9G8hSbplwMKUXw_1sJ1r8e6MkD_euB3nuQWdcTqwOAAwZhlDPFfgDYqoKE</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Akand, Mamunur</creator><creator>Safavi-Naini, Reihaneh</creator><creator>Avizheh, Sepideh</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>7SP</scope><scope>7SR</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0003-1655-6225</orcidid><orcidid>https://orcid.org/0000-0001-5994-133X</orcidid></search><sort><creationdate>20230101</creationdate><title>Composable Anonymous Proof-of-Location with User-controlled Offline Access</title><author>Akand, Mamunur ; Safavi-Naini, Reihaneh ; Avizheh, Sepideh</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c359t-2174ae725f094b6e10752a485fa4924babcccd474f7d2e9b71beb589b83c965e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Access control</topic><topic>Algorithms</topic><topic>Anonymity</topic><topic>Composability</topic><topic>Cryptography</topic><topic>Distributed ledger</topic><topic>Libraries</topic><topic>Privacy</topic><topic>Proof-of-location</topic><topic>Protocols</topic><topic>Public key</topic><topic>Security</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Akand, Mamunur</creatorcontrib><creatorcontrib>Safavi-Naini, Reihaneh</creatorcontrib><creatorcontrib>Avizheh, Sepideh</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>Electronics & Communications Abstracts</collection><collection>Engineered Materials Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials 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 access</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Akand, Mamunur</au><au>Safavi-Naini, Reihaneh</au><au>Avizheh, Sepideh</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Composable Anonymous Proof-of-Location with User-controlled Offline Access</atitle><jtitle>IEEE access</jtitle><stitle>Access</stitle><date>2023-01-01</date><risdate>2023</risdate><volume>11</volume><spage>1</spage><epage>1</epage><pages>1-1</pages><issn>2169-3536</issn><eissn>2169-3536</eissn><coden>IAECCG</coden><abstract>A proof-of-location ( pol ) is a digital credential issued to a user after proving their location to an issuer. The user can use the pol at a later time to prove to a verifier that they have been present at a claimed location. A secure Proof-of-Location (POL) system requires that pols be unforgeable and non-transferable to other users. POL systems can be used to provide fine-grained authentication and authorization and must ensure the privacy of the pol owner against the issuer and the verifier while allowing efficient presentation of pols combined with other credentials when needed. Efficiency is in terms of communication overhead in user-verifier POL sessions, which has particular significance in high-volume pol verification scenarios. We first propose a POL system that (i) is provably secure in a simulation-based framework, allowing a pol to be securely used with other credentials, and (ii) provides anonymity against the issuer and the verifier. We then extend the system to allow pols to be stored on a public distributed ledger system and selectively be presented to the verifiers by the user. This is the first POL system that satisfies the above properties. We implement POL algorithms on a mobile phone and present our experimental results showing the practicality of the system. Our proposed scheme is highly scalable compared to existing systems, reducing the user-verifier POL communication overhead by up to a factor of 94.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/ACCESS.2023.3279395</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0003-1655-6225</orcidid><orcidid>https://orcid.org/0000-0001-5994-133X</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2169-3536 |
ispartof | IEEE access, 2023-01, Vol.11, p.1-1 |
issn | 2169-3536 2169-3536 |
language | eng |
recordid | cdi_ieee_primary_10132439 |
source | IEEE Open Access Journals; DOAJ Directory of Open Access Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
subjects | Access control Algorithms Anonymity Composability Cryptography Distributed ledger Libraries Privacy Proof-of-location Protocols Public key Security |
title | Composable Anonymous Proof-of-Location with User-controlled Offline Access |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T13%3A21%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Composable%20Anonymous%20Proof-of-Location%20with%20User-controlled%20Offline%20Access&rft.jtitle=IEEE%20access&rft.au=Akand,%20Mamunur&rft.date=2023-01-01&rft.volume=11&rft.spage=1&rft.epage=1&rft.pages=1-1&rft.issn=2169-3536&rft.eissn=2169-3536&rft.coden=IAECCG&rft_id=info:doi/10.1109/ACCESS.2023.3279395&rft_dat=%3Cproquest_ieee_%3E2821715361%3C/proquest_ieee_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2821715361&rft_id=info:pmid/&rft_ieee_id=10132439&rft_doaj_id=oai_doaj_org_article_901d7512a04b4bf1ad5dfb2f423cbe93&rfr_iscdi=true |