Sciweavers

1923 search results - page 86 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
14 years 9 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
COLCOM
2005
IEEE
15 years 3 months ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
RIVF
2007
14 years 11 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
INFOCOM
2006
IEEE
15 years 3 months ago
Intelligent Distribution of Intrusion Prevention Services on Programmable Routers
— The recent surge of new viruses and host attacks in the Internet and the tremendous propagation speed of selfdistributing attacks has made network security a pressing issue. To...
Andreas Hess, Hans-Florian Geerdes, Roland Wess&au...
TDSC
2008
125views more  TDSC 2008»
14 years 9 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar