Chosen-Ciphertext Security from Subset Sum


We construct a public-key encryption (PKE) scheme whose security is polynomial-time equivalent to the hardness of the Subset Sum problem. Our scheme achieves the standard notion of indistinguishability against chosen-ciphertext attacks (IND-CCA) and can be used to encrypt messages of arbitrary polynomial length, improving upon a previous construction by… (More)
DOI: 10.1007/978-3-662-49384-7_2


Cite this paper

@inproceedings{Faust2015ChosenCiphertextSF, title={Chosen-Ciphertext Security from Subset Sum}, author={Sebastian Faust and Daniel Masny and Daniele Venturi}, booktitle={IACR Cryptology ePrint Archive}, year={2015} }