1612 search results - page 235 / 323 » About models of security protocols |
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, the problem of deploying relay nodes in wireless sensor networks will be considered. A system consisting of a set of sensor nodes communicating to a fusion center...
SIGSOFT
2010
ACM
14 years 7 months ago
2010
ACM
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
FSE
2004
Springer
15 years 3 months ago
2004
Springer
A cryptanalysis is given of a MAC proposal presented at CRYPTO 2003 by Cary and Venkatesan. A nice feature of the CaryVenkatesan MAC is that a lower bound on its security can be pr...
ISCIS
2005
Springer
15 years 3 months ago
2005
Springer
A P2P network that is overlayed over Internet can consist of thousands, or even millions of nodes. To analyze the performance of a P2P network, or an algorithm or protocol designed...