610 search results - page 65 / 122 » Information-theoretically secure protocols and security unde... |
LATA
2009
Springer
15 years 6 months ago
2009
Springer
We present conditions which guarantee that a composition of marker cellular automata has the same neighbourhood as each of the individual components. We show that, under certain te...
NPC
2004
Springer
15 years 5 months ago
2004
Springer
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component struc...
113
click to vote
CCS
2007
ACM
15 years 6 months ago
2007
ACM
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
116
click to vote
ISCI
2008
14 years 12 months ago
2008
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
119
click to vote
IJIPT
2010
14 years 10 months ago
2010
: The Address Resolution Protocol (ARP) has proven to work well under regular circumstances, but it was not designed to cope with malicious hosts. By performing ARP spoofing attack...