具有双向认证功能的量子秘密共享方案

利用两粒子纠缠态作为经典信息的载体,结合Hash函数和量子本地操作提出了一种可以实现双向认证功能的量子秘密共享方案,并且分析了它的安全性. 这种方案的安全性基于秘密共享双方的认证密钥和传输过程中粒子排列次序的保密. 若不考虑认证和窃听检测所消耗的粒子,平均1个Bell态共享2 bit经典信息. 关键词： 量子秘密共享 认证密钥 量子双向认证 两粒子量子纠缠     

Multiparty simultaneous quantum identity authentication with secret sharing

Two multiparty simultaneous quantum identity authentication (MSQIA) protocols based on secret sharing are presented. All the users can be authenticated by a trusted third party (TTP) simultaneously. In the first protocol, the TTP shares a random key K with all the users using quantum secret sharing. The ith share acts as the authentication key of the ith user. When it is necessary to perform MSQIA, the TTP generates a random number R secretly and sends a sequence of single photons encoded with K and R to all the users. According to his share, each user performs the corresponding unitary operations on the single photon sequence sequentially. At last, the TTP can judge whether the impersonator exists. The second protocol is a modified version with a circular structure. The two protocols can be efficiently used for MSQIA in a network. They are feasible with current technology. Supported by the National Basic Research Program of China (973 Program) (Grant No. 2007CB311100), the National High Technology Research and Development Program of China (Grant Nos. 2006AA01Z419 and 20060101Z4015), the Major Research Plan of the National Natural Science Foundation of China (Grant No. 90604023), the Scientific Research Common Program of Beijing Municipal Commission of Education (Grant No. KM200810005004), the Scientific Research Foundation for the Youth of Beijing University of Technology (Grant No. 97007016200701), the National Research Foundation for the Doctoral Program of Higher Education of China (Grant No. 20040013007), the National Laboratory for Modern Communications Science Foundation of China (Grant No. 9140C1101010601), and the Doctor Scientific Research Activation Foundation of Beijing University of Technology (Grant No. 52007016200702)     

A gauge model without parity violation in heavy atoms

We address the question: “are weak right-handed non-singlet representations of quarks and leptons necessary?” An extension of the Weinberg-Salam model to SU(2) ? U(1) ? U(1) is found to adequately describe all existing weak interaction data including the lack of parity violation in atomic physics experiments. These data tightly constrain the additional parameters introduced by adding the second weak hypercharge. Although such a model may seem regressive when considered from the standpoint of “simple” unification schemes, we feel that it is aesthetics rather than experiment which leads to non-trivial right-handed multiplet structure. In contrast to most other models, ours predicts a substantial parity-violation effect in atomic experiments on hydrogen. We note that the second weak boson in our model is not constrained to be heavy by existing data and thus might already by accessable in pp → μ⁺μ^?X or possibly in the next generation of colliding beam facilities through e⁺e^? → μ⁺μ^?.     

Quantum secret sharing without entanglement

After analysing the main quantum secret sharing protocol based on the entanglement states, we propose an idea to directly encode the qubit of quantum key distributions, and then present a quantum secret sharing scheme where only product states are employed. As entanglement, especially the inaccessible multi-entangled state, is not necessary in the present quantum secret sharing protocol, it may be more applicable when the number of the parties of secret sharing is large. Its theoretic efficiency is also doubled to approach 100%.     

Application of homomorphism to secure image sharing

In this paper, we present a new approach for sharing images between l players by exploiting the additive and multiplicative homomorphic properties of two well-known public key cryptosystems, i.e. RSA and Paillier. Contrary to the traditional schemes, the proposed approach employs secret sharing in a way that limits the influence of the dealer over the protocol and allows each player to participate with the help of his key-image. With the proposed approach, during the encryption step, each player encrypts his own key-image using the dealer's public key. The dealer encrypts the secret-to-be-shared image with the same public key and then, the l encrypted key-images plus the encrypted to-be shared image are multiplied homomorphically to get another encrypted image. After this step, the dealer can safely get a scrambled image which corresponds to the addition or multiplication of the l + 1 original images (l key-images plus the secret image) because of the additive homomorphic property of the Paillier algorithm or multiplicative homomorphic property of the RSA algorithm. When the l players want to extract the secret image, they do not need to use keys and the dealer has no role. Indeed, with our approach, to extract the secret image, the l players need only to subtract their own key-image with no specific order from the scrambled image. Thus, the proposed approach provides an opportunity to use operators like multiplication on encrypted images for the development of a secure privacy preserving protocol in the image domain. We show that it is still possible to extract a visible version of the secret image with only l-1 key-images (when one key-image is missing) or when the l key-images used for the extraction are different from the l original key-images due to a lossy compression for example. Experimental results and security analysis verify and prove that the proposed approach is secure from cryptographic viewpoint.     

一种基于抖动和混沌技术的数字图像篡改检测及修复算法

