Sciweavers

5634 search results - page 998 / 1127
» About Abstract Classes
Sort
View
FAST
2008
15 years 6 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
ATAL
2008
Springer
15 years 6 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...
CCS
2008
ACM
15 years 6 months ago
Towards provable secure neighbor discovery in wireless networks
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 6 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
ICALP
2007
Springer
15 years 6 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou