Sciweavers

719 search results - page 129 / 144
» Proving Security Protocols Correct
Sort
View
SSS
2009
Springer
15 years 4 months ago
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
: The Borowsky-Gafni (BG) simulation algorithm is a powerful tool that allows a set of t + 1 asynchronous sequential processes to wait-free simulate (i.e., despite the crash of up ...
Damien Imbs, Michel Raynal
POPL
2006
ACM
15 years 10 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
TCC
2009
Springer
116views Cryptology» more  TCC 2009»
15 years 10 months ago
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Abstract. In this paper we consider commitment schemes that are secure against concurrent man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions of security for...
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
MOBIHOC
2009
ACM
15 years 10 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao
ICNP
2009
IEEE
15 years 4 months ago
Topological Detection on Wormholes in Wireless Ad Hoc and Sensor Networks
—Wormhole attack is a severe threat to wireless ad hoc and sensor networks. Most existing countermeasures either require specialized hardware devices or make strong assumptions o...
Dezun Dong, Mo Li, Yunhao Liu, Xiang-Yang Li, Xian...