Secure quantum message transmission can be defined and proven in a finite, composable way, and common game-based definitions are stronger than necessary.
Quantum homomorphic encryption for circuits of low t-gate complexity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Composable and Finite Computational Security of Quantum Message Transmission
Secure quantum message transmission can be defined and proven in a finite, composable way, and common game-based definitions are stronger than necessary.