Paper 2024/1349

Oblivious Pseudo Random Function base on Ideal Lattice, Application in PSI and PIR

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
Qiqi Lai, School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
Fuchun Guo, Centre for Computer and Information Security Research, University of Wollongong, Wollongong, NSW 2522, Australia
Abstract

Privacy set intersection (PSI) and private information retrieval (PIR) are important areas of research in privacy protection technology. One of the key tools for both is the oblivious pseudorandom function (OPRF). Currently, existing oblivious pseudorandom functions either focus solely on efficiency without considering quantum attacks, or are too complex, resulting in low efficiency. The aim of this paper is to achieve a balance: to ensure that the oblivious pseudorandom function can withstand quantum attacks while simplifying its structure as much as possible. This paper constructs an efficient oblivious pseudorandom function based on the ideal lattice hardness assumption and the oblivious transfer (OT) technique by Chase and Miao (CRYPTO 2020), and also constructs PSI and PIR.

Metadata
Available format(s)
-- withdrawn --
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
OPRFPSIPIR
Contact author(s)
arcsec30 @ 163 com
lyzhang @ mail xidian edu cn
xiyouwuq @ 126 com
laiqq @ snnu edu cn
fuchun @ uow edu au
History
2024-11-04: withdrawn
2024-08-28: received
See all versions
Short URL
https://ia.cr/2024/1349
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.