Sciweavers

588 search results - page 36 / 118
» Reducibility and Completeness in Private Computations
Sort
View
SIGECOM
2008
ACM
151views ECommerce» more  SIGECOM 2008»
13 years 10 months ago
Security and insurance management in networks with heterogeneous agents
Computer users express a strong desire to prevent attacks and to reduce the losses from computer and information security breaches. However, security compromises are common and wi...
Jens Grossklags, Nicolas Christin, John Chuang
CLOUD
2010
ACM
14 years 3 months ago
Making cloud intermediate data fault-tolerant
Parallel dataflow programs generate enormous amounts of distributed data that are short-lived, yet are critical for completion of the job and for good run-time performance. We ca...
Steven Y. Ko, Imranul Hoque, Brian Cho, Indranil G...
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
14 years 3 months ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
VTC
2006
IEEE
14 years 4 months ago
Group-Based Linear Parallel Interference Cancellation for DS-CDMA Systems
— The increase in the demand for voice and data wireless services creates a need for a more efficient use of the available bandwidth. Current and future generations cellular sys...
Benoit Pelletier, Benoît Champagne
AIPS
2003
13 years 11 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...