Standard
Efficient robust storage using secret tokens. / Dobre, D.; Majuntke, M.; Serafini, M. et al.
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Vol. 5873 LNCS Springer, 2009. p. 269-283.
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Chapter
Harvard
Dobre, D, Majuntke, M, Serafini, M
& Suri, N 2009,
Efficient robust storage using secret tokens. in
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. vol. 5873 LNCS, Springer, pp. 269-283.
https://doi.org/10.1007/978-3-642-05118-0_19APA
Dobre, D., Majuntke, M., Serafini, M.
, & Suri, N. (2009).
Efficient robust storage using secret tokens. In
Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (Vol. 5873 LNCS, pp. 269-283). Springer.
https://doi.org/10.1007/978-3-642-05118-0_19Vancouver
Dobre D, Majuntke M, Serafini M
, Suri N.
Efficient robust storage using secret tokens. In Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Vol. 5873 LNCS. Springer. 2009. p. 269-283 doi: 10.1007/978-3-642-05118-0_19
Author
Dobre, D. ; Majuntke, M. ; Serafini, M. et al. /
Efficient robust storage using secret tokens. Stabilization, Safety, and Security of Distributed Systems: 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings. Vol. 5873 LNCS Springer, 2009. pp. 269-283
Bibtex
@inbook{8701c0265b6143beb74656efd336aaf9,
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. {\textcopyright} 2009 Springer-Verlag Berlin Heidelberg.",
keywords = "Byzantine fault tolerance, Communication rounds, Cryptographic assumptions, Time complexity, Wait-freedom, Algorithms, Cryptography, Fault tolerance, Network security, Quality assurance, Stabilization, Fault tolerant computer systems",
author = "D. Dobre and M. Majuntke and M. Serafini and Neeraj Suri",
year = "2009",
doi = "10.1007/978-3-642-05118-0_19",
language = "English",
isbn = "3642051170 ",
volume = "5873 LNCS",
pages = "269--283",
booktitle = "Stabilization, Safety, and Security of Distributed Systems",
publisher = "Springer",
}
RIS
TY - CHAP
T1 - Efficient robust storage using secret tokens
AU - Dobre, D.
AU - Majuntke, M.
AU - Serafini, M.
AU - Suri, Neeraj
PY - 2009
Y1 - 2009
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. © 2009 Springer-Verlag Berlin Heidelberg.
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. © 2009 Springer-Verlag Berlin Heidelberg.
KW - Byzantine fault tolerance
KW - Communication rounds
KW - Cryptographic assumptions
KW - Time complexity
KW - Wait-freedom
KW - Algorithms
KW - Cryptography
KW - Fault tolerance
KW - Network security
KW - Quality assurance
KW - Stabilization
KW - Fault tolerant computer systems
U2 - 10.1007/978-3-642-05118-0_19
DO - 10.1007/978-3-642-05118-0_19
M3 - Chapter
SN - 3642051170
SN - 9783642051173
VL - 5873 LNCS
SP - 269
EP - 283
BT - Stabilization, Safety, and Security of Distributed Systems
PB - Springer
ER -
