Sciweavers

460 search results - page 78 / 92
» Heuristic Methods for Security Protocols
Sort
View
IPPS
2003
IEEE
14 years 27 days ago
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptogra...
Siddika Berna Örs, Lejla Batina, Bart Preneel...
INDOCRYPT
2003
Springer
14 years 25 days ago
Practical Mental Poker Without a TTP Based on Homomorphic Encryption
A solution for obtaining impartial random values in on-line gambling is presented in this paper. Unlike most previous proposals, our method does not require any TTP and allows e-ga...
Jordi Castellà-Roca, Josep Domingo-Ferrer, ...
WETICE
1998
IEEE
13 years 12 months ago
The Problem with Multiple Roots in Web Browsers - Certificate Masquerading
Much work is going into securing the public key infrastructure (PKI). Various models for trust exist; Pretty Good Privacy (PGP) and the Progressive-Constraint Trust model are exam...
James M. Hayes
JCS
2011
72views more  JCS 2011»
13 years 2 months ago
Automatically deriving information-theoretic bounds for adaptive side-channel attacks
We present a model of adaptive attacks which we combine with information-theoretic metrics to quantify the information revealed to an adaptive adversary. This enables us to expres...
Boris Köpf, David A. Basin
ISCC
2006
IEEE
133views Communications» more  ISCC 2006»
14 years 1 months ago
Choosing Weights for IP Network Dimensioning Optimization
Often in Internet Protocol (IP) networks, links are assigned weights, and traffic demands are routed along shortest paths. Hence, these link weights are the parameters which dete...
Olivier Klopfenstein, Sebastien Mamy