Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions

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

Volumn 4731 LNCS, Issue , 2007, Pages 7-19

  Aiyer, Amitanand S ^a   Alvisi, Lorenzo ^a   Bazzi, Rida A ^b  

^a University of Texas at Austin

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; MESSAGE PASSING; SERVERS;

BYZANTINE STORAGE; CRYPTOGRAPHIC ASSUMPTIONS;

CRYPTOGRAPHY;

EID: 38049041557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_4     Document Type: Conference Paper

References (11)

1. Aiyer, A., Alvisi, L., Bazzi, R.A.: Bounded Wait-free Implementation of Optimally Resilient Byzantine Storage without (Unproven) Cryptographic Assumptions. Technical Report TR-07-32, University of Texas at Austin, Department of Computer Sciences (July 2007)
2. Bazzi, R.A., Ding, Y.: Non-skipping timestamps for byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405-419. Springer, Heidelberg (2004)
3. Bazzi, R.A., Ding, Y.: Bounded wait-free f-resilient atomic byzantine data storage systems for an unbounded number of clients. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 299-313. Springer, Heidelberg (2006)
4. Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN, Washington, DC, USA, pp. 115-124. IEEE Computer Society Press, Los Alamitos (2006)
5. Fan, R., Lynch, N.: Efficient replication of large data objects. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 75-91. Springer, Heidelberg (2003)
6. Guerraoui, R., Vukolic, M.: Refined Quorum Systems. Technical Report LPD-REPORT-2007-001, EPFL (2007)
7. Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124-149 (1991)
8. Lamport, L.: On interprocess communication, part i: Basic formalism. Distributed Computing 1(2), 77-101 (1986)
9. Liskov, B., Rodrigues, R.: Byzantine clients rendered harmless. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 311-325. Springer, Heidelberg (2005)
10. Martin, J.-P., Alvisi, L., Dahlin, M.: Minimal byzantine storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 311-325. Springer, Heidelberg (2002)
11. Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(2), 133-138 (1988)