A secret image sharing scheme based on piecewise linear chaotic map and Chinese remainder theorem

In this paper, a secret image sharing scheme, by combining arithmetic compression coding and Chinese remainder theorem (CRT) is proposed. It is well known that arithmetic compression coding method for image has a good compressibility, and it can reduce the size of the shadow image, which consists of sharing values. Usually, a smaller shadow image is convenient to store and transmit. The piecewise linear map is applied to design compression coding scheme, which has the same properties as the conventional arithmetic compression coding. The CRT is used to construct the sharing scheme for compression codes. Meanwhile, it also has encryption effects in the process of sharing. Finally, the security and the effectiveness of the secret image sharing scheme are confirmed by some computer simulation results.

     

Selection of unitary operations in quantum secret sharing without entanglement

We propose a substitute-Bell-state attack strategy for quantum secret sharing schemes without entanglement,as well as a definition of the minimum failure probability of such attack strategy.A quantitative analysis of security degrees corresponding to different unitary operations is also provided,when the secret sharing schemes without entanglement are stricken by substitute-Bell-state attack.As a result,the relation between the selection of unitary operations and the effect of substitute-Bell-state attack i...     

A wireless secret key generation method based on Chinese remainder theorem in FDD systems

The wireless physical channel parameters are recently used to provide secret key.However,the key generation usually suffers from the quantization errors due to the noise,which decreases the key agreement ratio (KAR) between authorized users.Most existing approaches achieve high KAR by discarding some channel parameters which may lower the key generation efficiency and therefore lower the encryption strength.In the frequency-division duplex (FDD) systems,the number of reciprocal parameters,such as the multipath angle and delay,is limited.Therefore how to find a quantization method with high KAR and encryption strength is one of the major problems for secret key generation in FDD systems.In this paper,a robust quantization scheme based on grouping and shifting is proposed,in which all the available parameters are used for key generation.In addition,a key mapping method with error correction based on Chinese remainder theorem (CRT) is proposed to further improve the KAR performance.Simulations demonstrate the effectiveness of the proposed method.     

无纠缠量子秘密共享中酉操作的选择

文中针对不使用纠缠态的量子秘密共享方案,提出了一种Bell态替换攻击策略,并定量分析了当量子秘密共享方案采用常见的几种酉操作组合时,这种攻击的最小失败概率,从而得到酉操作的选择和Bell态替换攻击效果之间的若干关系.对于量子秘密共享方案的设计和实施中,如何选择酉操作以保证通信安全的问题,文中的工作具有重要的指导作用.     

A homomorphic computational model for Chinese remainder theorem-based secret sharing

Innovations in Systems and Software Engineering - This paper proposes a fully homomorphic computational model for secret sharing. The backbone of the proposed model is Chinese remainder theorem....     

Threshold quantum secret sharing based on single qubit

Based on unitary phase shift operation on single qubit in association with Shamir’s (t, n) secret sharing, a (t, n) threshold quantum secret sharing scheme (or (t, n)-QSS) is proposed to share both classical information and quantum states. The scheme uses decoy photons to prevent eavesdropping and employs the secret in Shamir’s scheme as the private value to guarantee the correctness of secret reconstruction. Analyses show it is resistant to typical intercept-and-resend attack, entangle-and-measure attack and participant attacks such as entanglement swapping attack. Moreover, it is easier to realize in physic and more practical in applications when compared with related ones. By the method in our scheme, new (t, n)-QSS schemes can be easily constructed using other classical (t, n) secret sharing.     

Threshold quantum state sharing based on entanglement swapping

A threshold quantum state sharing scheme is proposed. The dealer uses the quantum-controlled-not operations to expand the d-dimensional quantum state and then uses the entanglement swapping to distribute the state to a random subset of participants. The participants use the single-particle measurements and unitary operations to recover the initial quantum state. In our scheme, the dealer can share different quantum states among different subsets of participants simultaneously. So the scheme will be very flexible in practice.     

基于轨道角动量的双频阵列天线的设计与分析

随着通信技术的蓬勃发展,通信频带变得越来越拥挤。为了提升频谱效率和信道容量,基于轨道角动量的思想,以同轴馈电的贴片微带天线为阵元,设计了一种可以携带轨道角动量涡旋电磁波的双频微带阵列天线。HFSS的仿真结果表明,该天线的-10 dB带宽为11.37～22.77 GHz和25.06～31.71 GHz,可以产生多种模态值的OAM波束,而且各个模态的OAM波束具有良好的对称性和旋转性,并且在中心频率21 GHz和27 GHz能同时产生OAM涡旋电磁波。该系统在未来的移动通信(6G)具有广阔的应用前景。     

Dynamic quantum secret sharing protocol based on GHZ state

This work proposes a new dynamic quantum secret sharing (DQSS) protocol using the measurement property of Greenberger–Horne–Zeilinger state and the controlled-NOT gate. In the proposed DQSS protocol, an agent can obtain a shadow of the secret key by simply performing a measurement on single photons. In comparison with the existing DQSS protocols, it provides better qubit efficiency and has an easy way to add a new agent. The proposed protocol is also free from the eavesdropping attack, the collusion attack, and can have an honesty check on a revoked agent.     

