132 search results - page 17 / 27 » Some Bounds and a Construction for Secure Broadcast Encrypti... |
PODC
2010
ACM
13 years 11 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
ICCSA
2005
Springer
14 years 1 months ago
2005
Springer
Recently, Nenadi´c et al. (2004) proposed the RSA-CEGD protocol for certified delivery of e-goods. This is a relatively complex scheme based on verifiable and recoverable encryp...
TCC
2010
Springer
14 years 4 months ago
2010
Springer
A family of trapdoor functions is one-way under correlated inputs if no efficient adversary can invert it even when given the value of the function on multiple correlated inputs. T...