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(λn^(2))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.展开更多
A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data tran...A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.展开更多
This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a functionf(x), and the other party (Bob) with an input α wants to learnf(α) in an oblivious way with the h...This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a functionf(x), and the other party (Bob) with an input α wants to learnf(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret functionf(x) among the servers. Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper. Keywords oblivious function evaluation - oblivious polynomial evaluation - secure multiparty computation - distributed - information security The research is supported by the National Basic Research 973 Program of China under Grant No. 1999035802 and the National Natural Science Foundation of China under Grant No.60273029.Hong-Da Li was born in 1960. He received the Ph.D. degree from Northwestern Polytechnical University in 2001. His current research interests are cryptology and cryptographic protocol.Xiong Yang received the B.S. degree in mathematics from Yan'an University, China, in 1984. He is an associate professor in College of Economy and Trade at South China University of Tropical Agriculture. His research interest is information security.Deng-Guo Feng was born in 1963. He is now a Ph.D. supervisor. His research interests focus on information security.Bao Li was born in 1965. He received the Ph.D. degree in cryptography in 1995 from Xidian University. His research interests include cryptographic protocols and public key cryptosystems.展开更多
当前,数据已成为关键战略资源,数据挖掘和分析技术在各行业发挥着重要作用,但也存在着数据泄露的风险。安全函数计算(Secure Function Evaluation,SFE)可以在保证数据安全的前提下完成任意函数的计算。Yao协议是一种用于实现安全函数计...当前,数据已成为关键战略资源,数据挖掘和分析技术在各行业发挥着重要作用,但也存在着数据泄露的风险。安全函数计算(Secure Function Evaluation,SFE)可以在保证数据安全的前提下完成任意函数的计算。Yao协议是一种用于实现安全函数计算的协议,该协议在混淆电路(Garbled Circuit,GC)生成和计算阶段含有大量加解密计算操作,且在不经意传输(Oblivious Transfer,OT)阶段具有较高的计算开销,难以满足复杂的现实应用需求。针对Yao协议的效率问题,基于现场可编程门阵列(Field Programmable Gate Array,FPGA)的异构计算对Yao协议进行加速,并结合提出的轻量级代理不经意传输协议,最终设计出轻量级异构安全计算加速框架。该方案中,混淆电路生成方和代理计算方都实现了CPU-FPGA异构计算架构。该架构借助CPU擅长处理控制流的优势和FPGA的并行处理优势对混淆电路生成阶段和计算阶段进行加速,提高了生成混淆电路和计算混淆电路的效率,减轻了计算压力。另外,相比于通过非对称密码算法实现的不经意传输协议,在轻量级代理不经意传输协议中,混淆电路生成方和代理计算方只需执行对称操作,代理计算方即可获取用户输入对应的生成方持有的随机数。该轻量级代理不经意传输协议减轻了用户和服务器在不经意传输阶段的计算压力。实验证明,在局域网环境下,与Yao协议的软件实现(TinyGarble框架)相比,该方案的计算效率至少提高了128倍。展开更多
隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求....隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求.对安全多方计算基础理论进行了简要介绍,并重点介绍了目前主流的安全多方计算框架下2类PSI研究技术:传统的基于公钥加密机制,混乱电路,不经意传输的PSI协议和新型的云辅助的PSI协议,并对各类协议的过程、适用性、复杂性进行简要分析总结.同时,也对隐私保护集合交集问题的应用场景进行详细说明,进一步体现对该问题的实际研究价值.随着对该问题的不断深入研究,目前已经设计了在半诚实模型下快速完成上亿元素规模的隐私集合求交集协议.展开更多
Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks...Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.展开更多
IETF提出的服务功能链(Service Function Chain,SFC)解决了服务功能在部署过程中网络拓扑与硬件设备紧密耦合、灵活性差等问题,其中,NSH协议用于支持服务功能链的实现.然而,标准的Open Flow协议对NSH协议支持不足、实现过程复杂且实现...IETF提出的服务功能链(Service Function Chain,SFC)解决了服务功能在部署过程中网络拓扑与硬件设备紧密耦合、灵活性差等问题,其中,NSH协议用于支持服务功能链的实现.然而,标准的Open Flow协议对NSH协议支持不足、实现过程复杂且实现后造成兼容性等问题.本文基于软件定义网络(Software Defined Network,SDN)和网络功能虚拟化(Network Function Virtualization,NFV)技术,根据IETF规定的相关标准,提出一种基于协议无感知转发(Protocol Oblivious Forwarding,POF)的服务功能链,利用POF在数据平面深度可编程的能力实现NSH协议.文中基于Flood Light控制器和POF交换机实现了该服务功能链,实验结果表明,基于协议无感知转发的服务功能链可以高效地实现服务功能的部署.展开更多
基金supported by National Key R&D Program of China(No.2022ZD0161901)the National Natural Science Foundation of China(Grant No.62072023)+3 种基金Beijing Natural Science Foundation(No.4242024)the Open Project Fund of the State Key Laboratory of Cryptology,China(No.MMKFKT202120)the Exploratory Optional Project Fund of the State Key Laboratory of Complex&Critical Software Environment(No.SKLCCSE-2025ZX-XX)the Fundamental Research Funds of Beihang University,China(Nos.YWF-21-BJ-J-1041 and YWF-23-L-1033).
文摘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(λn^(2))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.
基金the National Natural Science Foundation of China (Grant No. 61601517)basic and advanced technology research project of Henan Province, China (Grant No. 2014302703)
文摘A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.
文摘This paper is about distributed oblivious function evaluation (DOFE). In this setting one party (Alice) has a functionf(x), and the other party (Bob) with an input α wants to learnf(α) in an oblivious way with the help of a set of servers. What Alice should do is to share her secret functionf(x) among the servers. Bob obtains what he should get by interacting with the servers. This paper proposes the model and security requirements for DOFE and analyzes three distributed oblivious polynomial evaluation protocols presented in the paper. Keywords oblivious function evaluation - oblivious polynomial evaluation - secure multiparty computation - distributed - information security The research is supported by the National Basic Research 973 Program of China under Grant No. 1999035802 and the National Natural Science Foundation of China under Grant No.60273029.Hong-Da Li was born in 1960. He received the Ph.D. degree from Northwestern Polytechnical University in 2001. His current research interests are cryptology and cryptographic protocol.Xiong Yang received the B.S. degree in mathematics from Yan'an University, China, in 1984. He is an associate professor in College of Economy and Trade at South China University of Tropical Agriculture. His research interest is information security.Deng-Guo Feng was born in 1963. He is now a Ph.D. supervisor. His research interests focus on information security.Bao Li was born in 1965. He received the Ph.D. degree in cryptography in 1995 from Xidian University. His research interests include cryptographic protocols and public key cryptosystems.
文摘不经意传输(OT,oblivious transfer)协议是密码学中的一个基本协议。基于物理不可克隆函数(PUF,physical unclonable function)给出物理不可克隆函数系统(PUFS,physical unclonable function system)的概念,并在此基础上提出一个新的不经意传输协议(POT,PUFS based OT),最后在通用可组合(UC,universal composition)框架内给出POT协议抵抗静态敌手的安全性证明。相比于传统基于公钥加密的OT方案,POT协议不使用任何可计算的假设,而是基于PUFS的安全属性实现,因此在很大程度上减小了计算和通信开销。
文摘隐私保护集合交集(private set intersection,PSI)计算属于安全多方计算领域的特定应用问题,不仅具有重要的理论意义也具有很强的应用背景,在大数据时代,对该问题的研究更是符合人们日益强烈的在享受各种服务的同时达到隐私保护的需求.对安全多方计算基础理论进行了简要介绍,并重点介绍了目前主流的安全多方计算框架下2类PSI研究技术:传统的基于公钥加密机制,混乱电路,不经意传输的PSI协议和新型的云辅助的PSI协议,并对各类协议的过程、适用性、复杂性进行简要分析总结.同时,也对隐私保护集合交集问题的应用场景进行详细说明,进一步体现对该问题的实际研究价值.随着对该问题的不断深入研究,目前已经设计了在半诚实模型下快速完成上亿元素规模的隐私集合求交集协议.
基金Supported by the National Natural Science Foundation of China(11371290,61301178)the Science and Technology Innovation Foundation of Xi'an(CXY1352WL28,CXY1352WL27)
文摘Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.
文摘IETF提出的服务功能链(Service Function Chain,SFC)解决了服务功能在部署过程中网络拓扑与硬件设备紧密耦合、灵活性差等问题,其中,NSH协议用于支持服务功能链的实现.然而,标准的Open Flow协议对NSH协议支持不足、实现过程复杂且实现后造成兼容性等问题.本文基于软件定义网络(Software Defined Network,SDN)和网络功能虚拟化(Network Function Virtualization,NFV)技术,根据IETF规定的相关标准,提出一种基于协议无感知转发(Protocol Oblivious Forwarding,POF)的服务功能链,利用POF在数据平面深度可编程的能力实现NSH协议.文中基于Flood Light控制器和POF交换机实现了该服务功能链,实验结果表明,基于协议无感知转发的服务功能链可以高效地实现服务功能的部署.
