A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
A proof of the security of quantum key distribution (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography
Journal of the ACM (JACM)
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Entanglement and Communication Complexity
SIAM Journal on Computing
Quantum Cryptography with Imperfect Apparatus
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum protocols for untrusted computations
Journal of Discrete Algorithms
Information sharing using entangled states and its applications to quantum card tricks
Decision Support Systems
| Hi-index | 0.00 |
Although many quantum security tools have been proposed, many of them are quantum secret key distribution protocols. However, we naturally wish to construct quantum cryptosystems different from the conventional cryptosystems. In this paper, first, we show simple methods with prior entanglement in order to split a party's message among some parties securely. Moreover, as an application, we also show that by using our splitting methods, we can construct not only quantum secret key distribution protocols but also quantum cryptosystems. Some of our quantum cryptosystems are different from the conventional cryptosystems because they are executed interactively.