Fail-Aware Untrusted Storage

We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when t...

Full description

Saved in:
Bibliographic Details
Main Authors: Cachin, C., Keidar, I., Shraer, A.
Format: Conference Proceeding
Language:English
Subjects:
Cloud computing
Collaborative tools
Collaborative work
Contracts
Laboratories
Online Communities/Technical Collaboration
Protocols
Resists
Stability
Timing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 503
container_issue
container_start_page 494
container_title
container_volume
creator Cachin, C.
Keidar, I.
Shraer, A.
description We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when the provider is correct, such a service guarantees consistency (linearizability) and liveness (wait-freedom) of all operations. In addition, the service always provides accurate and complete consistency and failure detection. We illustrate our new abstraction by presenting a Fail-Aware Untrusted STorage service (FAUST). Existing storage protocols in this model guarantee so-called forking semantics. We observe, however, that none of the previously suggested protocols suffice for implementing fail-aware untrusted storage with the desired liveness and consistency properties (at least wait-freedom and linearizability when the server is correct). We present a new storage protocol, which does not suffer from this limitation, and implements a new consistency notion, called weak fork-linearizability. We show how to extend this protocol to provide eventual consistency and failure awareness in FAUST.
doi_str_mv 10.1109/DSN.2009.5270299
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5270299</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5270299</ieee_id><sourcerecordid>5270299</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-7c56f8db05b5ad02a03f7749d4e6face28e7600a6bceb995dd2eefde6d267f43</originalsourceid><addsrcrecordid>eNpFj8tKA0EQRctHwEnMXtBFfqDH6ur3MiQmEYIuEtehZ7paRuKDmRHx740Y8GzO4sKBC3AlsZQSw-1881ASYigNOaQQTmAoNekDJN0pFCSNFyqQO_sfyJxDIY1Cgd6HAQx_AwHJB3cB4657wQPakFeygJtFbPZi-hVbnjy99e1n13OabPr3Nj7zJQxy3Hc8PnoE28XddrYS68fl_Wy6Fo10pheuNjb7VKGpTExIEVV2Toek2eZYM3l2FjHaquYqBJMSMefENpF1WasRXP9lG2befbTNa2y_d8fH6gchmkJ4</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Fail-Aware Untrusted Storage</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Cachin, C. ; Keidar, I. ; Shraer, A.</creator><creatorcontrib>Cachin, C. ; Keidar, I. ; Shraer, A.</creatorcontrib><description>We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when the provider is correct, such a service guarantees consistency (linearizability) and liveness (wait-freedom) of all operations. In addition, the service always provides accurate and complete consistency and failure detection. We illustrate our new abstraction by presenting a Fail-Aware Untrusted STorage service (FAUST). Existing storage protocols in this model guarantee so-called forking semantics. We observe, however, that none of the previously suggested protocols suffice for implementing fail-aware untrusted storage with the desired liveness and consistency properties (at least wait-freedom and linearizability when the server is correct). We present a new storage protocol, which does not suffer from this limitation, and implements a new consistency notion, called weak fork-linearizability. We show how to extend this protocol to provide eventual consistency and failure awareness in FAUST.</description><identifier>ISSN: 1530-0889</identifier><identifier>ISBN: 1424444225</identifier><identifier>ISBN: 9781424444229</identifier><identifier>EISSN: 2158-3927</identifier><identifier>EISBN: 1424444217</identifier><identifier>EISBN: 9781424444212</identifier><identifier>DOI: 10.1109/DSN.2009.5270299</identifier><identifier>LCCN: 2009902897</identifier><language>eng</language><publisher>IEEE</publisher><subject>Cloud computing ; Collaborative tools ; Collaborative work ; Contracts ; Laboratories ; Online Communities/Technical Collaboration ; Protocols ; Resists ; Stability ; Timing</subject><ispartof>2009 IEEE/IFIP International Conference on Dependable Systems &amp; Networks, 2009, p.494-503</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/5270299$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54555,54920,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5270299$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cachin, C.</creatorcontrib><creatorcontrib>Keidar, I.</creatorcontrib><creatorcontrib>Shraer, A.</creatorcontrib><title>Fail-Aware Untrusted Storage</title><title>2009 IEEE/IFIP International Conference on Dependable Systems &amp; Networks</title><addtitle>DSN</addtitle><description>We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when the provider is correct, such a service guarantees consistency (linearizability) and liveness (wait-freedom) of all operations. In addition, the service always provides accurate and complete consistency and failure detection. We illustrate our new abstraction by presenting a Fail-Aware Untrusted STorage service (FAUST). Existing storage protocols in this model guarantee so-called forking semantics. We observe, however, that none of the previously suggested protocols suffice for implementing fail-aware untrusted storage with the desired liveness and consistency properties (at least wait-freedom and linearizability when the server is correct). We present a new storage protocol, which does not suffer from this limitation, and implements a new consistency notion, called weak fork-linearizability. We show how to extend this protocol to provide eventual consistency and failure awareness in FAUST.</description><subject>Cloud computing</subject><subject>Collaborative tools</subject><subject>Collaborative work</subject><subject>Contracts</subject><subject>Laboratories</subject><subject>Online Communities/Technical Collaboration</subject><subject>Protocols</subject><subject>Resists</subject><subject>Stability</subject><subject>Timing</subject><issn>1530-0889</issn><issn>2158-3927</issn><isbn>1424444225</isbn><isbn>9781424444229</isbn><isbn>1424444217</isbn><isbn>9781424444212</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpFj8tKA0EQRctHwEnMXtBFfqDH6ur3MiQmEYIuEtehZ7paRuKDmRHx740Y8GzO4sKBC3AlsZQSw-1881ASYigNOaQQTmAoNekDJN0pFCSNFyqQO_sfyJxDIY1Cgd6HAQx_AwHJB3cB4657wQPakFeygJtFbPZi-hVbnjy99e1n13OabPr3Nj7zJQxy3Hc8PnoE28XddrYS68fl_Wy6Fo10pheuNjb7VKGpTExIEVV2Toek2eZYM3l2FjHaquYqBJMSMefENpF1WasRXP9lG2befbTNa2y_d8fH6gchmkJ4</recordid><startdate>200906</startdate><enddate>200906</enddate><creator>Cachin, C.</creator><creator>Keidar, I.</creator><creator>Shraer, A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200906</creationdate><title>Fail-Aware Untrusted Storage</title><author>Cachin, C. ; Keidar, I. ; Shraer, A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-7c56f8db05b5ad02a03f7749d4e6face28e7600a6bceb995dd2eefde6d267f43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Cloud computing</topic><topic>Collaborative tools</topic><topic>Collaborative work</topic><topic>Contracts</topic><topic>Laboratories</topic><topic>Online Communities/Technical Collaboration</topic><topic>Protocols</topic><topic>Resists</topic><topic>Stability</topic><topic>Timing</topic><toplevel>online_resources</toplevel><creatorcontrib>Cachin, C.</creatorcontrib><creatorcontrib>Keidar, I.</creatorcontrib><creatorcontrib>Shraer, A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cachin, C.</au><au>Keidar, I.</au><au>Shraer, A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Fail-Aware Untrusted Storage</atitle><btitle>2009 IEEE/IFIP International Conference on Dependable Systems &amp; Networks</btitle><stitle>DSN</stitle><date>2009-06</date><risdate>2009</risdate><spage>494</spage><epage>503</epage><pages>494-503</pages><issn>1530-0889</issn><eissn>2158-3927</eissn><isbn>1424444225</isbn><isbn>9781424444229</isbn><eisbn>1424444217</eisbn><eisbn>9781424444212</eisbn><abstract>We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware untrusted service, with meaningful semantics even when the provider is faulty. In the common case, when the provider is correct, such a service guarantees consistency (linearizability) and liveness (wait-freedom) of all operations. In addition, the service always provides accurate and complete consistency and failure detection. We illustrate our new abstraction by presenting a Fail-Aware Untrusted STorage service (FAUST). Existing storage protocols in this model guarantee so-called forking semantics. We observe, however, that none of the previously suggested protocols suffice for implementing fail-aware untrusted storage with the desired liveness and consistency properties (at least wait-freedom and linearizability when the server is correct). We present a new storage protocol, which does not suffer from this limitation, and implements a new consistency notion, called weak fork-linearizability. We show how to extend this protocol to provide eventual consistency and failure awareness in FAUST.</abstract><pub>IEEE</pub><doi>10.1109/DSN.2009.5270299</doi><tpages>10</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1530-0889
ispartof 2009 IEEE/IFIP International Conference on Dependable Systems & Networks, 2009, p.494-503
issn 1530-0889
2158-3927
language eng
recordid cdi_ieee_primary_5270299
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Cloud computing
Collaborative tools
Collaborative work
Contracts
Laboratories
Online Communities/Technical Collaboration
Protocols
Resists
Stability
Timing
title Fail-Aware Untrusted Storage
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T19%3A57%3A25IST&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=Fail-Aware%20Untrusted%20Storage&rft.btitle=2009%20IEEE/IFIP%20International%20Conference%20on%20Dependable%20Systems%20&%20Networks&rft.au=Cachin,%20C.&rft.date=2009-06&rft.spage=494&rft.epage=503&rft.pages=494-503&rft.issn=1530-0889&rft.eissn=2158-3927&rft.isbn=1424444225&rft.isbn_list=9781424444229&rft_id=info:doi/10.1109/DSN.2009.5270299&rft.eisbn=1424444217&rft.eisbn_list=9781424444212&rft_dat=%3Cieee_6IE%3E5270299%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-7c56f8db05b5ad02a03f7749d4e6face28e7600a6bceb995dd2eefde6d267f43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5270299&rfr_iscdi=true