Sciweavers

678 search results - page 129 / 136
» A Universal Framework for Self-Replication
Sort
View
PODC
2010
ACM
15 years 1 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 1 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
ECUMN
2004
Springer
15 years 1 months ago
Multi-time-Scale Traffic Modeling Using Markovian and L-Systems Models
Traffic engineering of IP networks requires the characterization and modeling of network traffic on multiple time scales due to the existence of several statistical properties that...
Paulo Salvador, António Nogueira, Rui Valad...
CRYPTO
2006
Springer
155views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
This paper considers the problem of password-authenticated key exchange (PAKE) in a client-server setting, where the server authenticates using a stored password file, and it is de...
Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
EUPROJECTS
2006
Springer
15 years 1 months ago
Human Computer Confluence
Pervasive Computing has postulated to invisibly integrate technology into everyday objects in such a way, that these objects turn into smart things. Not only a single object of thi...
Alois Ferscha, Stefan Resmerita, Clemens Holzmann