On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions

DOI10.1007/978-3-662-49384-7_5zbMath1388.94064OpenAlexW2293392971MaRDI QIDQ2798773

Takahiro Matsuda, Fuyuki Kitagawa, Goichiro Hanaoka, Keisuke Tanaka

Publication date: 13 April 2016

Published in: Public-Key Cryptography – PKC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49384-7_5

zbMATH Keywords

public key encryptionchosen ciphertext securitykey dependent message security

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

The KDM-CCA Security of REACT ⋮ Naor-Yung paradigm with shared randomness and applications ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Generic constructions of master-key KDM secure attribute-based encryption ⋮ Naor-Yung Paradigm with Shared Randomness and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on model checking the modal \(\nu\)-calculus
• Isabelle/HOL. A proof assistant for higher-order logic
• Completely iterative algebras and completely iterative monads
• Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
• Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
• Recursive Functions on Lazy Lists via Domains and Topologies
• CIRC: A Behavioral Verification Tool Based on Circular Coinduction
• Coalgebraic Bisimulation-Up-To
• The power of parameterization in coinductive proof
• Indexed codata types
• Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving
• The Lean Theorem Prover (System Description)
• A Brief Overview of HOL4
• Temporal Verification of Reactive Systems: Response
• Partial Recursive Functions in Higher-Order Logic
• Fast Pattern Matching in Strings
• Mechanizing coinduction and corecursion in higher-order logic
• Coinduction All the Way Up
• Quantifier Instantiation Techniques for Finite Model Finding in SMT
• Information flow inference for ML
• A fixedpoint approach to implementing (Co)inductive definitions
• Language Constructs for Non-Well-Founded Computation
• Automating Theorem Proving with SMT
• Formal Languages, Formally and Coinductively
• Automated Deduction – CADE-20
• Parametric corecursion

This page was built for publication: On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions