CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Robust and Private Distributed Shared Atomic Memory in Message Passing Networks

Shlomi Dolev ; Thomas Petig (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Elad Michael Schiller (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing p. 311-313. (2015)
[Konferensbidrag, refereegranskat]

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. Moreover, 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 ⌈(N+k+2e)/2⌉-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 address the privacy issue when emulating shared memory in message-passing systems.

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



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-01-15. Senast ändrad 2016-12-06.
CPL Pubid: 230781

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)

Länk till annan sajt (kan kräva inloggning)