3821 search results - page 504 / 765 » A Security Model for Aglets |
205
click to vote
SPC
2005
Springer
16 years 5 days ago
2005
Springer
We develop the theme of an earlier paper [3], namely that security protocols for pervasive computing frequently need to exploit empirical channels and that the latter can be classi...
174
click to vote
CRYPTO
2004
Springer
16 years 3 days 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...
181
Voted
NORDSEC
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we report the results of the formal analysis performed on the Estonian Mobile-ID protocol (deployed since 2008), allowing citizens and permanent residents of Estonia...
177
click to vote
FSE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either...
164
Voted
IJIT
2004
15 years 8 months ago
2004
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...