Amanote Research

Amanote Research

    RegisterSign In

Compact Proofs of Retrievability

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-89255-7_7
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2008

Authors
Hovav ShachamBrent Waters
Publisher

Springer Berlin Heidelberg


Related search

Retrievability of Code Mixed Microblogs

2016English

Proofs for Free

Journal of Functional Programming
Software
2012English

Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1984English

Improving Retrievability and Recall by Automatic Corpus Partitioning

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Enumerating Proofs of Positive Formulae

Computer Journal
Computer Science
2008English

Identification of Proofs via Syzygies

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Constructive Proofs of Concentration Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Computer-Aided Cryptographic Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Two Convergency Proofs

Bulletin of the American Mathematical Society
1914English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy