Brief announcement: Robust and private distributed shared atomic memory in message passing networks

Shlomi Dolev; Thomas Petig; Elad M. Schiller

doi:10.1145/2767386.2767450

Brief announcement: Robust and private distributed shared atomic memory in message passing networks

Shlomi Dolev, Thomas Petig, Elad M. Schiller

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data. More- over, at most f servers can fail and stop. The focus is on coded atomic storage (CAS) algorithms. We present a variant that ensures no information leakage by letting the servers store their data as secret shares. Our enhancement to CAS uses d(N +k +2e)=2e-size quorums and Reed-Solomon codes. This enhancement preserves the algorithm ability to function in asynchronous system settings. To the best of our knowledge, we are the first to ad- dress the privacy issue when emulating shared memory in message-passing systems.

Original language	American English
Title of host publication	PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Pages	311-313
Number of pages	3
ISBN (Electronic)	9781450336178
DOIs	https://doi.org/10.1145/2767386.2767450
State	Published - 21 Jul 2015
Event	ACM Symposium on Principles of Distributed Computing, PODC 2015 - Donostia-San Sebastian, Spain Duration: 21 Jul 2015 → 23 Jul 2015

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Volume	2015-July

Conference

Conference	ACM Symposium on Principles of Distributed Computing, PODC 2015
Country/Territory	Spain
City	Donostia-San Sebastian
Period	21/07/15 → 23/07/15

Keywords

Fault tolerance
MRMW
Message passing
Network cod- ing
Privacy
Secret sharing
Semi-byzantine
Shared memory emulation

All Science Journal Classification (ASJC) codes

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/2767386.2767450

Cite this

Dolev, S., Petig, T., & Schiller, E. M. (2015). Brief announcement: Robust and private distributed shared atomic memory in message passing networks. In PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (pp. 311-313). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 2015-July). https://doi.org/10.1145/2767386.2767450

@inproceedings{f5f08256505a492da3e5353acd01847e,

title = "Brief announcement: Robust and private distributed shared atomic memory in message passing networks",

abstract = "We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data. More- over, at most f servers can fail and stop. The focus is on coded atomic storage (CAS) algorithms. We present a variant that ensures no information leakage by letting the servers store their data as secret shares. Our enhancement to CAS uses d(N +k +2e)=2e-size quorums and Reed-Solomon codes. This enhancement preserves the algorithm ability to function in asynchronous system settings. To the best of our knowledge, we are the first to ad- dress the privacy issue when emulating shared memory in message-passing systems.",

keywords = "Fault tolerance, MRMW, Message passing, Network cod- ing, Privacy, Secret sharing, Semi-byzantine, Shared memory emulation",

author = "Shlomi Dolev and Thomas Petig and Schiller, \{Elad M.\}",

year = "2015",

month = jul,

day = "21",

doi = "10.1145/2767386.2767450",

language = "American English",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "311--313",

booktitle = "PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing",

}

Dolev, S, Petig, T & Schiller, EM 2015, Brief announcement: Robust and private distributed shared atomic memory in message passing networks. in PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, vol. 2015-July, pp. 311-313, ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebastian, Spain, 21/07/15. https://doi.org/10.1145/2767386.2767450

Brief announcement: Robust and private distributed shared atomic memory in message passing networks. / Dolev, Shlomi; Petig, Thomas; Schiller, Elad M.
PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. 2015. p. 311-313 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; Vol. 2015-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Brief announcement

T2 - ACM Symposium on Principles of Distributed Computing, PODC 2015

AU - Dolev, Shlomi

AU - Petig, Thomas

AU - Schiller, Elad M.

PY - 2015/7/21

Y1 - 2015/7/21

N2 - We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data. More- over, at most f servers can fail and stop. The focus is on coded atomic storage (CAS) algorithms. We present a variant that ensures no information leakage by letting the servers store their data as secret shares. Our enhancement to CAS uses d(N +k +2e)=2e-size quorums and Reed-Solomon codes. This enhancement preserves the algorithm ability to function in asynchronous system settings. To the best of our knowledge, we are the first to ad- dress the privacy issue when emulating shared memory in message-passing systems.

AB - We study the problem of privately emulating shared memory in message passing networks. The system includes N servers, and at most e semi-Byzantine servers that can deviate from the algorithm by sending corrupted data. More- over, at most f servers can fail and stop. The focus is on coded atomic storage (CAS) algorithms. We present a variant that ensures no information leakage by letting the servers store their data as secret shares. Our enhancement to CAS uses d(N +k +2e)=2e-size quorums and Reed-Solomon codes. This enhancement preserves the algorithm ability to function in asynchronous system settings. To the best of our knowledge, we are the first to ad- dress the privacy issue when emulating shared memory in message-passing systems.

KW - Fault tolerance

KW - MRMW

KW - Message passing

KW - Network cod- ing

KW - Privacy

KW - Secret sharing

KW - Semi-byzantine

KW - Shared memory emulation

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

U2 - 10.1145/2767386.2767450

DO - 10.1145/2767386.2767450

M3 - Conference contribution

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 311

EP - 313

BT - PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing

Y2 - 21 July 2015 through 23 July 2015

ER -

Brief announcement: Robust and private distributed shared atomic memory in message passing networks

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this