Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > CHOSEN MESSAGE ATTACKS:
Reports tagged with chosen message attacks:
TR12-136 | 26th October 2012
Dan Boneh, Mark Zhandry

Quantum-Secure Message Authentication Codes

Revisions: 2

We construct the first Message Authentication Codes (MACs) that are existentially unforgeable against a quantum chosen message attack. These chosen message attacks model a quantum adversary’s ability to obtain the MAC on a superposition of messages of its choice. We begin by showing that a quantum secure PRF is sufficient ... more >>>




ISSN 1433-8092 | Imprint