PlumX Metrics
Embed PlumX Metrics

Tighter Proofs of CCA Security in the Quantum Random Oracle Model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN: 1611-3349, Vol: 11892 LNCS, Page: 61-90
2019
  • 116
    Citations
  • 0
    Usage
  • 22
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    116
    • Citation Indexes
      114
    • Policy Citations
      2
      • Policy Citation
        2
  • Captures
    22

Conference Paper Description

We revisit the construction of IND-CCA secure key encapsulation mechanisms (KEM) from public-key encryption schemes (PKE). We give new, tighter security reductions for several constructions. Our main result is an improved reduction for the security of the (formula presented)-transform of Hofheinz, Hövelmanns, and Kiltz (TCC’17) which turns OW-CPA secure deterministic PKEs into IND-CCA secure KEMs. This result is enabled by a new one-way to hiding (O2H) lemma which gives a tighter bound than previous O2H lemmas in certain settings and might be of independent interest. We extend this result also to the case of PKEs with non-zero decryption failure probability and non-deterministic PKEs. However, we assume that the derandomized PKE is injective with overwhelming probability. In addition, we analyze the impact of different variations of the (formula presented)-transform discussed in the literature on the security of the final scheme. We consider the difference between explicit ((formula presented)and implicit (formula presented) rejection, proving that security of the former implies security of the latter. We show that the opposite direction holds if the scheme with explicit rejection also uses key confirmation. Finally, we prove that (at least from a theoretic point of view) security is independent of whether the session keys are derived from message and ciphertext (formula presented) or just from the message (formula presented).

Bibliographic Details

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know