Keyless secrecy against bounded adversaries
This work introduces a keyless cryptographic primitive that simultaneously guarantees receiver correctness and adversary ignorance against a bounded attacker. It achieves this without needing secret keys or computational hardness assumptions, establishing an efficient quantum scheme for detection and everlasting secrecy.