Linkable ring signatures are a type of ring signature scheme that can protect the anonymity of signers while allowing the public to verify whether the same signer has signed the same message multiple times. This functionality makes linkable ring signatures suitable for applications such as cryptocurrencies and anonymous voting systems, achieving the dual goals of identity privacy protection and misuse prevention. However, existing post-quantum linkable ring signature schemes often suffer from issues such as excessive linear data growth the adoption of post-quantum signature algorithms, and high circuit complexity resulting from the use of post-quantum zero-knowledge proof protocols. To address these issues, a logarithmic-size post-quantum linkable ring signature scheme based on aggregation operations is proposed. The scheme constructs a Merkle tree from ring members’ public keys via a hash algorithm to achieve logarithmic-scale signing and verification operations. Moreover, it introduces, for the first time, a post-quantum aggregate signature scheme to replace post-quantum zero-knowledge proof protocols, thereby effectively avoiding the construction of complex circuits. Scheme analysis confirms that the proposed scheme meets the correctness requirements of linkable ring signatures. In terms of security, the scheme satisfies the anonymity, unforgeability, and linkability requirements of linkable ring signatures. Moreover, the aggregation process does not leak information about the signing members, ensuring strong privacy protection. Experimental results demonstrate that, when the ring size scales to 1024 members, our scheme outperforms the existing Dilithium-based logarithmic post-quantum ring signature scheme, with nearly 98.25% lower signing time, 98.90% lower verification time, and 99.81% smaller signature size.

With the advancement in quantum computing technology, the number theory-based hard problems underlying traditional searchable encryption algorithms are now vulnerable to efficient quantum attacks. To address this challenge, this paper proposes Dilithium-PAEKS (Dilithium-Public Authenticated Encryption with Keyword Search), a searchable encryption scheme based on the post-quantum cryptographic algorithm CRYSTALS-Dilithium. By transforming the verification relationship of digital signatures into a matching relationship between trapdoors and ciphertexts, the scheme not only meets the functional requirements of searchable encryption but also demonstrates quantum resistance. The implementation enhances algorithm efficiency through keyword-based signatures and dynamic matching testing mechanisms. The security of the scheme is defined by the MLWE and MSIS hard problems, with proofs of keyword ciphertext indistinguishability and trapdoor indistinguishability under the random oracle model. Additionally, the scheme provides strong resistance against both outside and insider keyword guessing attacks through sender–receiver binding mechanisms and trapdoor indistinguishability properties. Experimental results show that, compared to the post-quantum schemes CP-Absel and LB-FSSE, the proposed scheme demonstrates superior overall computational efficiency while maintaining stronger quantum resistance than the traditional scheme SM9-PAEKS.

SM4 cryptographic algorithm is a block cipher algorithm issued by China’s state cryptographic administration and has become an international standard. We implement the quantum circuits of SM4 block cipher by optimizing the number of qubits and the value of depth-times-width. The quantum circuits of the S-box are first studied. According to the algebraic structure of the S-box, four kinds of improved quantum circuits of S-box are presented for different phases in SM4 based on composite field arithmetic. In order to optimize the number of qubits, we implement the quantum circuit of SM4 by connecting the quantum subcircuits in series. The implemented quantum circuit of SM4 only uses 260 qubits, which is the least number of qubits used not only in implementing the SM4 quantum circuit, but also in implementing the block cipher algorithms with 8-bit S-box, 128-bit plaintext and 128-bit secret key. When optimizing the value of depth-times-width, we achieve it through parallel implementation. The trade-off quantum circuit uses a total of 288 quantum bits, and the Toffoli depth is 1716. The depth-times-width is 49,4208, which is less than the existing best value 82,5792.

目前,密码分析者已经可以在较短的时间内有效找到MD5、SHA1等国际密码杂凑算法的碰撞,通过熵增来增强杂凑值的随机性是提高密码杂凑算法抗碰撞性的有效途径,因此提出一种将纠错码和SM3算法迭代结构融合的改进方案.首先,基于纠错码的线性性质和最小汉明距离最大化原则,选择拟阵理论所构建的二进制线性分组码,计算出其系统形式的生成矩阵,并通过循环移位来消除比特之间的规律,计算最终产生的有效码字;其次,在线性分组码中遵循周期性原则选取最优码字来构建初始常量值,并将其赋值于初始寄存器中,同时在迭代结构中引入初始寄存器构成算法的压缩函数,完成杂凑算法迭代结构的二次构建;最后,考虑杂凑值信息熵对算法混乱度的评估能力,将提出的方案与现有公开的国际密码杂凑算法进行对比实验,同时进行雪崩效应、算法效率、内存损耗测试,并进行综合评价.实验结果表明,本文方案在不改变运算效率的前提下具有稳定的雪崩效应,运行过程中的内存损耗比SM3算法降低0.01～0.07 MB,同时杂凑值的信息熵值高于其他对比算法.提出的基于纠错码的改进方案能够通过熵增证明杂凑值比特之间的随机性更高,更好实现隐藏明文和杂凑值之间统计信息的目的,提高了密码杂凑算法的安全性.

