Vis enkel innførsel

dc.contributor.authorPan, Jiaxin
dc.contributor.authorWagner, Benedikt
dc.contributor.authorZeng, Runzhi
dc.date.accessioned2024-02-07T09:05:54Z
dc.date.available2024-02-07T09:05:54Z
dc.date.created2023-12-19T16:14:00Z
dc.date.issued2023
dc.identifier.issn0302-9743
dc.identifier.urihttps://hdl.handle.net/11250/3116076
dc.description.abstractHome Advances in Cryptology – ASIACRYPT 2023 Conference paper Tighter Security for Generic Authenticated Key Exchange in the QROM Download book PDF Download book EPUB Tighter Security for Generic Authenticated Key Exchange in the QROM Jiaxin Pan, Benedikt Wagner & Runzhi Zeng Conference paper First Online: 18 December 2023 168 Accesses Part of the Lecture Notes in Computer Science book series (LNCS,volume 14441) Abstract We give a tighter security proof for authenticated key exchange (AKE) protocols that are generically constructed from key encapsulation mechanisms (KEMs) in the quantum random oracle model (QROM). Previous works (Hövelmanns et al., PKC 2020) gave reductions for such a KEM-based AKE protocol in the QROM to the underlying primitives with square-root loss and a security loss in the number of users and total sessions. Our proof is much tighter and does not have square-root loss. Namely, it only loses a factor depending on the number of users, not on the number of sessions. Our main enabler is a new variant of lossy encryption which we call parameter lossy encryption. In this variant, there are not only lossy public keys but also lossy system parameters. This allows us to embed a computational assumption into the system parameters, and the lossy public keys are statistically close to the normal public keys. Combining with the Fujisaki-Okamoto transformation, we obtain the first tightly IND-CCA secure KEM in the QROM in a multi-user (without corruption), multi-challenge setting. Finally, we show that a multi-user, multi-challenge KEM implies a square-root-tight and session-tight AKE protocol in the QROM. By implementing the parameter lossy encryption tightly from lattices, we obtain the first square-root-tight and session-tight AKE from lattices in the QROM.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleTighter Security for Generic Authenticated Key Exchange in the QROMen_US
dc.title.alternativeTighter Security for Generic Authenticated Key Exchange in the QROMen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionacceptedVersionen_US
dc.source.journalLecture Notes in Computer Science (LNCS)en_US
dc.identifier.doi10.1007/978-981-99-8730-6_13
dc.identifier.cristin2215817
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal