| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4951953 | Theoretical Computer Science | 2017 | 24 Pages |
Abstract
As an additional contribution, we design the first PKE scheme whose CPA security under KDM attacks can be directly reduced to (low-density instances of) the Subset Sum assumption. Our PKE scheme supports key-dependent messages computed via any affine function of the secret key.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Silvio Biagioni, Daniel Masny, Daniele Venturi,