Sciweavers

1585 search results - page 110 / 317
» Automatically optimizing secure computation
Sort
View
PLDI
1993
ACM
14 years 3 days ago
Global Optimizations for Parallelism and Locality on Scalable Parallel Machines
Data locality is critical to achievinghigh performance on large-scale parallel machines. Non-local data accesses result in communication that can greatly impact performance. Thus ...
Jennifer-Ann M. Anderson, Monica S. Lam
PERCOM
2004
ACM
14 years 7 months ago
One-Time Capabilities for Authorizations without Trust
This paper introduces and solves a security problem of pervasive computing: how to define authorizations for offline interactions when trust relationships among entities do not ex...
Laurent Bussard, Refik Molva
ATAL
2008
Springer
13 years 10 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
WISEC
2010
ACM
14 years 3 months ago
Effectiveness of distance-decreasing attacks against impulse radio ranging
We expose the vulnerability of an emerging wireless ranging technology, impulse radio ultra-wide band (IR-UWB), to distance-decreasing attacks on the physical communication layer ...
Manuel Flury, Marcin Poturalski, Panos Papadimitra...
ICEGOV
2007
ACM
13 years 12 months ago
Formal threat descriptions for enhancing governmental risk assessment
Compared to the last decades, we have recently seen more and more governmental applications which are provided via the Internet directly to the citizens. Due to the long history o...
Andreas Ekelhart, Stefan Fenz, Thomas Neubauer, Ed...