Sciweavers

1656 search results - page 285 / 332
» Secure Computation Without Authentication
Sort
View
ASIACRYPT
2001
Springer
14 years 1 months ago
How to Leak a Secret
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signatu...
Ronald L. Rivest, Adi Shamir, Yael Tauman
ITCC
2005
IEEE
14 years 2 months ago
The N/R One Time Password System
A new one time password system is described which is secure against eavesdropping and server database compromise at the same time. Traditionally, these properties have proven to b...
Vipul Goyal, Ajith Abraham, Sugata Sanyal, Sang-Yo...
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
SIGCOMM
2009
ACM
14 years 3 months ago
Accountability in hosted virtual networks
Virtualization enables multiple networks, each customized for a particular purpose, to run concurrently over a shared substrate. One such model for managing these virtual networks...
Eric Keller, Ruby B. Lee, Jennifer Rexford
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