Cryptanalysts now can effectively find the collisions of MD5, SHA1 and other international hash algorithms in a short time. Increasing entropy to enhance the randomness of hash value is an effective way to improve the anti-collision performance of hash algorithm. Therefore, an improved scheme combining the iterative structure of error-correcting code and SM3 algorithm was proposed. Firstly, based on the linear properties of error-correcting codes and the maximization principle of minimum Hamming distance, the binary linear block codes constructed by matroid theory were selected to calculate their systematic form of generation matrix, the rules between bits were eliminated by cyclic shift, and the effective code words were calculated. Secondly, in the linear block code, an optimal code word was selected to construct the initial constant value according to the periodicity principle, and its value was assigned to the initial register. At the same time, a compression function of the initial register formation algorithm was introduced into the iterative structure to complete the second construction of the iterative structure of the hash algorithm. Finally, considering the evaluation ability of hash value information entropy on chaos degree of the algorithm, the proposed scheme was compared with existing international hash algorithms, and avalanche effect, the algorithm efficiency and memory loss were tested and comprehensively evaluated. Experimental results showed that the proposed scheme has stable avalanche effects without changing the computational efficiency, the memory loss during operation is 0.01~0.07 MB lower than that of SM3 algorithm, and the information entropy of the hash value is higher than that of other comparison algorithms. The improved scheme based on error correction code can prove that the randomness between hash bits is higher through entropy increase, which can better achieve the purpose of hiding statistical information between plaintext and hash, value, and improve the security of hash algorithm.

Abstract SM4 cryptographic algorithm is a block cipher algorithm issued by China's state cryptographic administration and has become an international standard. we implement the quantum circuits of SM4 Block cipher by optimizing the number of qubits and the value of depth-times-width. When the S-box is implemented, four kind of improved quantum circuits of S-box are presented for different phases in SM4 based on composite field arithmetic. When optimizing the number of qubits, we implement the quantum circuit of SM4 by connecting the quantum subcircuits in series. The implemented quantum circuit of SM4 only uses 260 qubits, which is the least number of qubits used not only in implementing the SM4 quantum circuit, but also in implementing the block cipher algorithms with 8-bit S-box, 128-bit plaintext and 128-bit secret key. When optimizing the value of depth-times-width, we achieve it through parallel implementation. The trade-off quantum circuit uses a total of 288 quantum bits and the Toffoli depth is 1716. The depth-times-width is 494208, which is less than the existing best value 825792.

Under the premise of ensuring the security and integrity of the blockchain, the editable blockchain realizes the correction operation of the data on the chain, but the number of edits is not limited, so that malicious users can modify the data on the chain infinitely in the case of obtaining a trapdoor. Based on this, a function construction scheme that combines the Elliptic Curve Discrete Logarithm Problem difficulty assumption with a cryptographic primitive called one-time chameleon hash function is proposed.A controllable variable is introduced for the hash generation part of the chameleon hash function, so that the same hash value can find two preimages without revealing trapdoor information, However, when searching for the third pre-image, the secondary use of the set controllable variable results in "access failure", i.e., satisfying the secondary collision resistance, The security of the scheme under the assumption of Elliptic Curve Discrete Logarithm Problem is proved in the random oracle model, and a chameleon hash algorithm that is also resistant to secondary editing is selected for experimental comparative analysis. The results show that the scheme in this paper reduces the number of modal operations, which makes the algorithm complexity reduced. It is able to improve the computing efficiency of hash generation algorithm and hash collision algorithm significantly with the same security strength. The combination of the amendment privilege restriction of the chameleon hash function and the efficiency of its algorithm is realized, which provides a technical reference for the amendment privilege management of editable blockchain.

共识算法对保证区块链的安全性和效率起着至关重要的作用,Raft算法作为一种强一致性、去中心化、高可用的分布式共识算法,被广泛应用在联盟链及私有链中.针对Raft算法在Leader节点选举过程中存在虚假投票及缺少拜占庭容错的问题,利用可验证秘密共享提出了一种基于可验证秘密共享的Raft共识算法,该算法通过可验证秘密共享的子秘密分发与承诺值验证的过程取代Raft共识算法中的投票和计票过程,并在秘密生成及验证过程中利用蒙哥马利幂剩余算法减少运算的复杂度.仿真结果表明:相比Raft算法,提出的算法在具有拜占庭容错能力且可以抵御伪造选票攻击的同时保持Leader节点切换低延迟,在提高安全性的同时也保证了其可扩展性.

