期刊文献+

新形态伪随机函数研究

Research of New Forms of Pseudorandom Random Function
下载PDF
导出
摘要 随着云计算模式的普及应用,对密文数据的安全外包计算的研究已是必然趋势,由此,潜在的密文数据的安全计算和隐私保护问题愈加受到业界和学界的关注。新形态伪随机函数(Pseudorandom Function,PRF)作为解决密文安全计算与检索的重要工具之一,已是当前密码学的研究热点。当前,以密文安全计算为目标,结合全同态加密(Fully Homomorphic Encryption,FHE)与格密码、门限密码、安全多方计算(Multiparty Computing,MPC)和PRF等密码学原语,对新形态伪随机函数的研究主要集中在三方面:1)格基限制隐藏的PRF可验证性研究;2)格基受限PRF适应性安全研究;3)格基多点隐私可穿刺PRF应用性研究。因此,文章从PRF的可验证性、安全性和应用性三方面,较为全面地介绍当前重要的研究成果。 The outsourcing of computing and data storage services has become a common practice with the rise in popularity of the cloud computing model,and concerns about data security and privacy protection are receiving more and more attention from business community and academic community.One of the current research topics in cryptography is new forms of Pseudorandom Function(PRF),a tool for retrieval and a solution to one of the problems with ciphertext security.Many cryptographic primitives are currently being investigated to target encrypted data secure computing,such as fully homomorphic encryption(FHE),lattice-based cryptography,threshold cryptography,secure multiparty computing and PRF.The study of new forms of PRF is now primarily focused on three aspects:1)lattice-based private constrained PRF with verifiability;2)lattice-based constrained PRF with adaptive security;and 3)latticebased multi-point puncturable PRF with applicability.In a nutshell,this paper thoroughly analyzed the significant research findings in this area.
作者 李增鹏 王梅 陈梦佳 LI Zengpeng;WANG Mei;CHEN Mengjia(School of Cyber Science and Technology,Shandong University,Qingdao 266237,China)
出处 《信息网络安全》 CSCD 北大核心 2023年第5期11-21,共11页 Netinfo Security
基金 国家科技部重点研发计划[2021YFA1000600] 国家自然科学基金[61802214]。
关键词 格基密码学 全同态加密 安全多方计算 伪随机函数 密文安全计算 lattice-based cryptography fully homomorphic encryption secure multiparty computing pseudorandom function encrypted data secure computing
  • 相关文献

参考文献1

二级参考文献10

  • 1Oded Regev.On lattices, learning with errors, random linear codes, and cryptography[J].Journal of the ACM (JACM).2009(6) 被引量:2
  • 2Johannes Bl?mer,Stefanie Naewe.Sampling methods for shortest vectors, closest vectors and successive minima[J].Theoretical Computer Science.2009(18) 被引量:1
  • 3Phong Q. Nguyen,Thomas Vidick.Sieve algorithms for the shortest vector problem are practical[J].Journal of Mathematical Cryptology.2008(2) 被引量:1
  • 4Jean-Sebastien Coron,Alexander May.Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring[J].Journal of Cryptology.2007(1) 被引量:1
  • 5Dorit Aharonov,Oded Regev.Lattice problems in NP ∩ coNP[J].Journal of the ACM (JACM).2005(5) 被引量:1
  • 6Subhash Khot.Hardness of approximating the shortest vector problem in lattices[J].Journal of the ACM (JACM).2005(5) 被引量:1
  • 7Phong Q. Nguyen,Igor E. Shparlinski.The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces[J].Designs Codes and Cryptography.2003(2) 被引量:1
  • 8I. Dinur,G. Kindler,R. Raz,S. Safra.Approximating CVP to Within Almost-Polynomial Factors is NP-Hard[J].COMBINATORICA.2003(2) 被引量:1
  • 9Irit Dinur.Approximating SVP ∞ to within almost-polynomial factors is NP-hard[J].Theoretical Computer Science.2002(1) 被引量:1
  • 10Jin-Yi Cai.A new transference theorem in the geometry of numbers and new bounds for Ajtai’s connection factor[J].Discrete Applied Mathematics.2002(1) 被引量:1

共引文献44

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部