Sciweavers

172 search results - page 29 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
PKC
2009
Springer
126views Cryptology» more  PKC 2009»
14 years 8 months ago
Verifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
Sebastiaan de Hoogh, Berry Schoenmakers, Boris Sko...
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Distributed Private Data Analysis: On Simultaneously Solving How and What
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
Amos Beimel, Kobbi Nissim, Eran Omri
SC
2005
ACM
14 years 1 months ago
The Globus Striped GridFTP Framework and Server
The GridFTP extensions to the File Transfer Protocol define a general-purpose mechanism for secure, reliable, high-performance data movement. We report here on the Globus striped ...
William E. Allcock, John Bresnahan, Rajkumar Ketti...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Proofs of Retrievability via Hardness Amplification
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