随着恶意网页数量的逐年递增,传统恶意网页检测技术表现出了较大的局限性.因而基于机器学习的检测技术被引入,该技术的关键是有效网页特征的选取.在分析提取传统网页特征URL、HTML和JavaScript代码特征的基础上,融合网页文本内容特征(Text特征),基于机器学习提出一种多特征融合的恶意网页检测方法.通过互信息法、F-检验法、递归特征消除法3种特征选择算法验证得到所提Text特征更具强相关性.其中,RF算法在URL、HT-ML、JavaScript与Text特征的混合特征集上对恶意网页检测的效果最好,该方法与前人工作相比具有更高的准确性与可靠性.

针对云环境中密文在数据库检索的效率问题,提出了一种基于Paillier公钥算法的低频分词索引方案.首先利用Paillier分词选取出每段权重最低的低频分词并进行Paillier处理,将Paillier处理后的结果作为密文检索的索引,然后利用Paillier配对算法对整段明文进行加密,最后部署在数据库中进行效率测试.测试结果表明该方案能有效地提高密文在数据库中的检索效率.

车联网是一个拓扑结构快速变化的分布式自组织网络,因此提供迅速及时的车辆接入服务尤为重要.针对该问题,采用基于双离散对数的知识签名技术设计了一种在车联网中进行车辆身份的快速认证协议.车载单元在进入车联网时向路旁辅助单元请求入网,并通过基于知识签名的协议算法证明其知道系统密钥,从而实现车辆与路旁单元的快速接入认证服务,所提的方案具有认证快速、通过迅速、能快速适应高速实时通信的创新特点.仿真实验结果表明,同多个基于群签名技术的身份认证方案比较,在认证时间消耗上,本协议比ZHAO等人的方案节约了18.92％,尤其是在当车辆规模在200个以下时,所提方案在通行认证效率、通行效率等性能上优于ZHAO、YOON、WU等人的方案.

针对云环境下非诚实服务提供商可能伪造服务器地理位置的问题,提出一种云服务器位置定位及安全性验证方案.首先给出了整个方案的系统模型,分析了可能存在的安全威胁,然后在多点定位算法的基础之上,考虑时延波动对结果造成的影响,并赋予相应的权值,提出一种基于加权质心估计的欧几里得度量算法,对云服务器的位置进行有效定位,同时利用基于位置的安全定位协议,在误差允许的范围内验证定位结果的真实性,最后,通过对部署在阿里云上的服务器进行定位测试,证明方案可以满足区域级别精度的定位需求.

在k-匿名隐私保护策略的发展中,数据表的数据质量与安全性是相互制约的关系,在多样化敏感值数据表的隐私保护研究中,如何平衡数据质量与安全性之间的矛盾,也是备受关注的重点.但是,对相同敏感属性值的数据表进行泛化保护时,此方面的评价理论不适用于度量该类数据的可用性与安全性,文章针对这一不足,提出了一个基于熵理论的相同敏感值数据表泛化算法的评价方案.该方案引入了加权属性熵和链接匹配熵的概念,加权属性熵根据不同属性的重要程度计算数据损失量,链接匹配熵将链接攻击数据表消耗的正确匹配元组的信息量作为安全性度量.最后,利用提出的评价方案对两种泛化算法处理后的数据表进行评价,丰富了在相同敏感值条件下泛化算法的评价体系.

Byzantine agreement has always been an important research topic of distributed computing and has been widely applied to blockchain technology in recent years. We propose a quantum protocol for solving multi-valued detectable Byzantine agreement problem in this paper. Each general is firstly distributed a list that no one else knows based on d-dimensional entangled states. Then the n generals can reach an agreement in which t (where t < n/3) of them are disloyal by using these lists. Finally, it is proved that the list distribution process is secure, and the proposed protocol satisfies the definition of the multi-valued detectable Byzantine agreement.

