Chosen-Ciphertext Security from Subset Sum

DOI10.1007/978-3-662-49384-7_2zbMath1388.94053OpenAlexW2296501007MaRDI QIDQ2798769

Sebastian Faust, Daniele Venturi, Daniel Masny

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)

Related Items (6)

Naor-Yung paradigm with shared randomness and applications ⋮ Algebraic algorithms for variants of subset sum ⋮ Efficient reductions and algorithms for subset product ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A calculus of communicating systems
• Constructing optimal binary decision trees is NP-complete
• A lattice-theoretical fixpoint theorem and its applications
• Mining specifications
• Co-Logic Programming: Extending Logic Programming with Coinduction
• Coinductive Logic Programming
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Chosen-Ciphertext Security from Subset Sum