Certified Information Access

HighlightsIntroduce the Certified Information Access service and two distributed algorithms.Securely distribute computation intensive tasks in CIA setup phase.Securely outsource the whole computation of data structures used by CIA service.Introduce a new cryptographic primitive, the Verifiable Deterministic Envelope. Certified Information Access (CIA) primitive allows a user to obtain answers to database queries in a way that she can verify the correctness of the received information. The database owner answers a query by providing the information matching the query along with a proof that such information are consistent with the actual content of the database. Current solutions to this problem require a computationally intensive setup phase. We describe two secure distributed implementations of a CIA service. In the first one, the database owner distributes the evaluation of a computation intensive function (e.g., exponentiations) among a set of untrusted peers and locally reconstructs the result of such an evaluation. In the second one, we propose a protocol for securely outsourcing the whole computation of the data structures used in the implementations of the CIA primitive. In this case, the main issue to be considered is the need of guaranteeing on the one hand the confidentiality of the database contents and, on the other hand, the correctness and soundness of the answers obtained by the users. We argue that classical cryptographic primitives are not sufficient for our purposes and we introduce a new primitive, the Verifiable Deterministic Envelope, that may be of independent interest.

[1]  Ralph C. Merkle,et al.  Secrecy, authentication, and public key systems , 1979 .

[2]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[3]  Palash Sarkar,et al.  Symmetrically Private Information Retrieval (Extended Abstract) , 2000 .

[4]  Ivan Visconti,et al.  Mercurial Commitments: Minimal Assumptions and Efficient Constructions , 2006, TCC.

[5]  Moses D. Liskov.  Updatable Zero-Knowledge Databases , 2005, ASIACRYPT.

[6]  Rafail Ostrovsky,et al.  Efficient Consistency Proofs for Generalized Queries on a Committed Database , 2004, ICALP.

[7]  Silvio Micali,et al.  Zero-knowledge sets , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Friedhelm Meyer auf der Heide,et al.  A Web Computing Environment for Parallel Algorithms in Java , 2001 .

[9]  Giuseppe Persiano,et al.  Distributed Certified Information Access for Mobile Devices , 2007, WISTP.

[10]  Yuval Ishai,et al.  Protecting data privacy in private information retrieval schemes , 1998, STOC '98.

[11]  Emiliano De Cristofaro,et al.  A Distributed Implementation of the Certified Information Access Service , 2008, ESORICS.

[12]  Tal Malkin,et al.  Mercurial Commitments with Applications to Zero-Knowledge Sets , 2005, Journal of Cryptology.

[13]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[14]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[15]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[16]  Huafei Zhu.  Mercurial Commitments from General RSA Moduli and Their Applications to Zero-Knowledge Databases/Sets , 2009, 2009 Second International Workshop on Computer Science and Engineering.

[17]  Sanjeev Kumar Mishra.  On Symmetrically Private Information Retrieval , 2000, IACR Cryptol. ePrint Arch..

[18]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[19]  Joachim Gehweiler,et al.  Distributed Load Balancing in Heterogeneous Peer-to-Peer Networks for Web Computing Libraries , 2006, 2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications.

[20]  Mario Di Raimondo,et al.  Zero-Knowledge Sets With Short Proofs , 2008, IEEE Transactions on Information Theory.

[21]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[22]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[23]  Load Balancing Strategies in a Web Computing Environment , 2005, PPAM.

[24]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..