Sciweavers

346 search results - page 27 / 70
» The Secret Santa Problem
Sort
View
EUROCRYPT
2006
Springer
15 years 9 months ago
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects
The Isomorphism of Polynomials (IP) [28], which is the main concern of this paper, originally corresponds to the problem of recovering the secret key of a C scheme [26]. Besides, t...
Jean-Charles Faugère, Ludovic Perret
SCN
2004
Springer
123views Communications» more  SCN 2004»
15 years 11 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
EUROCRYPT
1997
Springer
15 years 10 months ago
The GCHQ Protocol and Its Problems
The UK government is fielding an architecture for secure electronic mail based on the NSA’s Message Security Protocol, with a key escrow scheme inspired by Diffie-Hellman. Attem...
Ross J. Anderson, Michael Roe
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
15 years 11 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
WISA
2009
Springer
16 years 16 days ago
Mediated Ciphertext-Policy Attribute-Based Encryption and Its Application
In Ciphertext-Policy Attribute-Based Encryption (CP-ABE), a user secret key is associated with a set of attributes, and the ciphertext is associated with an access policy over attr...
Luan Ibraimi, Milan Petkovic, Svetla Nikova, Piete...