In order to solve the problem of illegal member’s tracking attack, which caused by the vehicle units’ privacy disclosure in vehicular ad hoc networks (VANETs), a vehicle identity authentication protocol based on lightweight group signature was proposed by analysis of topology and communication characteristics of VANETs in this paper, which can authenticate the vehicles anonymously in a fast and efficient way. The protocol has five stages. In the initialization phase, the public/private key pairs and system parameters of the group were generated by the VANETs system, then the group public key and system parameters were distributed to the on-board units by the roadside auxiliary facilities. The group private key was kept by the group manager. When a vehicle unit entered VANETs, the unit’s own identity was submitted to the group manager by the blind signature. A group certificate would be distributed to the vehicle unit by the group manager when authentication passed. In the cooperative communication stage, the vehicle member who owned the group certificates signed the state information with the valid certificate and group public key, then sent it to the nearby vehicle units by the car sensors, and achieved cooperative driving with surrounding vehicles. In the message verification stage, only can the legal vehicle members open the received status information by using group public key, but couldn’t know the true identity of the message sender. In this way, the anonymous communication among vehicles was realized. In the stage of signature verification, when a vehicle unit broadcasted a false message for the purpose of exclusively using road resource and caused traffic accident, the group manager can open the signature of the message by using the group private key, and traversed the corresponding vehicle members to carry on the accountability. The innovation of the paper was the usage of improved lightweight group signature technology, which could ensure that the length of group public key and group signature didn’t depend on the number of group members. Zero knowledge proof was also used as a means of membership authentication which improved the speed of authentication among the members. The security of the protocol was analyzed and proved mathematically in this paper, and a LAN simulation platform composed of 100 PC machines was built to simulate the cooperative communication among vehicle units in VANETs. The experimental results showed that authentication time of the protocol was about 7 ms among 100 vehicle users. The performance of the proposed protocol is superior to the contrasted schemes. It greatly reduced the storage and calculation burden of the vehicle units during the process of identity authentication.

Aimed at the data set with the same sensitive attribute values,the specific privacy disclosure was defined and its characteristics under homogeneity attack was studied.The concept and computing method of full instance disclosure risk were proposed,and the accurate measure of privacy disclosure with the same sensitive attribute values was achieved.The two generalization operation algorithms for data set with the same sensitive attribute values were designed,and the results of the same-disease data set were analyzed.The algorithm with an optimal result was chosen as the privacy protection method for the data set with the same sensitive attribute values.

In this paper, we propose a 3D model reconstruction for different types of cultural heritage based on cloud point and HD video. The three-dimensional reconstruction technology with multi-resolution on the basis of three-dimensional point cloud and high definition image data is described firstly. Then, we describe the method of cultural relics model fusion and display based on location. In this paper, the proposed method is employed to display of Tangya Tusi castle ruins which is the world' s cultural heritage. Shiren, shima, arches and other relic' s model were rebuilt according to the fine cultural relics virtual reconstruction method. Through model fusion the multi-resolution digital presentation for Tangya Tusi castle ruins was completed.

Since traditional access control mechanisms provide static authorization for users, but with little supervision over their behaviors, it is difficult for enterprises to locate threats of data security posed by malicious insiders or compromised user accounts with high privilege. This article defines and formalizes user behaviors under Private Cloud, Through user behavior data acquisition, storage, feature selection and preprocessing, A Neural Network model for User Behavior Analysis is proposed with its training and optimization procedure. Thus a User Behavior Analysis model based on TensorFlow Machine Learning platform over Hadoop framework is given, which can analysis user behaviors automatically,and can help enterprises to locate and respond to threats of data security efficiently in private cloud.

Innovation and entrepreneurship education is of great significance in the college application transfor-mation. How to optimize the application oriented talent training mode and improve the overall quality of students has become the key problem to be resolved for innovation and entrepreneurship in colleges and universities. In this pa-per, the reform experience of School of Information Engineering of Hubei University for Nationalities is introduced. Through three aspects involving the reform of teaching management mode, the practice of education, collegeenterprise joint training talents, the university effectively solve the problems that the idea of training applied talents is not clear, the practice education has weak foundation, personnel training does not meet the market the needs of cultivat-ing applied talents in the transformation of local university application, providing ideas and valuable experience for the application of transformation of the western minority areas.

The new development of embedded systems has the potential to revolutionize our lives and will have a significant impact on future Internet of Thing (IoT) systems if required services can be automatically discovered and accessed at runtime in Machine-to-Machine (M2M) communication networks. It is a crucial task for devices to perform timely service discovery in a dynamic environment of IoTs. In this article, we propose a Socioecological Service Discovery (SESD) model for advanced service discovery in M2M communication networks. In the SESD network, each device can perform advanced service search to dynamically resolve complex enquires and autonomously support and co-operate with each other to quickly discover and self-configure any services available in M2M communication networks to deliver a real-time capability. The proposed model has been systematically evaluated and simulated in a dynamic M2M environment. The experiment results show that SESD can self-adapt and self-organize themselves in real time to generate higher flexibility and adaptability and achieve a better performance than the existing methods in terms of the number of discovered service and a better efficiency in terms of the number of discovered services per message.