本文提出了一种基于抖动和混沌技术的数字图像篡改检测及修复算法.该算法使用小波变换后的低频子图和抖动技术生成图像的认证及修复信息,在有效减少水印数据量的同时,将水印嵌入小波变换后的高频子图,从而达到水印的不可见性.运用混沌技术完成水印的嵌入和加密,并结合中国余数定理,进一步减少水印嵌入对图像质量的影响.实验证明,该算法兼顾了水印的不可见性和鲁棒性,并且能够一定程度修复篡改图像,在图像认证和修复方面具有较高的实用意义.     

Three-dimensional image authentication using binarized images in double random phase integral imaging

We proposed a three-dimensional(3D) image authentication method using binarized phase images in double random phase integral imaging(InI). Two-dimensional(2D) element images obtained from InI are encoded using a double random phase encryption(DRPE) algorithm. Only part of the phase information is used in the proposed method rather than using all of the amplitude and phase information, which can make the final data sparse and beneficial to data compression, storage, and transmission. Experimental results verified the method and successfully proved the developed 3D authentication process using a nonlinear cross correlation method.     

一种基于混沌和汉明码的数字图像篡改检测及修复算法

提出了一种基于混沌映射和汉明码的数字图像篡改检测及修复算法.该算法采用了目前在信道编码中广泛使用的编组码汉明码,将差错控制应用于图像认证和修复,并使用混沌映射保证算法的有效性和安全性.分析及实验表明:该算法在保证良好的视觉效果,嵌入较少认证信息的前提下,可以有效地进行数字图像篡改检测,并能够完成一定程度的图像修复.     

Quantum correlations and secret bits

It is shown that (i) all entangled states can be mapped by single-copy measurements into probability distributions containing secret correlations, and (ii) if a probability distribution obtained from a quantum state contains secret correlations, then this state has to be entangled. These results prove the existence of a two-way connection between secret and quantum correlations in the process of preparation. They also imply that either it is possible to map any bound entangled state into a distillable probability distribution or bipartite bound information exists.     

Preserving coherence in Rydberg quantum bits

The effectiveness of decoherence suppression schemes is explored using quantum bits (qubits) stored in Li np Rydberg states. Following laser excitation, pulsed electric fields coherently control the electronic spin-orbit coupling, facilitating qubit creation, manipulation, and measurement. Spin-orbit coupling creates an approximate decoherence-free subspace for extending qubit storage times. However, sequences of fast NOT operations are found to be substantially more effective for preserving coherence.     

Hiding bits in bell states.

We present a scheme for hiding bits in Bell states that is secure even when the sharers, Alice and Bob, are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain about a hidden bit is exponentially small in n, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits. We indicate an alternative efficient low-entanglement method for preparing the shared quantum states. We discuss how our scheme can be implemented using present-day quantum optics.     

基于支撑先验与深度图像先验的无预训练磁共振图像重建方法

基于深度学习的磁共振成像(magnetic resonance imaging, MRI)方法需要大规模、高质量的病患数据样本集进行预训练.然而,由于病患隐私及设备等因素限制,获取大规模、高质量的磁共振数据集在实际临床应用中面临挑战.本文提出一种新的基于深度学习的欠采样磁共振图像重建方法,该方法无需预训练、不依赖训练数据集,而是充分利用待重建的目标MR图像的结构先验和支撑先验,并将其引入深度图像先验(deep image prior, DIP)框架,从而削减对训练数据集的依赖,提升学习效率.基于参考图像与目标图像的相似性,采用高分辨率参考图像作为深度网络输入,将结构先验信息引入网络;将参考图像在小波域中幅值大的系数索引集作为目标图像的已知支撑集,构造正则化约束项,将网络训练转化为网络参数的最优化求解过程.实验结果表明,本文方法可由欠采样k空间数据重建得到更精确的磁共振图像,且在保留组织特征、细节纹理方面具有明显优势.     

A secret image sharing based on neighborhood configurations of 2-D cellular automata

The main goal of this work is to research how neighborhood configurations of two-dimensional cellular automata (2-D CA) can be used to design secret sharing schemes, and then a novel (n, n)-threshold secret image sharing scheme based on 2-D CA is proposed. The basic idea of the scheme is that the original content of a 2-D CA can be reconstructed following a predetermined number of repeated applications of Boolean XOR operation to its neighborhood. The main characteristics of this new scheme are: each shared image has the same size as the original one; the recovered image is exactly the same as the secret image, i.e., there is no loss of resolution or contrast; and the computational complexity is linear. Simulation results and formal analysis demonstrate the correctness and effectiveness of the proposed sharing scheme.     

Positive parity states in Er

The positive parity states in ¹⁶⁷Er are described in terms of the rotational model, where the particle-rotation coupling is taken into account. The moment of inertia, the Fermi energy and the coupling strength are determined by fitting the energies. The wave functions thus obtained are used to calculate the (d, p) stripping and (d, t) pick-up cross sections and branching ratios. The results obtained are in agreement with experimental data.