一种基于中国剩余定理的数字指纹体制

数字指纹技术可以追踪盗版拷贝的来源,在版权保护方面具有很重要的作用,受到越来越广泛的关注.本文提出了一种基于中国剩余定理的数字指纹体制,避免使用一般的安全多方计算协议,该方案不仅具有较好的实现效率,而且还能确定性地跟踪叛逆者.     

基于同余方程和中国剩余定理的混淆算法

在介绍了代码混淆技术和中国剩余定理的基础上,利用密钥和一组同余方程解的状态构造了一种参数化的不透明谓词,并采用一元多项式环上的中国剩余定理判断不透明谓词的输出。理论分析表明构造的不透明谓词由若干多项式组成,对密钥敏感,具有单向性、随机性和较高的隐蔽性,密码安全性高,能抵抗静态和动态攻击。测试实验表明,混淆程序增加了混淆后程序的复杂度,保证了混淆后程序的正确性,且混淆变换不会给程序带来太大的空间和时间开销。     

基于中国剩余定理的前向安全群签名

基于中国剩余定理提出了一个前向安全群签名方案,同时解决了成员撤销和密钥泄露问题。该方案在不改变其他有效成员的私钥和群公钥的长度的情况下,可以安全地增加或删除群成员,且每次增加和删除群成员只需简单的指数运算。同时对该方案进行了安全性分析,结果表明该方案具有前向安全性、可撤销性、不可伪造性、防陷害性、抗联合攻击等群签名方案所具有的安全性。     

A dynamic multiparty quantum direct secret sharing based on generalized GHZ states

This paper proposes a new dynamic multiparty quantum direct secret sharing (DQDSS) using mutually unbiased measurements based on generalized GHZ states. Without any unitary operations, an agent can obtain a shadow of the secret by simply performing a measurement on single photons. In the proposed scheme, multiple agents can be added or deleted and the shared secret need not be changed. Our DQDSS scheme has several advantages. The dealer is not required to retain any photons and can further share a predetermined key instead of a random key to the agents. Agents can update their shadows periodically, and the dealer does not need to be online. Furthermore, the proposed scheme can resist not only the existing attacks, but also cheating attacks from dishonest agents. Hence, compared to some famous DQSS schemes, the proposed scheme is more efficient and more practical. Finally, we establish a mathematical model about the efficiency and security of the scheme and perform simulation analyses with different parameters using MATLAB.     

基于极化单光子的高效安全量子秘密共享方案

为进一步提高量子秘密共享协议的效率和安全性,结合量子Grove搜索算法提出一种基于极化单光子的量子秘密共享协议.效率分析结果表明,该方案可以将全部量子态用于密钥共享,理论效率为100%.在方案的安全性证明中,借助量子Grove算子和量子纠缠特性得出方案能够有效抵抗中间人攻击,同时该方案利用辅助量子态进行监视,能够以高概率检测特洛伊木马攻击.通过对Grove算子进行高维推广,证明了方案推广到(n,n)的可行性和实用性.     

基于中国剩余定理的前向安全群盲签名方案

群盲签名是群签名和盲签名的结合体,它兼具群签名和盲签名的各种优越特性.在李新社等采用中国剩余定理的群签名方案的基础上,引入前向安全概念和盲签名思想,提出了一个前向安全群盲签名方案.安全性分析表明,该方案具有前向安全性、防陷害性、不可伪造性等群签名方案所具有的安全性,同时,群成员不知道所签消息的具体内容.     

基于中国剩余定理的快速公钥算法同态特性研究

云计算中现有同态公钥算法计算复杂度大,不能很好满足云计算高效快速的要求.针对具有很高计算效率的基于中国剩余定理的快速公钥算法进行同态特性研究,研究结果表明算法仅支持一次乘法同态操作;提出将现有算法降维改进,使改进后的算法具有加法、标量乘法和多次乘法的同态特性;分析了改进后算法的安全理论基础和语义安全特性,并基于改进后的算法设计了序列安全比较协议,通过与现有两种公钥算法进行对比,表明了改进后的算法具有安全高效的特性.     

Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem

The residue number system (RNS) is an unconventional number system which can lead to parallel and fault-tolerant arithmetic operations. However, the complexity of residue-to-binary conversion for large number of moduli reduces the overall RNS performance, and makes it inefficient for nowadays high-performance computation systems. In this paper, we present an improved approximate Chinese remainder theorem (CRT) with the aim of performing efficient residue-to-binary conversion for general RNS moduli sets. To achieve this aim, the required number of fraction bits for accurate residue-to-binary conversion is derived. Besides, a method is proposed to substitute fractional calculations by similar computations based on integer numbers to have a hardware amenable algorithm. The proposed approach results in high-speed and low-area residue-to-binary converters for general RNS moduli sets. Therefore, with this conversion method, high dynamic range residue number systems suitable for cryptography and digital signal processing can be designed.