Cryptography, Volume 4, Issue 4 (December 2020) – 12 articles
Cover Story (view full-size image): In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions and requires that two legitimate users share a random secret key, which is at least twice as long as the tag. We address the question of whether quantum resources can offer any advantage over classical unconditionally secure message authentication codes (MACs). In particular, we consider a rather broad class of symmetric prepare-and-measure quantum MACs, where legitimate users share a common secret random key, and the quantum tag pertains to the state of a quantum system, which is sent to the receiver together with the message. It is shown that such quantum MACs cannot do better than their classical counterparts. View this paper
- Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
- You may sign up for e-mail alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.