Lattice-based completely non-malleable public-key encryption in the standard model
From MaRDI portal
Publication:2448075
DOI10.1007/s10623-012-9732-0zbMath1342.94095OpenAlexW1989105251WikidataQ59484952 ScholiaQ59484952MaRDI QIDQ2448075
Reza Sepahi, Josef Pieprzyk, Ron Steinfeld
Publication date: 29 April 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9732-0
Related Items (2)
A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model ⋮ Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Lattice-Based Completely Non-malleable PKE in the Standard Model (Poster)
- Collision-Free Hashing from Lattice Problems
- Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- An Efficient and Parallel Gaussian Sampler for Lattices
- Efficient Completely Non-malleable Public Key Encryption
- Programmable Hash Functions and Their Applications
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- On the security of public key protocols
- Nonmalleable Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Generating Shorter Bases for Hard Random Lattices
- Completely Non-malleable Encryption Revisited
- Certificateless Encryption Schemes Strongly Secure in the Standard Model
- Asymptotically Efficient Lattice-Based Digital Signatures
- Automata, Languages and Programming
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Lattice-based completely non-malleable public-key encryption in the standard model