80 search results - page 7 / 16 » General Secure Multi-party Computation from any Linear Secre... |
CONEXT
2005
ACM
13 years 8 months ago
2005
ACM
Random key Pre-distribution scheme has been proposed to overcome the memory, computation and energy limits of individual sensor in wireless sensor networks. In this scheme, a ring...
TCC
2009
Springer
14 years 7 months ago
2009
Springer
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...
ASIACRYPT
2001
Springer
13 years 10 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
ICALP
2005
Springer
14 years 7 days ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
PET
2012
Springer
11 years 9 months ago
2012
Springer
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...