33 search results - page 4 / 7 » Public-Key Encryption with Lazy Parties |
IWDW
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we present a new method for sharing images between two parties exploiting homomorphic property of public key cryptosystem. With our method, we show that it is possib...
ESORICS
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
ASIACRYPT
2009
Springer
14 years 4 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
CRYPTO
2010
Springer
13 years 11 months ago
2010
Springer
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...