返回
摘要
En 中文
In modern cryptography, distributing a private and unique index number to each participant is an important cryptographic task, which can be adopted to efficiently solve many complicated secure multiparty computations. In this paper, we define this cryptographic primitive, called Secret Permutating, in which every one of n participants can get a random but unique secret k(i) is an element of {1,2, . . . ,n}. Furthermore, we focus on the unconditional security of Secret Permutating based on laws of quantum mechanics. Accordingly, by local Pauli operators and entanglement swapping of Bell states, we design novel quantum Secret Permutating protocols. What's more, to reduce the communicational complexity, we exploit the uniform, random and independent properties of quantum measurements to evenly divide all participants into many secret groups with the small approximate sizes. Finally, the analysis results and simulated experiments show that the proposed protocols have the unconditional security and the good feasibility.
Keyword:
Entanglement swapping
quantum cryptography
quantum secret permutating
quantum secret sharing
secure multiparty computation
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Useful Equations About Bell States and Their Applications to Quantum Secret Sharing关于Bell态的有用方程及其在量子秘密共享中的应用
Drastic increase of channel capacity in quantum secure direct communication using masking
SCIENCE BULLETIN
IF21.1

