ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2301.12060
  4. Cited By
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices
  and Chinese Remainder Theorem

An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem

28 January 2023
Zhiyong Zheng
Fengxia Liu
Kun Tian
ArXivPDFHTML

Papers citing "An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem"

2 / 2 papers shown
Title
Authenticated Sublinear Quantum Private Information Retrieval
Authenticated Sublinear Quantum Private Information Retrieval
Fengxia Liu
Zhiyong Zheng
Kun Tian
Yi Zhang
Heng Guo
Zhe Hu
Oleksiy Zhedanov
Zixian Gong
30
0
0
05 Apr 2025
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
O. Regev
LRM
81
1,073
0
08 Jan 2024
1