REVIEW 1 cited by
Quantum no-key protocol for secure communication of classical message
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are designed to resist middleman attack for two parties preshared authentication key, and achieve perfect mutual data origin authentication which ensures the permanent reusing of authentication key. Finally, we simplify the protocol to a 4-round one, and show that any protocol with 3 or less rounds cannot achieve perfect security without consuming preshared key.
Forward citations
Cited by 1 Pith paper
-
Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations
A quantized Fisher-Yates shuffle builds five quantum circuits for uniform permutation superpositions with O(n log n) qubits and up to O(n^2 log^2 n) gates, though the headline says O(n^2 log n).
Discussion (0). Continue with ORCID to comment.