期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3篇文章
< 1 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Multivariate basic function secret sharing from oblivious transfer 认领 引用
1
作者 Yanqing YAO Fangyuan MIN 《Frontiers of Computer Science》 SCIE EI CSCD 2025年第10期123-137,共15页
Function secret sharing(FSS)is a secret sharing technique for functions in a specific function class,mainly including distributed point function(DPF)and distributed comparison function(DCF).As an important basis for f... Function secret sharing(FSS)is a secret sharing technique for functions in a specific function class,mainly including distributed point function(DPF)and distributed comparison function(DCF).As an important basis for function secret sharing,DPF and DCF are the foundation for the extension of this technique to other more general and complex function classes.However,the function classes corresponding to the current DPF and DCF schemes are almost all unary function classes,and there is no efficient construction for multivariate function classes.The applications of FSS can be extended with the development of a multivariate scheme,e.g.,a multi-keyword private information retrieval scheme can be constructed.To solve this problem,this paper presents a binary DCF scheme based on the“two-layer binary tree”structure.In a binary tree structure,each node computes the seed of its child nodes based on its own seed.The key technique is to realize the transition transfer of seeds by using oblivious transfer,to connect two unary structures.Theoretical analysis and experimental results show that our binary scheme changes from single-round communication in the original definition to multiround communication,and has great advantages in communication cost and computation efficiency.For the security parameterλand input length n,the key size is reduced from to O(λn2)to O(λn)In addition,we explore the extensions and applications of the above method.In the batch computation,this paper uses oblivious transfer(OT)extension to realize the one-time transmission of multiple pairs of seeds and optimize its communication efficiency.By extending the structure from“two-layer”to“multi-layer”,a secret sharing scheme of multivariate mixed basic function is proposed based on the serial thought.Furthermore,by employing the parallel thought,a general 2-layer FSS structure from OT for multivariate mixed basic functions is explored to enhance the efficiency,where the first layer is composed of d parallel binary trees with d representing the input dimension,and the second layer is one binary tree of depth d.And the applications of our schemes in multi-keyword private information retrieval are presented. 展开更多
关键词 function secret sharing binary distributed comparison function oblivious transfer multivariate basic function private information retrieval
暂未订购 下载PDF
集合交集元素关联值的隐私计算 认领 引用
2
作者 孙世恺 李作辉 《信息安全研究》 CSCD 北大核心 2025年第7期645-651,共7页
集合交集关联值的隐私计算是隐私集合交集问题的扩展,是安全多方计算领域一个新的问题.主要提出3种集合交集元素关联值的隐私计算方案,采用秘密分享结合双云服务器,设计并实现了一种分布式不经意伪随机函数(Otd-PRF),增强了参与方数据... 集合交集关联值的隐私计算是隐私集合交集问题的扩展,是安全多方计算领域一个新的问题.主要提出3种集合交集元素关联值的隐私计算方案,采用秘密分享结合双云服务器,设计并实现了一种分布式不经意伪随机函数(Otd-PRF),增强了参与方数据的隐私性,同时利用同态技术将计算开销外包至云端,降低了参与方的计算复杂度.在上述基础上结合不经意多项式插值技术与ElGamal加密算法,实现了两方集合交集元素关联值之和、交集元素关联值之和与阈值的关系、交集元素关联值的平均值的隐私计算方案.且利用模拟范例方法,在半诚实模型上证明了该方案的安全性,并利用计算与通信复杂度对方案的性能进行了分析. 展开更多
关键词 集合交集 交集元素关联值 分布式不经意伪随机函数 ElGamal加密算法 云辅助
暂未订购 下载PDF
Multi-Value Sequence Generated over Sub Extension Field and Its Properties 认领 引用
3
作者 Md. Arshad Ali Yuta Kodera +3 位作者 Takuya Kusaka Satoshi Uehara Yasuyuki Nogami Robert H. Morelos-Zaragoza 《Journal of Information Security》 2019年第3期130-154,共25页
Pseudo-random sequences with long period, low correlation, high linear complexity, and uniform distribution of bit patterns are widely used in the field of information security and cryptography. This paper proposes an... Pseudo-random sequences with long period, low correlation, high linear complexity, and uniform distribution of bit patterns are widely used in the field of information security and cryptography. This paper proposes an approach for generating a pseudo-random multi-value sequence (including a binary sequence) by utilizing a primitive polynomial, trace function, and k-th power residue symbol over the sub extension field. All our previous sequences are defined over the prime field, whereas, proposed sequence in this paper is defined over the sub extension field. Thus, it’s a new and innovative perception to consider the sub extension field during the sequence generation procedure. By considering the sub extension field, two notable outcomes are: proposed sequence holds higher linear complexity and more uniform distribution of bit patterns compared to our previous work which defined over the prime field. Additionally, other important properties of the proposed multi-value sequence such as period, autocorrelation, and cross-correlation are theoretically shown along with some experimental results. 展开更多
关键词 Pseudo-Random Sequence Trace Function Power Residue Symbol Sub Extension Field Autocorrelation Cross-Correlation Linear Complexity Distribution of Bit Patterns
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