Sciweavers

92 search results - page 6 / 19
» A Formal Approach To The Protocol Converter Problem
Sort
View
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
ICALP
2005
Springer
14 years 1 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
IEEEARES
2008
IEEE
14 years 2 months ago
Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
Zhiyao Liang, Rakesh M. Verma
ICALP
2010
Springer
13 years 9 months ago
From Secrecy to Soundness: Efficient Verification via Secure Computation
d Abstract) Benny Applebaum1 , Yuval Ishai2 , and Eyal Kushilevitz3 1 Computer Science Department, Weizmann Institute of Science 2 Computer Science Department, Technion and UCLA 3 ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
DATE
2009
IEEE
87views Hardware» more  DATE 2009»
14 years 2 months ago
Multi-clock Soc design using protocol conversion
The automated design of SoCs from pre-selected IPs that may require different clocks is challenging because of the following issues. Firstly, protocol mismatches between IPs need ...
Roopak Sinha, Partha S. Roop, Samik Basu, Zoran Sa...