Abstract
The Naccache-Stern public-key cryptosystem (NS) relies on the conjectured hardness of the modular multiplicative knapsack problem: Given (Formula Presented). Given this scheme’s algebraic structure it is interesting to systematically explore its variants and generalizations. In particular it might be useful to enhance NS with features such as semantic security, re-randomizability or an extension to higher-residues. This paper addresses these questions and proposes several such variants.
Cite
CITATION STYLE
Brier, É., Géraud, R., & Naccache, D. (2017). Exploring Naccache-Stern Knapsack Encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10543 LNCS, pp. 67–82). Springer Verlag. https://doi.org/10.1007/978-3-319-69284-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
