The current development toward quantum attack has shocked our confidence on classical digital signature schemes.As one of the mainstreams of post quantum cryptography primitives,hash-based signature has attracted more...The current development toward quantum attack has shocked our confidence on classical digital signature schemes.As one of the mainstreams of post quantum cryptography primitives,hash-based signature has attracted more and more concern in both cryptographic research and application in recent years.The goal of this paper is to present,classify and discuss different solutions for hash-based signature.Firstly,this paper discusses the research progress in the component of hash-based signature,i.e.,one-time signature and few-time signature;then classifies the tree-based public key authentication schemes of hash-based signature into limited number and stateful schemes,unlimited number and stateful schemes and unlimited number and stateless schemes.The above discussion aims to analyze the overall design idea of different categories of hash-based signatures,as well as the construction,security reduction and performance efficiency of specific schemes.Finally,the perspectives and possible development directions of hash-based signature are briefly discussed.展开更多
Searchable symmetric encryption(SSE)has been introduced for secure outsourcing the encrypted database to cloud storage,while maintaining searchable features.Of various SSE schemes,most of them assume the server is hon...Searchable symmetric encryption(SSE)has been introduced for secure outsourcing the encrypted database to cloud storage,while maintaining searchable features.Of various SSE schemes,most of them assume the server is honest but curious,while the server may be trustless in the real world.Considering a malicious server not honestly performing the queries,verifiable SSE(VSSE)schemes are constructed to ensure the verifiability of the search results.However,existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.To address this challenge,we present an efficient VSSE scheme,built on OXT protocol(Cash et al.,CRYPTO 2013),for conjunctive keyword queries with sublinear search overhead.The proposed VSSE scheme is based on a privacy-preserving hash-based accumulator,by leveraging a well-established cryptographic primitive,Symmetric Hidden Vector Encryption(SHVE).Our VSSE scheme enables both correctness and completeness verifiability for the result without pairing operations,thus greatly reducing the computational cost in the verification process.Besides,the proposed VSSE scheme can still provide a proof when the search result is empty.Finally,the security analysis and experimental evaluation are given to demonstrate the security and practicality of the proposed scheme.展开更多
Since Multivatriate Quadratic(MQ)-based Public Key Cryptosystem(MPKC)has been one of the hot research fields of post-quantum cryptography,it becomes important to analyze the security of new MPKC schemes.Wang et al.pro...Since Multivatriate Quadratic(MQ)-based Public Key Cryptosystem(MPKC)has been one of the hot research fields of post-quantum cryptography,it becomes important to analyze the security of new MPKC schemes.Wang et al.proposed a novel multivariate signature scheme with Hash-based Tame Transformation and Minus(HTTM)in 2011.For this extended MQ-based signature,we can transform it into an SFLASH variant by splitting and merging HT transformation,and solve an equivalent private key corresponding to the public key of HTTM.Thus,the adversary can forge legitimate signature for any message by using this equivalent private key.展开更多
5G provides a unified authentication architecture and access management for IoT(Internet of Things)devices.But existing authentication services cannot cover massive IoT devices with various computing capabilities.In a...5G provides a unified authentication architecture and access management for IoT(Internet of Things)devices.But existing authentication services cannot cover massive IoT devices with various computing capabilities.In addition,with the development of quantum computing,authentication schemes based on traditional digital signature technology may not be as secure as we expected.This paper studies the authentication mechanism from the user equipment to the external data network in 5G and proposed an authentication protocol prototype that conforms to the Third Generation Partnership Program(3GPP)standard.This prototype can accommodate various Hash-based signature technologies,applying their advantages in resource consumption to meet the authentication requirements of multiple types of IoT devices.The operation of the proposed authentication scheme is mainly based on the Hash function,which is more efficient than the traditional authentication scheme.It provides flexible and high-quality authentication services for IoT devices cluster in the 5G environment combining the advantages of Hash-based signature technology and 5G architecture.展开更多
In distributed systems, it is important to adjust load distribution dynamically based on server performance and load information. Meanwhile, gray release and rapid expansion are the basic requirements to ensure reliab...In distributed systems, it is important to adjust load distribution dynamically based on server performance and load information. Meanwhile, gray release and rapid expansion are the basic requirements to ensure reliability and stability for systems with short version iteration cycles. The traditional Hash algorithm performs poorly in gray release, rapid expansion, and load distribution. To solve these problems, a novel Hash-based dynamic mapping(HDM) load balancing algorithm was proposed. On the one hand, this algorithm can adjust the load distribution dynamically based on server performance and load information. On the other hand, it implements gray release by controlling the ratio of requests assigned to the changed nodes. Additionally, HDM has a higher expansion efficiency. Experiments show that the HDM distributes the load more reasonably, provides a more stable gray release ratio, and has a higher expansion efficiency.展开更多
图半监督学习(Graph based semi-supervised learning,GSL)方法需要花费大量时间构造一个近邻图,速度比较慢.本文提出了一种哈希图半监督学习(Hash graph based semi-supervised learning,HGSL)方法,该方法通过局部敏感的哈希函数进行...图半监督学习(Graph based semi-supervised learning,GSL)方法需要花费大量时间构造一个近邻图,速度比较慢.本文提出了一种哈希图半监督学习(Hash graph based semi-supervised learning,HGSL)方法,该方法通过局部敏感的哈希函数进行近邻搜索,可以有效降低图半监督学习方法所需的构图时间.图像分割实验表明,该方法一方面可以达到更好的分割效果,使分割准确率提高0.47%左右;另一方面可以大幅度减小分割时间,以一幅大小为300像素×800像素的图像为例,分割时间可减少为图半监督学习所需时间的28.5%左右.展开更多
基金National Natural Science Foundation of China(No.61972391).
文摘The current development toward quantum attack has shocked our confidence on classical digital signature schemes.As one of the mainstreams of post quantum cryptography primitives,hash-based signature has attracted more and more concern in both cryptographic research and application in recent years.The goal of this paper is to present,classify and discuss different solutions for hash-based signature.Firstly,this paper discusses the research progress in the component of hash-based signature,i.e.,one-time signature and few-time signature;then classifies the tree-based public key authentication schemes of hash-based signature into limited number and stateful schemes,unlimited number and stateful schemes and unlimited number and stateless schemes.The above discussion aims to analyze the overall design idea of different categories of hash-based signatures,as well as the construction,security reduction and performance efficiency of specific schemes.Finally,the perspectives and possible development directions of hash-based signature are briefly discussed.
基金supported by the National Natural Science Foundation of China (Grant Nos.61932010 and 62072357)the Zhuhai Top Discipline-Information Securitysupported by the China Scholarship Council (CSC)and the Australian Research Council (ARC).
文摘Searchable symmetric encryption(SSE)has been introduced for secure outsourcing the encrypted database to cloud storage,while maintaining searchable features.Of various SSE schemes,most of them assume the server is honest but curious,while the server may be trustless in the real world.Considering a malicious server not honestly performing the queries,verifiable SSE(VSSE)schemes are constructed to ensure the verifiability of the search results.However,existing VSSE constructions only focus on single-keyword search or incur heavy computational cost during verification.To address this challenge,we present an efficient VSSE scheme,built on OXT protocol(Cash et al.,CRYPTO 2013),for conjunctive keyword queries with sublinear search overhead.The proposed VSSE scheme is based on a privacy-preserving hash-based accumulator,by leveraging a well-established cryptographic primitive,Symmetric Hidden Vector Encryption(SHVE).Our VSSE scheme enables both correctness and completeness verifiability for the result without pairing operations,thus greatly reducing the computational cost in the verification process.Besides,the proposed VSSE scheme can still provide a proof when the search result is empty.Finally,the security analysis and experimental evaluation are given to demonstrate the security and practicality of the proposed scheme.
基金Supported by the National Natural Science Foundation of China(No.61142007)Natural Science Foundation of Universities of Jiangsu Province(13KJB520005)the Research Fund for the Graduate Innovation Program of Jiangsu Province(CXZZ13_0493)
文摘Since Multivatriate Quadratic(MQ)-based Public Key Cryptosystem(MPKC)has been one of the hot research fields of post-quantum cryptography,it becomes important to analyze the security of new MPKC schemes.Wang et al.proposed a novel multivariate signature scheme with Hash-based Tame Transformation and Minus(HTTM)in 2011.For this extended MQ-based signature,we can transform it into an SFLASH variant by splitting and merging HT transformation,and solve an equivalent private key corresponding to the public key of HTTM.Thus,the adversary can forge legitimate signature for any message by using this equivalent private key.
文摘5G provides a unified authentication architecture and access management for IoT(Internet of Things)devices.But existing authentication services cannot cover massive IoT devices with various computing capabilities.In addition,with the development of quantum computing,authentication schemes based on traditional digital signature technology may not be as secure as we expected.This paper studies the authentication mechanism from the user equipment to the external data network in 5G and proposed an authentication protocol prototype that conforms to the Third Generation Partnership Program(3GPP)standard.This prototype can accommodate various Hash-based signature technologies,applying their advantages in resource consumption to meet the authentication requirements of multiple types of IoT devices.The operation of the proposed authentication scheme is mainly based on the Hash function,which is more efficient than the traditional authentication scheme.It provides flexible and high-quality authentication services for IoT devices cluster in the 5G environment combining the advantages of Hash-based signature technology and 5G architecture.
文摘In distributed systems, it is important to adjust load distribution dynamically based on server performance and load information. Meanwhile, gray release and rapid expansion are the basic requirements to ensure reliability and stability for systems with short version iteration cycles. The traditional Hash algorithm performs poorly in gray release, rapid expansion, and load distribution. To solve these problems, a novel Hash-based dynamic mapping(HDM) load balancing algorithm was proposed. On the one hand, this algorithm can adjust the load distribution dynamically based on server performance and load information. On the other hand, it implements gray release by controlling the ratio of requests assigned to the changed nodes. Additionally, HDM has a higher expansion efficiency. Experiments show that the HDM distributes the load more reasonably, provides a more stable gray release ratio, and has a higher expansion efficiency.
文摘图半监督学习(Graph based semi-supervised learning,GSL)方法需要花费大量时间构造一个近邻图,速度比较慢.本文提出了一种哈希图半监督学习(Hash graph based semi-supervised learning,HGSL)方法,该方法通过局部敏感的哈希函数进行近邻搜索,可以有效降低图半监督学习方法所需的构图时间.图像分割实验表明,该方法一方面可以达到更好的分割效果,使分割准确率提高0.47%左右;另一方面可以大幅度减小分割时间,以一幅大小为300像素×800像素的图像为例,分割时间可减少为图半监督学习所需时间的28.5%左右.
文摘由于量子计算机的飞速发展,现代密码学面临着巨大的挑战。为了实现抗量子计算机攻击的加密,人们提出了许多新的加密方案,并对后量子密码学(Post-Quantum Cryptography,PQC)开展了标准化进程。Leighton-Micali签名(Leighton-Micali sig-nature,LMS)是一种基于哈希的后量子签名方案,其私钥和公钥尺寸都较小,且安全性已被充分研究。LMS被互联网工程小组(Internet Engineering Task Force,IETF)选为PQC签名协议的标准方案,同时被美国国家标准技术局(National Institute of Standards and Technology,NIST)选为一种PQC过渡方案。然而,密钥生成过程中的效率低下,成为了LMS实际应用中的瓶颈。在本文中,我们首次对LMS进行基于FPGA的硬件实现与加速。首先,在不损失安全性的基础上,我们将LMS中的主要哈希函数由SHA2替换为SHA3函数。其次,我们设计了一个软硬件协同系统,将核心的哈希运算用硬件进行实现,该系统在消耗较少资源的前提下,可完成LMS协议的所有过程:密钥生成、签名与验证。该系统为物联网(Internet of things,IoT)场景下资源受限的LMS应用提供了参考。接着,我们提出了一个高速的密钥生成架构来加速LMS。该架构中具有可配置性,支持LMS的所有参数集,内部的哈希模块根据使用场景进行设计与部署,且并行度经过精心设计,以使得架构同时达到低延迟和高硬件利用率。此外,设计中的控制逻辑被设计为在适应不同参数集的情况下保持一定程度的恒定功率,以抵御功率分析攻击。该架构使用Verilog实现,并在Xilinx Zynq UltraScale+MPSoC ZCU104 FPGA平台上实验。实验结果表明,与在Intel(R)Core(TM)i7-6850K 3.60GHz CPU上启用多线程的目前较优软件实现相比,本文中的设计在不同参数配置下可实现55x~2091x的加速;与最新的各平台LMS工作相比,本文中设计可实现超过17x的加速;与相近方案的FPGA工作相比,本文中设计可实现约70x的�
