Approximate-deterministic public key encryption from hard learning problems

DOI10.1007/978-3-319-49890-4_2MaRDI QIDQ3179474zbMATH OpenOpenAlexFDO

Authors Yamin Liu, Xianhui Lu, Bao Li, Wenpan Jing, 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 with errorslearning parity with noisedeterministic public key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
• A generic construction of CCA-secure deterministic encryption
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• Incremental deterministic public-key encryption

Cites work

• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
• Barriers in cryptography with weak, correlated and leaky sources
• Better security for deterministic public-key encryption: the auxiliary-input setting
• Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
• Classical hardness of learning with errors
• Cryptography with auxiliary input and trapdoor from constant-noise LPN
• Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
• Deterministic and Efficiently Searchable Encryption
• Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
• Deterministic public-key encryption for adaptively chosen plaintext distributions
• Dual projective hashing and its applications -- lossy trapdoor functions and more
• IND-CCA secure cryptography based on a variant of the LPN problem
• Identity-based (lossy) trapdoor functions and applications
• Instantiating random oracles via UCEs
• Lapin: an efficient authentication protocol based on ring-LPN
• Learning with rounding, revisited. New reduction, properties and applications
• Lossy codes and a new variant of the learning-with-errors problem
• Lossy trapdoor functions and their applications
• On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the hardness of learning with rounding over small modulus
• Probabilistic encryption
• Pseudorandom functions and lattices
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Public-key cryptosystems from the worst-case shortest vector problem
• Resisting randomness subversion: fast deterministic and hedged public-key encryption in the standard model
• Simple chosen-ciphertext security from low-noise LPN
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller

Cited in

(2)

• Efficient Authentication from Hard Learning Problems
• Efficient authentication from hard learning problems

This page was built for publication: Approximate-deterministic public key encryption from hard learning problems

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