346 search results - page 58 / 70 » The Secret Santa Problem |
140
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
179
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
133
Voted
DRM
2003
Springer
15 years 8 months ago
2003
Springer
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
134
Voted
DSOM
2003
Springer
15 years 8 months ago
2003
Springer
TrustedFlow™ is a software solution to the problem of remotely authenticating code during execution. A continuous flow of idiosyncratic signatures assures that the software from ...
137
Voted
CRYPTO
1993
Springer
15 years 7 months ago
1993
Springer
A broadcast encryption scheme allows the sender to securely distribute data to a dynamically changing set of users over an insecure channel. One of the most challenging settings fo...