346 search results - page 5 / 70 » The Secret Santa Problem |
TCC
2010
Springer
14 years 6 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel's choice of platform (t...
FC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Anonymity-protection techniques are crucial for various commercial and financial transactions, where participants are worried about their privacy. On the other hand, aut...
FOGA
1992
13 years 11 months ago
1992
The building-block hypothesis states that the GA works well when short, low-order, highly-fit schemas recombine to form even more highly fit higher-order schemas. The ability to p...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...