Tightly CCA-secure encryption scheme in a multi-user setting with corruptions

DOI10.1007/s10623-020-00794-zzbMath1458.94259OpenAlexW3082643577WikidataQ122961638 ScholiaQ122961638MaRDI QIDQ2205895

Yanyan Li

Publication date: 21 October 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00794-z

zbMATH Keywords

public-key encryptionrandom oracle modeltight securityCDHmulti-user setting with corruptions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Tightness subtleties for multi-user PKE notions ⋮ Deniable authentication when signing keys leak ⋮ Almost tight multi-user security under adaptive corruptions \& leakages in the standard model ⋮ Multi-instance secure public-key encryption ⋮ Fuzzy authenticated key exchange with tight security ⋮ Anonymous public key encryption under corruptions ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kurosawa-Desmedt meets tight security
• A modular analysis of the Fujisaki-Okamoto transformation
• Hybrid encryption in a multi-user setting, revisited
• Practical and tightly-secure digital signatures and authenticated key exchange
• Extended Nested Dual System Groups, Revisited
• A Framework for Identity-Based Encryption with Almost Tight Security
• Compactly Hiding Linear Spans
• Tightly CCA-Secure Encryption Without Pairings
• Tightly Secure Signatures and Public-Key Encryption
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Identity-Based Cryptosystems and Signature Schemes
• New directions in cryptography
• Nonmalleable Cryptography
• Tightly-Secure Authenticated Key Exchange
• Adaptive Partitioning
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• The Twin Diffie-Hellman Problem and Applications
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Identity-Based Encryption with Tight Security Reduction

This page was built for publication: Tightly CCA-secure encryption scheme in a multi-user setting with corruptions