Sciweavers

271 search results - page 20 / 55
» Cryptographic Security for a High-Performance Distributed Fi...
Sort
View
CORR
2010
Springer
208views Education» more  CORR 2010»
13 years 8 months ago
MapReduce for Integer Factorization
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
Javier Tordable
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
SOSP
2001
ACM
14 years 5 months ago
BASE: Using Abstraction to Improve Fault Tolerance
ing Abstraction to Improve Fault Tolerance MIGUEL CASTRO Microsoft Research and RODRIGO RODRIGUES and BARBARA LISKOV MIT Laboratory for Computer Science Software errors are a major...
Rodrigo Rodrigues, Miguel Castro, Barbara Liskov
FM
2006
Springer
153views Formal Methods» more  FM 2006»
14 years 9 days ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
RTCSA
2006
IEEE
14 years 2 months ago
Systematic Security and Timeliness Tradeoffs in Real-Time Embedded Systems
Real-time embedded systems are increasingly being networked. In distributed real-time embedded applications, e.g., electric grid management and command and control applications, i...
Kyoung-Don Kang, Sang Hyuk Son