25 search results - page 4 / 5 » On the Optimality of Non-Linear Computations of Length-Prese... |
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
CRYPTO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
106
click to vote
EUROPKI
2006
Springer
15 years 2 months ago
2006
Springer
Privacy-aware Public Key Infrastructure (PKI) can maintain user access control and yet protect user privacy, which is envisioned as a promising technique in many emerging applicat...
TIT
2008
14 years 10 months ago
2008
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
79
Voted
ASIACRYPT
2003
Springer
15 years 3 months ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...