Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Algorithmica - Special Issue: Quantum Computation; Guest Editors: Frédéric Magniez and Ashwin Nayak
Proceedings of the forty-third annual ACM symposium on Theory of computing
Remote preparation of quantum states
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We introduce a new type of cryptographic primitive that we call a hiding fingerprinting scheme. A (quantum) fingerprinting scheme maps a binary string of length n to d (qu)bits, typically d ≪ n, such that given any string y and a fingerprint of x, one can decide with high accuracy whether x = y. It can be seen that a classical fingerprint of x that guarantees error ≤ ε necessarily reveals Ω(min {n, log(1/ε)}) bits of information about x. We call a scheme hiding if it reveals o(min {n, log(1/ε)}) bits; accordingly, no classical scheme is hiding. We construct quantum hiding fingerprinting schemes. Our schemes are computationally efficient and their hiding properties are shown to be optimal.