Sciweavers

66 search results - page 2 / 14
» Parallel Reducibility for Information-Theoretically Secure C...
Sort
View
ICDCSW
2002
IEEE
13 years 10 months ago
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
PET
2012
Springer
11 years 7 months ago
PRISM - Privacy-Preserving Search in MapReduce
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...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...
IPPS
2005
IEEE
13 years 11 months ago
Speculative Security Checks in Sandboxing Systems
Sandboxing systems are extremely useful for secure execution of untrusted applications. Many of the sandboxing systems proposed so far provide security by intercepting system call...
Yoshihiro Oyama, Koichi Onoue, Akinori Yonezawa
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 8 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
ICDCS
2002
IEEE
13 years 10 months ago
Group-Based Management of Distributed File Caches
We describe how to manage distributed file system caches based upon groups of files that are accessed together. We use file access patterns to automatically construct dynamic g...
Ahmed Amer, Darrell D. E. Long, Randal C. Burns