Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness

DOI10.1007/978-3-030-92075-3_17MaRDI QIDQ6157528zbMATH OpenOpenAlexFDO

Authors Shuai Han, Shengli Liu, Dawu Gu

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92075-3_17

zbMATH Keywords

achievability of tight ECPAECCA security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A constructive perspective on key encapsulation
• Hybrid encryption in a multi-user setting, revisited
• Constructing Better KEMs with Partial Message Recovery
• Security in Communication Networks
• Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology – CRYPTO 2004
• An algebraic framework for Diffie-Hellman assumptions
• Authenticated key exchange and signatures with tight security in the standard model
• Breaking RSA may not be equivalent to factoring
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• Highly efficient key exchange protocols with optimal tightness
• HMQV: A High-Performance Secure Diffie-Hellman Protocol
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 2086712 (Why is no real title available?)
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• Kurosawa-Desmedt meets tight security
• Multi-key authenticated encryption with corruptions: reductions are lossy
• New directions in cryptography
• On the adaptive security of MACs and PRFs
• On the impossibility of tight cryptographic reductions
• On the security loss of unique signatures
• On tightly secure non-interactive key exchange
• Optimal security proofs for full domain hash, revisited
• Practical and tightly-secure digital signatures and authenticated key exchange
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Signed Diffie-Hellman key exchange with tight security
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Stronger Security of Authenticated Key Exchange
• Tight leakage-resilient CCA-security from quasi-adaptive hash proof system
• Tightly CCA-secure encryption without pairings
• Tightly Secure Signatures and Public-Key Encryption
• Tightly-secure authenticated key exchange
• Tightly-secure authenticated key exchange, revisited
• Two-pass authenticated key exchange with explicit authentication and tight security
• Understanding and constructing AKE via double-key key encapsulation mechanism
• Verifiable random functions with optimal tightness
• Waters signatures with optimal security reduction
• Why Proving HIBE Systems Secure Is Difficult

Cited in

(9)

• Optimal tightness for chain-based unique signatures
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
• Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
• Lattice-based authenticated key exchange with tight security
• Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
• Count corruptions, not users: improved tightness for signatures, encryption and authenticated key exchange
• Tightly, adaptively secure proxy re-encryption in multi-challenge setting
• Putting multi into multi-signatures: tight security for multiple signers

This page was built for publication: Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157528)