Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: proof of retrievability

Sortuj według:

Ogranicz wyniki do:

Proof of Multicopy via Proof of File Position in Cloud

Zhang H., Cao Z., Dong X., Shen J.

Fundamenta Informaticae

2018

Vol. 157, nr 1/2

141--151

For disaster recovery, we store backups of a file in several positions far away from each other. If we delegate this task to an untrusted cloud service provider, a verification method is desired. In this paper, we construct a generic transformation from “proof of retrievability” to “proof of multicopy”. We present this work in two stages. In the first stage, we propose a generic protocol of “proof of file position” based on an arbitrary secure “proof of retrievability” protocol. In the second stage, we propose a “proof of multicopy” protocol based on our “proof of file position” protocol. Both of our protocols are provably secure.

Homomorphic linear authentication schemes from ε-ASU2 functions for proofs of retrievability

Liu S., Chem K.

Control and Cybernetics

2012

Vol. 41, no. 2

335-351

Proof of Retrievability (POR) refers to interactive auditing protocols executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with the help of the stored data. Retrievability means that it should be possible for a client to extract his/her data from the server's valid responses. An essential step leading to retrievability is the server's unforgeability of valid responses, i.e, any server coming up with valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With Homomorphic Linear Authentication (HLA) schemes, the server�' several responses can be aggregated into one, hence reducing the communication complexity. In this paper, we explore some new constructions of ε-almost strong universal hashing functions (ε-ASU2), which are used to build homomorphic linear authenticator schemes in POR to provide unforgeability. We show the HLA scheme involved in Shacham and Waters' POR scheme (see Shacham and Waters, 2008) is just an employment of a class ε-ASU2 functions. Using another class of ε-ASU2 for authentication in POR results in a new HLA scheme, which enjoys unforgability, the same shortest responses as the SW scheme, but reduces the local storage from O(n+s) to O(n) for information soundness, and from O(s) to O(1) for knowledge-soundness.