Almost tight multi-user security under adaptive corruptions \& leakages in the standard model

DOI10.1007/978-3-031-30620-4_5OpenAlexW4365807067MaRDI QIDQ6085265

Da-Wu Gu, Shuai Han, Shengli Liu

Publication date: 12 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30620-4_5

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

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
• Kurosawa-Desmedt meets tight security
• Multi-key authenticated encryption with corruptions: reductions are lossy
• Identity-based encryption tightly secure under chosen-ciphertext attacks
• Practical and tightly-secure digital signatures and authenticated key exchange
• Tightly secure chameleon hash functions in the multi-user setting and their applications
• Security under message-derived keys: signcryption in iMessage
• More efficient digital signatures with tight multi-user security
• Authenticated key exchange and signatures with tight security in the standard model
• Shorter QA-NIZK and SPS with tighter security
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Tight leakage-resilient CCA-security from quasi-adaptive hash proof system
• On the adaptive security of MACs and PRFs
• Two-pass authenticated key exchange with explicit authentication and tight security
• Tightly CCA-Secure Encryption Without Pairings
• An Algebraic Framework for Diffie-Hellman Assumptions
• Fully, (Almost) Tightly Secure IBE and Dual System Groups
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Message Authentication, Revisited
• Tightly Secure Signatures and Public-Key Encryption
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• The Kernel Matrix Diffie-Hellman Assumption
• Simultaneous Hardcore Bits and Cryptography against Memory Attacks
• Tightly-Secure Authenticated Key Exchange
• How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
• On the Impossibility of Tight Cryptographic Reductions
• Public-Key Cryptosystems Resilient to Key Leakage
• Tightly secure hierarchical identity-based encryption
• Lattice-based signatures with tight adaptive corruptions and more

This page was built for publication: Almost tight multi-user security under adaptive corruptions \& leakages in the standard model