Sciweavers

5324 search results - page 919 / 1065
» Internet Security Protocols
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 9 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
MOBISYS
2008
ACM
14 years 8 months ago
Trustworthy and personalized computing on public kiosks
Many people desire ubiquitous access to their personal computing environments. We present a system in which a user leverages a personal mobile device to establish trust in a publi...
Scott Garriss, Ramón Cáceres, Stefan...
MICRO
2009
IEEE
168views Hardware» more  MICRO 2009»
14 years 3 months ago
Ordering decoupled metadata accesses in multiprocessors
Hardware support for dynamic analysis can minimize the performance overhead of useful applications such as security checks, debugging, and profiling. To eliminate implementation ...
Hari Kannan
ASIACRYPT
2009
Springer
14 years 3 months ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...
HPDC
2007
IEEE
14 years 3 months ago
Direct-pNFS: scalable, transparent, and versatile access to parallel file systems
Grid computations require global access to massive data stores. To meet this need, the GridNFS project aims to provide scalable, high-performance, transparent, and secure wide-are...
Dean Hildebrand, Peter Honeyman