610 search results - page 115 / 122 » Information-theoretically secure protocols and security unde... |
140
click to vote
DCC
2001
IEEE
16 years 3 months ago
2001
IEEE
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
138
click to vote
RTA
2009
Springer
15 years 10 months ago
2009
Springer
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
150
click to vote
EUROCRYPT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
163
click to vote
CHES
2006
Springer
15 years 8 months ago
2006
Springer
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
165
click to vote
DCOSS
2010
Springer
15 years 7 months ago
2010
Springer
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...