Approximate-Deterministic Public Key Encryption from Hard Learning Problems

DOI10.1007/978-3-319-49890-4_2zbMath1411.94075OpenAlexW2552159528MaRDI QIDQ3179474

Wenpan Jing, Bao Li, Xianhui Lu, Yamin Liu, Fuyang Fang

Publication date: 21 December 2016

Published in: Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-49890-4_2

zbMATH Keywords

learning parity with noiselearning with errorsdeterministic public key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Probabilistic encryption
• On the Hardness of Learning with Rounding over Small Modulus
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
• Learning with Rounding, Revisited
• Instantiating Random Oracles via UCEs
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Identity-Based (Lossy) Trapdoor Functions and Applications
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting
• Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
• Barriers in cryptography with weak, correlated and leaky sources
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• Lossy trapdoor functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• A Framework for Efficient and Composable Oblivious Transfer
• Deterministic and Efficiently Searchable Encryption
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• Lapin: An Efficient Authentication Protocol Based on Ring-LPN
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
• Lossy Codes and a New Variant of the Learning-With-Errors Problem
• Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
• Simple Chosen-Ciphertext Security from Low-Noise LPN
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Approximate-Deterministic Public Key Encryption from Hard Learning Problems