Chosen-ciphertext lattice-based public key encryption with equality test in standard model

DOI10.1016/j.tcs.2021.12.013OpenAlexW4200163074WikidataQ122751256 ScholiaQ122751256MaRDI QIDQ2072076

Partha Sarathi Roy, Shinsaku Kiyomoto, Arnaud Sipasseuth, Kazuhide Fukushima, Willy Susilo, Dung Hoang Duong

Publication date: 1 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.03178

zbMATH Keywords

cloud computingpost-quantum cryptographylearning with errorsequality testshort integer solution

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Lattice-based IBE with equality test supporting flexible authorization in the standard model

Uses Software

• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical implementation of Ring-SIS/LWE based signature and IBE
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Efficient public key encryption with equality test in the standard model
• Public key encryption schemes supporting equality test with authorisation of different granularity
• Lattice-based IBE with equality test supporting flexible authorization in the standard model
• Lattice-based public-key encryption with equality test supporting flexible authorization in standard model
• A lattice-based public key encryption with equality test in standard model
• Lattice-based IBE with equality test in standard model
• Semi-generic construction of public key encryption and identity-based encryption with equality test
• Asymptotically efficient lattice-based digital signatures
• Public key encryption with equality test in the standard model
• Hardness of SIS and LWE with Small Parameters
• Improved Short Lattice Signatures in the Standard Model
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Towards Public Key Encryption Scheme Supporting Equality Test with Fine-Grained Authorization
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Bonsai Trees, or How to Delegate a Lattice Basis
• Efficient Lattice (H)IBE in the Standard Model
• Generalized Compact Knapsacks Are Collision Resistant
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A Toolkit for Ring-LWE Cryptography
• A Lattice-Based Certificateless Public Key Encryption with Equality Test in Standard Model
• Probabilistic Public Key Encryption with Equality Test
• Efficient CCA-Secure PKE from Identity-Based Techniques
• Advances in Cryptology - EUROCRYPT 2004
• Generating Shorter Bases for Hard Random Lattices
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Chosen-ciphertext lattice-based public key encryption with equality test in standard model