Chosen-ciphertext security from subset sum

DOI10.1007/978-3-662-49384-7_2MaRDI QIDQ2798769zbMATH OpenOpenAlexFDO

Authors Sebastian Faust, Daniel Masny, D. Venturi

Publication date 13 April 2016

Published in Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL https://link.springer.com/chapter/10.1007/978-3-662-49384-7_2

zbMATH Keywords

public-key cryptographySubset Sum problemchosen-ciphertext security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• Cramer-Shoup like chosen ciphertext security from LPN
• scientific article; zbMATH DE number 2086698
• Simple chosen-ciphertext security from low-noise LPN
• Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 1852158 (Why is no real title available?)
• scientific article; zbMATH DE number 1903348 (Why is no real title available?)
• A calculus of communicating systems
• A lattice-theoretical fixpoint theorem and its applications
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coinductive Logic Programming
• Constructing optimal binary decision trees is NP-complete
• Foundations of machine learning
• Mining specifications
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(11)

• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Concrete Chosen-Ciphertext Secure Encryption from Subgroup Membership Problems
• Efficient reductions and algorithms for subset product
• Chosen ciphertext security on hard membership decision groups: the case of semi-smooth subgroups of quadratic residues
• scientific article; zbMATH DE number 1440054 (Why is no real title available?)
• Subset Sum Quantumly in 1.17 n .
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Naor-Yung paradigm with shared randomness and applications
• Naor-Yung Paradigm with Shared Randomness and Applications
• Algebraic algorithms for variants of subset sum
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

This page was built for publication: Chosen-ciphertext security from subset sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798769)