loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Christian Hanser and Daniel Slamanig

Affiliation: Graz University of Technology (TUG), Austria

ISBN: 978-989-8565-73-0

Keyword(s): Provable Data Possession, Proofs of Retrievability, Remote Data Checking, Simultaneous Public and Private Verifiability, Outsourced Storage, Elliptic Curves, ECDLP, Provable Security.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data and Application Security and Privacy ; Data Engineering ; Data Integrity ; Databases and Data Security ; Information and Systems Security ; Security and Privacy in IT Outsourcing ; Security and Privacy in the Cloud ; Security Protocols

Abstract: When outsourcing large sets of data to the cloud, it is desirable for clients to efficiently check, whether all outsourced data is still retrievable at any later point in time without requiring to download all of it. Provable data possession (PDP)/proofs of retrievability (PoR), for which various constructions exist, are concepts to solve this issue. Interestingly, by now, no PDP/PoR scheme leading to an efficient construction supporting both private and public verifiability simultaneously is known. In particular, this means that up to now all PDP/PoR schemes either allow public or private verifiability exclusively, since different setup procedures and metadata sets are required. However, supporting both variants simultaneously seems interesting, as publicly verifiable schemes are far less efficient than privately verifiable ones. In this paper, we propose the first simultaneous privately and publicly verifiable (robust) PDP protocol, which allows the data owner to use the more effici ent private verification and anyone else to run the public verification algorithm. Our construction, which is based on elliptic curves, achieves this, as it uses the same setup procedure and the same metadata set for private and public verifiability. We provide a rigorous security analysis and prove our construction secure in the random oracle model under the assumption that the elliptic curve discrete logarithm problem is intractable. We give detailed comparisons with the most efficient existing approaches for either private or public verifiability with our proposed scheme in terms of storage and communication overhead, as well as computational effort for the client and the server. Our analysis shows that for choices of parameters, which are relevant for practical applications, our construction outperforms all existing privately and publicly verifiable schemes significantly. This means, that even when our construction is used for either private or public verifiability alone, it still outperforms the most efficient constructions known, which is particularly appealing in the public verifiability setting. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.204.173.36

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

Paper citation in several formats:
Hanser, C. and Slamanig, D. (2013). Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves.In Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013) ISBN 978-989-8565-73-0, pages 15-26. DOI: 10.5220/0004496300150026

@conference{secrypt13,
author={Christian Hanser. and Daniel Slamanig.},
title={Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves},
booktitle={Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)},
year={2013},
pages={15-26},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004496300150026},
isbn={978-989-8565-73-0},
}

TY - CONF

JO - Proceedings of the 10th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2013)
TI - Efficient Simultaneous Privately and Publicly Verifiable Robust Provable Data Possession from Elliptic Curves
SN - 978-989-8565-73-0
AU - Hanser, C.
AU - Slamanig, D.
PY - 2013
SP - 15
EP - 26
DO - 10.5220/0004496300150026

Login or register to post comments.

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