346 search results - page 8 / 70 » The Secret Santa Problem |
CRYPTO
2009
Springer
14 years 4 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We study the problem of partial key exposure. Standard cryptographic definitions and constructions do not guarantee any security even if a tiny fraction of the secret key...
DAM
2006
13 years 9 months ago
2006
The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied ...
NSPW
2004
ACM
14 years 3 months ago
2004
ACM
(by Victor Raskin) This panel will address users’ perceptions and misperceptions of the risk/benefit and benefit/nuisance ratios associated with information security products, an...
EUROCRYPT
2000
Springer
14 years 1 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...