An Efficient Access Control Model for Mobile Ad-Hoc Communities

Mobile ad-hoc networks support interactions and collaborations among autonomous devices by enabling users to share resources and provide services to each other, whether collaborations are for business or leisure purposes. It is therefore important to ensure that interactions are subject to authentic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Keoh, Sye Loong, Lupu, Emil
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 224
container_issue
container_start_page 210
container_title
container_volume
creator Keoh, Sye Loong
Lupu, Emil
description Mobile ad-hoc networks support interactions and collaborations among autonomous devices by enabling users to share resources and provide services to each other, whether collaborations are for business or leisure purposes. It is therefore important to ensure that interactions are subject to authentication and access control in order to restrict access to only those resources and services that the user intends to share. Existing access control models that are based on membership certificates incur redundant verifications and therefore require significant computation. They are inefficient because devices have to repeatedly verify the requestor’s certificates and check the authorisation policies for each service access request received. In this paper, we present an efficient access control model that combines a membership list with the role-based access control (RBAC) model. Each ad-hoc network has a coordinator that is responsible for maintaining the membership and broadcasting a signed membership list to all participants at regular intervals. The model authorises a service request if the requestor is listed in the membership list and its assigned role is authorised to perform the requested actions. Through experiments, we have observed the efficiency gains obtained through use of this model.
doi_str_mv 10.1007/978-3-540-32004-3_21
format Conference Proceeding
fullrecord <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16923810</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16923810</sourcerecordid><originalsourceid>FETCH-LOGICAL-p228t-10ac5b4218a020700fa50739b5bfef1e138f62e523971ed7c1ea40acd8d487ff3</originalsourceid><addsrcrecordid>eNotkD9PwzAQxc0_iVL6DRiyMBrufHZjTyiqCkUqYoHZchwbBdKkisPAt8el3HKn99694cfYDcIdApT3ptScuJLASQBITlbgCbuirPwJcMpmuETkRNKcsUXOHzyhlEB1zmZAILgpJV2yRUqfkIfQGKln7KHqi3WMrW9DPxWV9yGlYjX00zh0xcvQhK6Iw5ivuu1CUTV8M_js73bffTu1IV2zi-i6FBb_e87eH9dvqw3fvj49r6ot3wuhJ47gvKqlQO1AQAkQnYKSTK3qGCIGJB2XIihBpsTQlB6Dk_mn0Y3UZYw0Z7fH3r1L3nVxdL1vk92P7c6NPxaXRpBGyDlxzKVs9R9htPUwfCWLYA8obUZjyWY49o-cPaCkX5sjX98</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An Efficient Access Control Model for Mobile Ad-Hoc Communities</title><source>Springer Books</source><creator>Keoh, Sye Loong ; Lupu, Emil</creator><contributor>Hutter, Dieter ; Ullmann, Markus</contributor><creatorcontrib>Keoh, Sye Loong ; Lupu, Emil ; Hutter, Dieter ; Ullmann, Markus</creatorcontrib><description>Mobile ad-hoc networks support interactions and collaborations among autonomous devices by enabling users to share resources and provide services to each other, whether collaborations are for business or leisure purposes. It is therefore important to ensure that interactions are subject to authentication and access control in order to restrict access to only those resources and services that the user intends to share. Existing access control models that are based on membership certificates incur redundant verifications and therefore require significant computation. They are inefficient because devices have to repeatedly verify the requestor’s certificates and check the authorisation policies for each service access request received. In this paper, we present an efficient access control model that combines a membership list with the role-based access control (RBAC) model. Each ad-hoc network has a coordinator that is responsible for maintaining the membership and broadcasting a signed membership list to all participants at regular intervals. The model authorises a service request if the requestor is listed in the membership list and its assigned role is authorised to perform the requested actions. Through experiments, we have observed the efficiency gains obtained through use of this model.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540255215</identifier><identifier>ISBN: 3540255214</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540320040</identifier><identifier>EISBN: 9783540320043</identifier><identifier>DOI: 10.1007/978-3-540-32004-3_21</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Access Control Model ; Access Request ; Applied sciences ; Authorisation Policy ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Mobile Node ; Service Request ; Software</subject><ispartof>Lecture notes in computer science, 2005, p.210-224</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></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-32004-3_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-32004-3_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,776,777,781,786,787,790,4036,4037,27906,38236,41423,42492</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=16923810$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Hutter, Dieter</contributor><contributor>Ullmann, Markus</contributor><creatorcontrib>Keoh, Sye Loong</creatorcontrib><creatorcontrib>Lupu, Emil</creatorcontrib><title>An Efficient Access Control Model for Mobile Ad-Hoc Communities</title><title>Lecture notes in computer science</title><description>Mobile ad-hoc networks support interactions and collaborations among autonomous devices by enabling users to share resources and provide services to each other, whether collaborations are for business or leisure purposes. It is therefore important to ensure that interactions are subject to authentication and access control in order to restrict access to only those resources and services that the user intends to share. Existing access control models that are based on membership certificates incur redundant verifications and therefore require significant computation. They are inefficient because devices have to repeatedly verify the requestor’s certificates and check the authorisation policies for each service access request received. In this paper, we present an efficient access control model that combines a membership list with the role-based access control (RBAC) model. Each ad-hoc network has a coordinator that is responsible for maintaining the membership and broadcasting a signed membership list to all participants at regular intervals. The model authorises a service request if the requestor is listed in the membership list and its assigned role is authorised to perform the requested actions. Through experiments, we have observed the efficiency gains obtained through use of this model.</description><subject>Access Control Model</subject><subject>Access Request</subject><subject>Applied sciences</subject><subject>Authorisation Policy</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Mobile Node</subject><subject>Service Request</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540255215</isbn><isbn>3540255214</isbn><isbn>3540320040</isbn><isbn>9783540320043</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkD9PwzAQxc0_iVL6DRiyMBrufHZjTyiqCkUqYoHZchwbBdKkisPAt8el3HKn99694cfYDcIdApT3ptScuJLASQBITlbgCbuirPwJcMpmuETkRNKcsUXOHzyhlEB1zmZAILgpJV2yRUqfkIfQGKln7KHqi3WMrW9DPxWV9yGlYjX00zh0xcvQhK6Iw5ivuu1CUTV8M_js73bffTu1IV2zi-i6FBb_e87eH9dvqw3fvj49r6ot3wuhJ47gvKqlQO1AQAkQnYKSTK3qGCIGJB2XIihBpsTQlB6Dk_mn0Y3UZYw0Z7fH3r1L3nVxdL1vk92P7c6NPxaXRpBGyDlxzKVs9R9htPUwfCWLYA8obUZjyWY49o-cPaCkX5sjX98</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Keoh, Sye Loong</creator><creator>Lupu, Emil</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>An Efficient Access Control Model for Mobile Ad-Hoc Communities</title><author>Keoh, Sye Loong ; Lupu, Emil</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p228t-10ac5b4218a020700fa50739b5bfef1e138f62e523971ed7c1ea40acd8d487ff3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Access Control Model</topic><topic>Access Request</topic><topic>Applied sciences</topic><topic>Authorisation Policy</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Mobile Node</topic><topic>Service Request</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Keoh, Sye Loong</creatorcontrib><creatorcontrib>Lupu, Emil</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Keoh, Sye Loong</au><au>Lupu, Emil</au><au>Hutter, Dieter</au><au>Ullmann, Markus</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An Efficient Access Control Model for Mobile Ad-Hoc Communities</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>210</spage><epage>224</epage><pages>210-224</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540255215</isbn><isbn>3540255214</isbn><eisbn>3540320040</eisbn><eisbn>9783540320043</eisbn><abstract>Mobile ad-hoc networks support interactions and collaborations among autonomous devices by enabling users to share resources and provide services to each other, whether collaborations are for business or leisure purposes. It is therefore important to ensure that interactions are subject to authentication and access control in order to restrict access to only those resources and services that the user intends to share. Existing access control models that are based on membership certificates incur redundant verifications and therefore require significant computation. They are inefficient because devices have to repeatedly verify the requestor’s certificates and check the authorisation policies for each service access request received. In this paper, we present an efficient access control model that combines a membership list with the role-based access control (RBAC) model. Each ad-hoc network has a coordinator that is responsible for maintaining the membership and broadcasting a signed membership list to all participants at regular intervals. The model authorises a service request if the requestor is listed in the membership list and its assigned role is authorised to perform the requested actions. Through experiments, we have observed the efficiency gains obtained through use of this model.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-32004-3_21</doi><tpages>15</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2005, p.210-224
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_16923810
source Springer Books
subjects Access Control Model
Access Request
Applied sciences
Authorisation Policy
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Memory and file management (including protection and security)
Memory organisation. Data processing
Mobile Node
Service Request
Software
title An Efficient Access Control Model for Mobile Ad-Hoc Communities
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T20%3A11%3A32IST&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=An%20Efficient%20Access%20Control%20Model%20for%20Mobile%20Ad-Hoc%20Communities&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Keoh,%20Sye%20Loong&rft.date=2005&rft.spage=210&rft.epage=224&rft.pages=210-224&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540255215&rft.isbn_list=3540255214&rft_id=info:doi/10.1007/978-3-540-32004-3_21&rft_dat=%3Cpascalfrancis_sprin%3E16923810%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540320040&rft.eisbn_list=9783540320043&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true