Advertisement

A Distributed Implementation of the Certified Information Access Service

  • Carlo Blundo
  • Emiliano De Cristofaro
  • Aniello Del Sorbo
  • Clemente Galdi
  • Giuseppe Persiano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5283)

Abstract

In this paper we consider the problem of securely outsourcing computation on private data. We present a protocol for securely distributing the computation of the data structures used by current implementations of the Certified Information Access primitive. To this aim, we introduce the concept of a Verifiable Deterministic Envelope - that may be of independent interest - and we provide practical implementations, based on standard cryptographic assumptions.

We also discuss a prototype implementation of our proposal based on the PUB-WCL framework developed at the University of Paderborn for sharing computation across a network.

Keywords

Signature Scheme Public Information Information Access Commitment Scheme Public Parameter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Great Internet Mersenne Prime Search (GIMPS) (Last Visit, July 2007), http://www.mersenne.org
  2. 2.
    Search for extraterrestril intelligence (SETI@home) (Last Visit, July 2007), http://setiathome.berkley.edu
  3. 3.
    Blundo, C., Cristofaro, E.D., Sorbo, A.D., Galdi, C., Persiano, G.: A distributed implementation of the certified information access service, http://people.na.infn.it/~galdi/PAPERS/esorics08.pdf
  4. 4.
    Bonorden, O., Gehweiler, J., auf der Heide, F.M.: Load balancing strategies in a web computing environment. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wasniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 839–846. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Bonorden, O., Gehweiler, J., auf der Heide, F.M.: A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of International Conference on Parallel Processing and Applied Mathematics (PPAM), pp. 801–808 (2005)Google Scholar
  6. 6.
    Catalano, D., Dodis, Y., Visconti, I.: Mercurial commitments: Minimal assumptions and efficient constructions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 120–144. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Chase, M., Healy, A., Lysyanskaya, A., Malkin, T., Reyzin, L.: Mercurial commitments with applications to zero-knowledge sets. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 422–439. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Sorbo, A.D., Galdi, C., Persiano, G.: Distributed certified information access for mobile devices. In: Sauveron, D., Markantonakis, C., Bilas, A., Quisquater, J.-J. (eds.) WISTP 2007. LNCS, vol. 4462, pp. 67–79. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Liskov, M.: Updatable zero-knowledge databases. In: Roy, B.K. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 174–198. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Micali, S., Rabin, M.O., Kilian, J.: Zero-knowledge sets. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 80–91. IEEE Computer Society, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Carlo Blundo
    • 1
  • Emiliano De Cristofaro
    • 1
  • Aniello Del Sorbo
    • 1
  • Clemente Galdi
    • 2
  • Giuseppe Persiano
    • 1
  1. 1.Dipartimento di Informatica ed Applicazioni “R.M. Capocelli”Università degli Studi di SalernoFisciano (SA)Italy
  2. 2.Dipartimento di Scienze FisicheUniversità degli Studi di Napoli “Federico II”NapoliItaly

Personalised recommendations