Sciweavers

1834 search results - page 191 / 367
» Public Key Cryptography
Sort
View
TCC
2007
Springer
124views Cryptology» more  TCC 2007»
14 years 3 months ago
Tackling Adaptive Corruptions in Multicast Encryption Protocols
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...
Saurabh Panjwani
ICDCS
2005
IEEE
14 years 2 months ago
Distributed Blinding for Distributed ElGamal Re-Encryption
A protocol is given to take an ElGamal ciphertext encrypted under the key of one distributed service and produce the corresponding ciphertext encrypted under the key of another di...
Lidong Zhou, Michael A. Marsh, Fred B. Schneider, ...
CHES
2005
Springer
107views Cryptology» more  CHES 2005»
14 years 2 months ago
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
Jean-Sébastien Coron, David Lefranc, Guilla...
FSE
2005
Springer
119views Cryptology» more  FSE 2005»
14 years 2 months ago
The Poly1305-AES Message-Authentication Code
Poly1305-AES is a state-of-the-art message-authentication code suitable for a wide variety of applications. Poly1305-AES computes a 16-byte authenticator of a variable-length messa...
Daniel J. Bernstein
CHES
2006
Springer
133views Cryptology» more  CHES 2006»
14 years 1 months ago
Fast Generation of Prime Numbers on Portable Devices: An Update
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...
Marc Joye, Pascal Paillier