Tightly secure ring-LWE based key encapsulation with short ciphertexts
From MaRDI portal
Publication:2167708
DOI10.1007/978-3-319-66402-6_4zbMath1500.94016OpenAlexW2621259841MaRDI QIDQ2167708
Emmanuela Orsini, Martin R. Albrecht, Guy Peer, Nigel P. Smart, Kenneth G. Paterson
Publication date: 25 August 2022
Full work available at URL: http://eprint.iacr.org/2017/354
tight reductionkey encapsulation mechanismlearning with errorstight security proofbasic encryption scheme
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer security (68M25)
Related Items (2)
Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security ⋮ Security of public key encryption against resetting attacks
Cites Work
- Unnamed Item
- On the concrete hardness of learning with errors
- A modular analysis of the Fujisaki-Okamoto transformation
- Efficient ring-LWE encryption on 8-bit AVR processors
- A masked ring-LWE implementation
- Secure integration of asymmetric and symmetric encryption schemes
- Parallel Implementation of BDD Enumeration for LWE
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Lattice Cryptography for the Internet
- A Practical Post-Quantum Public-Key Cryptosystem Based on $$\textsf {spLWE}$$
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Random Oracles in a Quantum World
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Easy Verifiable Primitives and Practical Public Key Cryptosystems
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-based Cryptography
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- A Toolkit for Ring-LWE Cryptography
- Secure integration of asymmetric and symmetric encryption schemes
- Lattice Decoding Attacks on Binary LWE
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Compact Ring-LWE Cryptoprocessor
- Cryptography and Coding
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Tightly secure ring-LWE based key encapsulation with short ciphertexts