Skip to main content
SpringerLink
Log in

Asynchronous Verifiable Information Dispersal

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

Abstract

We consider the distribution of data by a client among a set of n storage servers, of which up to t might be faulty exhibiting arbitrary, i.e., Byzantine, behavior. The goal is to ensure that clients can always recover the stored data correctly, independently from the behavior of faulty servers or other, faulty clients. An inefficient solution is based on replication such that every server keeps a copy of the data. The classic alternative is information dispersal (IDA): using an erasure code, the data is split into blocks such that each server holds exactly one block and only a subset of the blocks is needed in order to reconstruct the data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: Proc. 9th ACM Conference on Computer and Communications Security (CCS), pp. 88–97 (2002)

    Google Scholar 

  2. Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Proc. 24th Symp. on Reliable Distributed Systems (SRDS 2005) (October 2005)

    Google Scholar 

  3. Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: Proc. 28th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 427–437 (1987)

    Google Scholar 

  4. Garay, J.A., Gennaro, R., Jutla, C., Rabin, T.: Secure distributed storage and retrieval. Theoretical Computer Science 243(1–2), 363–389 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K.: Efficient Byzantine-tolerant erasure-coded storage. In: Proc. International Conference on Dependable Systems and Networks (DSN 2004), pp. 135–144 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Zurich Research Laboratory, IBM Research, CH-8803, Rüschlikon, Switzerland

    Christian Cachin

  2. Department of Computer Science, ETH Zurich, CH-8092, Zürich, Switzerland

    Stefano Tessaro

Authors
  1. Christian Cachin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Tessaro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cachin, C., Tessaro, S. (2005). Asynchronous Verifiable Information Dispersal. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_42

Download citation

  • DOI: https://doi.org/10.1007/11561927_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation