Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
From MaRDI portal
Publication:6157528
DOI10.1007/978-3-030-92075-3_17zbMATH Open1514.94094OpenAlexW3204669218MaRDI QIDQ6157528FDOQ6157528
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
Recommendations
Cites Work
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- New directions in cryptography
- Title not available (Why is that?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Title not available (Why is that?)
- Breaking RSA may not be equivalent to factoring
- Tightly-secure authenticated key exchange, revisited
- Tightly Secure Signatures and Public-Key Encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Stronger Security of Authenticated Key Exchange
- Why Proving HIBE Systems Secure Is Difficult
- An algebraic framework for Diffie-Hellman assumptions
- Title not available (Why is that?)
- On the impossibility of tight cryptographic reductions
- Tightly CCA-secure encryption without pairings
- Tightly-secure authenticated key exchange
- Practical and tightly-secure digital signatures and authenticated key exchange
- Authenticated key exchange and signatures with tight security in the standard model
- Highly efficient key exchange protocols with optimal tightness
- Waters signatures with optimal security reduction
- Signed Diffie-Hellman key exchange with tight security
- Understanding and constructing AKE via double-key key encapsulation mechanism
- On the security loss of unique signatures
- Optimal security proofs for full domain hash, revisited
- Kurosawa-Desmedt meets tight security
- On tightly secure non-interactive key exchange
- Multi-key authenticated encryption with corruptions: reductions are lossy
- Two-pass authenticated key exchange with explicit authentication and tight security
- Verifiable random functions with optimal tightness
- On the adaptive security of MACs and PRFs
- Tight leakage-resilient CCA-security from quasi-adaptive hash proof system
Cited In (6)
- Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
- Lattice-based authenticated key exchange with tight security
- Optimal tightness for chain-based unique signatures
- Public-key encryption with keyword search in multi-user, multi-challenge setting under adaptive corruptions
- Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
- Memory-Tight Reductions for Practical Key Encapsulation Mechanisms
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)