Sciweavers

5511 search results - page 152 / 1103
» Security for Network Places
Sort
View
132
Voted
CCS
2008
ACM
15 years 5 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
118
Voted
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
105
Voted
INFOCOM
2007
IEEE
15 years 10 months ago
pDCS: Security and Privacy Support for Data-Centric Sensor Networks
—The demand for efficient data dissemination/access techniques to find the relevant data from within a sensor network has led to the development of data-centric sensor networks...
Min Shao, Sencun Zhu, Wensheng Zhang, Guohong Cao
105
Voted
CCS
2010
ACM
15 years 3 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
135
Voted
AINA
2007
IEEE
15 years 10 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu