757 search results - page 67 / 152 » How secure are secure interdomain routing protocols |
JCS
2011
13 years 2 months ago
2011
One of the main challenges in pervasive computing is how we can establish secure communication over an untrusted high-bandwidth network without any initial knowledge or a Public K...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
Communications systems, encompassing VoIP, IM, and other personal media, present different challenges for P2P environments than other P2P applications. In particular, reliable com...
SASN
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
MINENET
2006
ACM
14 years 1 months ago
2006
ACM
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...