Sciweavers

335 search results - page 1 / 67
» Compact Proofs of Retrievability
Sort
View
ASIACRYPT
2008
Springer
13 years 7 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CORR
2012
Springer
228views Education» more  CORR 2012»
12 years 23 days ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
JANCL
2006
100views more  JANCL 2006»
13 years 5 months ago
An efficient relational deductive system for propositional non-classical logics
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
Andrea Formisano, Marianna Nicolosi Asmundo
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
13 years 11 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
3DOR
2008
13 years 7 months ago
3D Object Retrieval using an Efficient and Compact Hybrid Shape Descriptor
We present a novel 3D object retrieval method that relies upon a hybrid descriptor which is composed of 2D features based on depth buffers and 3D features based on spherical harmo...
Panagiotis Papadakis, Ioannis Pratikakis, Theohari...