COMPACT PROOFS OF RETRIEVABILITY PDF

Our first scheme, built from BLS signatures and secure in the random oracle model, has the shortest query and response of any proof-of-retrievability with public verifiability. Our second scheme, which builds elegantly on pseudorandom functions PRFs and is secure in the standard model, has the shortest response of any proof-of-retrievability scheme with private verifiability but a longer query. Both schemes rely on homomorphic properties to aggregate a proof into one small authenticator value. This process is experimental and the keywords may be updated as the learning algorithm improves.

Author:Virn Brarisar
Country:Turkey
Language:English (Spanish)
Genre:Literature
Published (Last):21 December 2012
Pages:12
PDF File Size:17.71 Mb
ePub File Size:5.97 Mb
ISBN:754-8-62170-198-3
Downloads:58068
Price:Free* [*Free Regsitration Required]
Uploader:Aralar



We present the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski.

Our first scheme, built from BLS signatures and secure in the random oracle model, has the shortest query and response of any proof-of-retrievability with public verifiability.

Our second scheme, which builds elegantly on pseudorandom functions PRFs and is secure in the standard model, has the shortest response of any proof-of-retrievability scheme with private verifiability but a longer query. Both schemes rely on homomorphic properties to aggregate a proof into one small authenticator value.

Shacham received his Ph. He is one of the pioneers in using pairings — computable bilinear maps over certain elliptic curves — to construct cryptographic systems. At the Weizmann, Shacham taught a survey on pairings in cryptography, one of the first such courses to be offered. With return-oriented programming, the attacker combines short snippets of preexisting good code into gadgets from which he can synthesize arbitrary functionality without introducing any new code. DEP makes it impossible for an attacker to execute code injected into a compromised process; but in the face of return-oriented programming it provides no security benefits.

In , Dr. He was a member of the team reviewing Hart InterCivic source code; the report he co-authored was cited by the Secretary in her decision to withdraw approval from Hart voting machines. Related Info.

FOLIA ENTOMOLOGICA MEXICANA PDF

Compact Proofs of Retrievability

.

BENIHANA NUTRITION PDF

.

Related Articles