Unconditionally secure all-or-nothing disclosure of secrets based on POVM measurements

Authors:
Yang Wei;Liusheng Huang
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center, Hefei, P. R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center, Hefei, P. R. China
Venue:
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
Year:
2006

Citing 5
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
Quantum computation and quantum information

Quantum computation and quantum information
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

Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtained. Furthermore, Bob can freely choose his secret and wants to ensure that Alice can obtain on 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.