MoL-2013-01: Velema, Maria (2013) Classical Encryption and Authentication under Quantum Attacks. [Report]
Preview |
Text (Full Text)
MoL-2013-01.text.pdf Download (466kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
MoL-2013-01.abstract.txt Download (933B) |
Abstract
Post-quantum cryptography studies the security of classical,
i.e. non-quantum cryptographic protocols against quantum
attacks. Until recently, the considered adversaries were assumed to
use quantum computers and behave like classical adversaries
otherwise. A more conservative approach is to assume that also the
communication between the honest parties and the adversary is (partly)
quantum. We discuss several options to define secure encryption and
authentication against these stronger adversaries who can carry out
superposition attacks. We re-prove a recent result of Boneh and
Zhandry, stating that a uniformly random function (and hence also a
quantum-secure pseudorandom function) can serve as a
message-authentication code which is secure, even if the adversary can
evaluate this function in superposition.
| Item Type: | Report |
|---|---|
| Report Nr: | MoL-2013-01 |
| Series Name: | Master of Logic Thesis (MoL) Series |
| Year: | 2013 |
| Uncontrolled Keywords: | Logic, Computation |
| Date Deposited: | 12 Oct 2016 14:38 |
| Last Modified: | 12 Oct 2016 14:38 |
| URI: | https://eprints.illc.uva.nl/id/eprint/890 |
Actions (login required)
 |
View Item |
