Verifiable single-server private information retrieval from LWE with binary errors

DOI10.1016/j.ins.2020.08.071zbMath1475.68117OpenAlexW3082476294MaRDI QIDQ2055570

Yanyan Li

Publication date: 1 December 2021

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.08.071

zbMATH Keywords

homomorphic encryptionlearning with binary errorsprobabilistic verification processshort integer solution

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Information storage and retrieval of data (68P20) Privacy of data (68P27)

Cites Work

• Generating shorter bases for hard random lattices
• Privacy-enhanced attribute-based private information retrieval
• Verifiable single-server private information retrieval
• Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem
• A Decade of Lattice Cryptography
• On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
• Hardness of SIS and LWE with Small Parameters
• New Algorithms for Learning in Presence of Errors
• Private information retrieval
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Trapdoors for hard lattices and new cryptographic constructions
• Multi-query Computationally-Private Information Retrieval with Constant Communication Rate
• Fully Homomorphic Encryption over the Integers
• A Simple BGN-Type Cryptosystem from LWE
• Batch codes and their applications
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Upper bound on the communication complexity of private information retrieval
• The Capacity of Private Information Retrieval from Byzantine and Colluding Databases
• Verifiable Multi-server Private Information Retrieval
• Fully homomorphic encryption using ideal lattices
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Information Security
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• Theory of Cryptography
• Automata, Languages and Programming
• A Survey of Single-Database Private Information Retrieval: Techniques and Applications
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifiable single-server private information retrieval from LWE with binary errors