会议专题

Efficient and Secure Quantum All-or-Nothing Disclosure of Secrets Scheme

In an All-or-Nothing Disclosure of Secrets protocol, Alice has n t-bit secrets and is willing to disclose one of them to Bob, with guarantee that no information about the other secrets will be gained. Moreover, Bob can freely choose his secret and has a guarantee that Alice will not be able to find out which secret he picked. We stress that previous constructions for this cryptographic task are not desirable in efficiency and security. In this paper, we present a new Quantum All-or-Nothing Disclosure of Secrets scheme,which is of high efficiency and unconditional security for both participants.

All-or-Nothing Disclosure of Secrets Oblivious Transfer Bit Commitment Privacy Amplification Quantum Information

Qiyan Wang Liusheng Huang Wei Yang Yonglong Luo

Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center Hefei, Hefei, 230027, P.R.China.

国际会议

2006 International Symposium on Distributed Computing and Applications to Business,Engineering and Science(2006年国际电子、工程及科学领域的分布式计算应用学术研讨会)

杭州

英文

1276-1280

2006-10-12(万方平台首次上网日期,不代表论文的发表时间)