Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

@inproceedings{Lyubashevsky2009PublicKeyCP,
  title={Public-Key Cryptographic Primitives Provably as Secure as Subset Sum},
  author={Vadim Lyubashevsky and Adriana Palacio and Gil Segev},
  booktitle={IACR Cryptology ePrint Archive},
  year={2009}
}
We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum problem. The subset sum assumption required for the security of our scheme is weaker than that of existing subset-sum based encryption schemes, namely the lattice-based schemes of Ajtai and Dwork (STOC ’97), Regev (STOC ’03, STOC ’05), and Peikert (STOC ’09). Additionally, our proof of security is simple and direct. We also… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 26 extracted citations

Similar Papers

Loading similar papers…