3190 search results - page 117 / 638 » cans 2011 |
110
Voted
IACR
2011
14 years 10 days ago
2011
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous latticeba...
83
Voted
IACR
2011
14 years 10 days ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
IACR
2011
14 years 10 days ago
2011
A theme of recent side-channel research has been the quest for distinguishers which remain eective even when few assumptions can be made about the underlying distribution of the m...
107
click to vote
IACR
2011
14 years 10 days ago
2011
Companies, organizations, and individuals often wish to share information to realize valuable social and economic goals. Unfortunately, privacy concerns often stand in the way of ...
106
click to vote
IACR
2011
14 years 10 days ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...