Efficient robust storage using secret tokens

Dan Dobre, Matthias Majuntke, Marco Serafini, Neeraj Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We present algorithms that reduce the time complexity and improve the scalability of robust storage for unauthenticated data. Robust storage ensures progress under every condition (wait-freedom) and never returns an outdated value (regularity) nor a forged value (Byzantine fault tolerance). The algorithms use secret tokens, which are values randomly selected by the clients and attached to the data written into the storage. Tokens are secret because they cannot be predicted by the attacker before they are used, and thus revealed, by the clients. Our algorithms do not rely on unproven cryptographic assumptions as algorithms based on self-verifying data. They are optimally-resilient, and ensure that reads complete in two communication rounds if readers do not write into the storage, or in one communication round otherwise.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages269-283
Number of pages15
Volume5873 LNCS
DOIs
Publication statusPublished - 1 Dec 2009
Externally publishedYes
Event11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009 - Lyon, France
Duration: 3 Nov 20096 Nov 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5873 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009
CountryFrance
CityLyon
Period3/11/096/11/09

Fingerprint

Communication
Fault tolerance
Fault Tolerance
Time Complexity
Scalability
Regularity

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Dobre, D., Majuntke, M., Serafini, M., & Suri, N. (2009). Efficient robust storage using secret tokens. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5873 LNCS, pp. 269-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5873 LNCS). https://doi.org/10.1007/978-3-642-05118-0_19

Efficient robust storage using secret tokens. / Dobre, Dan; Majuntke, Matthias; Serafini, Marco; Suri, Neeraj.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5873 LNCS 2009. p. 269-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5873 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dobre, D, Majuntke, M, Serafini, M & Suri, N 2009, Efficient robust storage using secret tokens. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5873 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5873 LNCS, pp. 269-283, 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2009, Lyon, France, 3/11/09. https://doi.org/10.1007/978-3-642-05118-0_19
Dobre D, Majuntke M, Serafini M, Suri N. Efficient robust storage using secret tokens. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5873 LNCS. 2009. p. 269-283. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-05118-0_19
Dobre, Dan ; Majuntke, Matthias ; Serafini, Marco ; Suri, Neeraj. / Efficient robust storage using secret tokens. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5873 LNCS 2009. pp. 269-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{06dcb5d9c59741979a2a120081965906,
title = "Efficient robust storage using secret tokens",
abstract = "We present algorithms that reduce the time complexity and improve the scalability of robust storage for unauthenticated data. Robust storage ensures progress under every condition (wait-freedom) and never returns an outdated value (regularity) nor a forged value (Byzantine fault tolerance). The algorithms use secret tokens, which are values randomly selected by the clients and attached to the data written into the storage. Tokens are secret because they cannot be predicted by the attacker before they are used, and thus revealed, by the clients. Our algorithms do not rely on unproven cryptographic assumptions as algorithms based on self-verifying data. They are optimally-resilient, and ensure that reads complete in two communication rounds if readers do not write into the storage, or in one communication round otherwise.",
author = "Dan Dobre and Matthias Majuntke and Marco Serafini and Neeraj Suri",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-05118-0_19",
language = "English",
isbn = "3642051170",
volume = "5873 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "269--283",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient robust storage using secret tokens

AU - Dobre, Dan

AU - Majuntke, Matthias

AU - Serafini, Marco

AU - Suri, Neeraj

PY - 2009/12/1

Y1 - 2009/12/1

N2 - We present algorithms that reduce the time complexity and improve the scalability of robust storage for unauthenticated data. Robust storage ensures progress under every condition (wait-freedom) and never returns an outdated value (regularity) nor a forged value (Byzantine fault tolerance). The algorithms use secret tokens, which are values randomly selected by the clients and attached to the data written into the storage. Tokens are secret because they cannot be predicted by the attacker before they are used, and thus revealed, by the clients. Our algorithms do not rely on unproven cryptographic assumptions as algorithms based on self-verifying data. They are optimally-resilient, and ensure that reads complete in two communication rounds if readers do not write into the storage, or in one communication round otherwise.

AB - We present algorithms that reduce the time complexity and improve the scalability of robust storage for unauthenticated data. Robust storage ensures progress under every condition (wait-freedom) and never returns an outdated value (regularity) nor a forged value (Byzantine fault tolerance). The algorithms use secret tokens, which are values randomly selected by the clients and attached to the data written into the storage. Tokens are secret because they cannot be predicted by the attacker before they are used, and thus revealed, by the clients. Our algorithms do not rely on unproven cryptographic assumptions as algorithms based on self-verifying data. They are optimally-resilient, and ensure that reads complete in two communication rounds if readers do not write into the storage, or in one communication round otherwise.

UR - http://www.scopus.com/inward/record.url?scp=70549111162&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70549111162&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-05118-0_19

DO - 10.1007/978-3-642-05118-0_19

M3 - Conference contribution

SN - 3642051170

SN - 9783642051173

VL - 5873 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 269

EP - 283

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -