Quantum ANDOS protocol with unconditional security

Authors:
Wei Yang;Liusheng Huang;Mingjun Xiao;Weiwei Jing
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center (Hefei), Hefei, P.R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center (Hefei), Hefei, P.R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center (Hefei), Hefei, P.R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center (Hefei), Hefei, P.R. China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 4
Cited 0

All-or-nothing disclosure of secrets

Proceedings on Advances in cryptology---CRYPTO '86
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Conjugate coding

ACM SIGACT News - A special issue on cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

All-or-Nothing Disclosure of Secrets, or ANDOS for brevity, is an interesting cryptographic task, which involves two parties, say Alice and Bob. Alice has a few secrets, which she regards as equally valuable. She would like to sell any of them to Bob, with the guarantee that no information about the other secrets will be obtained if he pays for only one secret. Moreover, Bob can freely choose his secret and wants to ensure that Alice can obtain no information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security and is able to contain arbitrary number of secrets.