Sciweavers

2372 search results - page 221 / 475
» Probabilistic calling context
Sort
View
PROVSEC
2007
Springer
14 years 2 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 2 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
GLOBECOM
2006
IEEE
14 years 2 months ago
On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
Mahalingam Ramkumar
GLOBECOM
2006
IEEE
14 years 2 months ago
RIM: Router Interface Marking for IP Traceback
—Distributed Denial-of-Service (DDoS) attacks have become a major threat to the Internet. As a countermeasure against DDoS attacks, IP traceback schemes identify the network path...
Ruiliang Chen, Jung Min Park, Randolph Marchany
INFOCOM
2006
IEEE
14 years 2 months ago
Optimizing Caching Policy for Loss Recovery in Reliable Multicast
— In reliable multicast, data packets can be cached at some nodes such as repair servers for future possible retransmission in loss recovery schemes. How to cache packets to opti...
Feng Xie, Gang Feng, Xun Yang