Sciweavers

719 search results - page 90 / 144
» Proving Security Protocols Correct
Sort
View
ATC
2007
Springer
15 years 3 months ago
Enhancing Grid Security Using Trusted Virtualization
Abstract. Grid applications have increasingly sophisticated functional and security requirements. However, current techniques mostly protect only the resource provider from attacks...
Hans Löhr, HariGovind V. Ramasamy, Ahmad-Reza...
IFIP
2004
Springer
15 years 3 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
CORR
2010
Springer
183views Education» more  CORR 2010»
14 years 9 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
INFOCOM
2010
IEEE
14 years 7 months ago
SafeQ: Secure and Efficient Query Processing in Sensor Networks
The architecture of two-tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing data and processing queries, has been widel...
Fei Chen, Alex X. Liu
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...