Sciweavers

4731 search results - page 312 / 947
» Securing Interactive Programs
Sort
View
TIFS
2008
149views more  TIFS 2008»
15 years 6 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu
ESOP
2012
Springer
14 years 2 months ago
Reasoning about Lock Placements
A lock placement describes, for each heap location, which lock guards the location, and under what circumstances. We formalize methods for reasoning about lock placements, making p...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
SIGSOFT
2002
ACM
16 years 7 months ago
Secure systems development based on the common criteria: the PalME project
Security is a very important issue in information processing, especially in open network environments like the Internet. The Common Criteria (CC) is the standard requirements cata...
Monika Vetterling, Guido Wimmel, Alexander K. Wi&s...
MOBIHOC
2005
ACM
16 years 6 months ago
Toward resilient security in wireless sensor networks
Node compromise poses severe security threats in wireless sensor networks. Unfortunately, existing security designs can address only a small, fixed threshold number of compromised...
Hao Yang, Fan Ye, Yuan Yuan, Songwu Lu, William A....
194
Voted
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård