Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
101
search results - page 21 / 21
»
Efficient Intrusion-Resilient Signatures Without Random Orac...
Sort
relevance
views
votes
recent
update
View
thumb
title
145
click to vote
TCC
2009
Springer
141
views
Cryptology
»
more
TCC 2009
»
Proofs of Retrievability via Hardness Amplification
16 years 4 months ago
Download
cs.nyu.edu
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
claim paper
Read More »
« Prev
« First
page 21 / 21
Last »
Next »