112 search results - page 2 / 23 » Perfect Secrecy in Wireless Networks |
PACT
2001
Springer
13 years 11 months ago
2001
Springer
We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an oper...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
—Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Previous work showed that the X network with M transmitters, N receivers has MN M+N-1 degrees of freedom. In this work we study the degrees of freedom of the X network with secrecy...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...