loading
Documentation
  • Login
  • Sign-Up

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Juan Camilo Corena ; Anirban Basu ; Yuto Nakano ; Shinsaku Kiyomoto and Yutaka Miyake

Affiliation: KDDI R&D Labs Inc., Japan

ISBN: 978-989-758-045-1

Keyword(s): Cloud Storage, Proof of Data Possession, Private Information Retrieval.

Related Ontology Subjects/Areas/Topics: Data and Application Security and Privacy ; Data Engineering ; Data Integrity ; Databases and Data Security ; Information and Systems Security ; Security and Privacy for Big Data ; Security and Privacy in IT Outsourcing ; Security and Privacy in the Cloud

Abstract: A proof of Data Possession (PDP) allows a client to verify that a remote server is still in possession of a file entrusted to it. One way to design a PDP, is to compute a function depending on a secret and the file. Then, during the verification stage, the client reveals the secret input to the server who recomputes the function and sends the output back to the client. The client can then compare both values to determine if the server is still in possession of the file. The problem with this approach is that once the server knows the secret, it is not useful anymore. In this article, we present two PDP schemes inspired in Multiple-Server Private Information Retrieval (MSPIR) protocols. In a traditional MSPIR protocol, the goal is to retrieve a given block of the file from a group of servers storing identical copies of it, without telling the servers what block was retrieved. In contrast, our goal is to let servers evaluate a function using an input that is not revealed to them. We sho w that our constructions are secure, practical and that they can complement existing approaches in storage architectures using multiple cloud providers. The amount of transmitted information during the verification stage of the protocols is proportional to the square root of the length of the file. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SCITEPRESS user or Join INSTICC now for free.

Sign In SCITEPRESS user: please login.

Sign In INSTICC Members: please login. If not a member yet, Join INSTICC now for free.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.156.54.104. INSTICC members have higher download limits (free membership now)

In the current month:
Recent papers: 1 available of 1 total
2+ years older papers: 2 available of 2 total

Paper citation in several formats:
Camilo Corena J., Basu A., Nakano Y., Kiyomoto S. and Miyake Y. (2014). A Multiple-server Efficient Reusable Proof of Data Possesion from Private Information Retrieval Techniques.In Proceedings of the 11th International Conference on Security and Cryptography (ICETE 2014)ISBN 978-989-758-045-1, pages 307-314. DOI: 10.5220/0005049803070314

@conference{secrypt14,
author={Juan Camilo Corena and Anirban Basu and Yuto Nakano and Shinsaku Kiyomoto and Yutaka Miyake},
title={A Multiple-server Efficient Reusable Proof of Data Possesion from Private Information Retrieval Techniques},
booktitle={Proceedings of the 11th International Conference on Security and Cryptography (ICETE 2014)},
year={2014},
pages={307-314},
doi={10.5220/0005049803070314},
isbn={978-989-758-045-1},
}

TY - CONF

JO - Proceedings of the 11th International Conference on Security and Cryptography (ICETE 2014)
TI - A Multiple-server Efficient Reusable Proof of Data Possesion from Private Information Retrieval Techniques
SN - 978-989-758-045-1
AU - Camilo Corena J.
AU - Basu A.
AU - Nakano Y.
AU - Kiyomoto S.
AU - Miyake Y.
PY - 2014
SP - 307
EP - 314
DO - 10.5220/0005049803070314

Sorted by: Show papers

Note: The preferred Subjects/Areas/Topics, listed below for each paper, are those that match the selected paper topics and their ontology superclasses.
More...

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.

Show authors

Note: The preferred Subjects/Areas/Topics, listed below for each author, are those that more frequently used in the author's papers.
More...