Paper 2024/392

Heuristic Ideal Obfuscation Scheme based on LWE Problem, its Variants and Quantum Oracle

Zhuang Shan, School of Mathematics and Statistics, Xidian University, Xi’an 710126, China
Leyou Zhang, School of Mathematics and Statistics, Xidian University, Xi’an 710126, China
Qing Wu, School of Automation, Xi’an University of Posts and Telecommunications, Xi’an 710121, China
Abstract

This paper presents a heuristic ideal obfuscation scheme based on the learning problem, which di ers from that of Jain, Lin, and Luo [JLLW23]. The paper adopts a method similar to Brakerski, Dottling, Garg, and Malavolta [BDGM22, BDGM20] for constructing iO. It first introduces a variant of the LWR problem and proves its pseudorandomness. Based on the variant of the LWR problem, it constructs LHE, then combines it with sFHE constructed from the LWE problem to further construct the ideal obfuscation scheme. In comparison to the approach by Jain et al., this paper is relatively more specific. Additionally, the paper incorporates the quantum random oracle construction by Jelle Don, et al.[DFMS22] to provide a more concrete quantum random oracle used in the proposed obfuscation scheme.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
Ideal obfuscationSplit FHEQuantum oracleLWELWR
Contact author(s)
arcsec30 @ 163 com
lyzhang @ mail xidian edu cn
History
2024-03-04: approved
2024-03-04: received
See all versions
Short URL
https://ia.cr/2024/392
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/392,
      author = {Zhuang Shan and Leyou Zhang and Qing Wu},
      title = {Heuristic Ideal Obfuscation Scheme based on LWE  Problem, its Variants and Quantum Oracle},
      howpublished = {Cryptology ePrint Archive, Paper 2024/392},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/392}},
      url = {https://eprint.iacr.org/2024/392}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.