58 search results - page 1 / 12 » Coding Constructions for Blacklisting Problems without Compu... |
CRYPTO
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
EUROCRYPT
2008
Springer
13 years 6 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...