Almost tight multi-user security under adaptive corruptions from LWE in the standard model

DOI10.1007/978-3-031-38554-4_22OpenAlexW4385654254MaRDI QIDQ6190153

Shuai Han, Zhedong Wang, Shengli Liu, Da-Wu Gu

Publication date: 6 February 2024

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

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

zbMATH Keywords

almost tight multi-user securityprobabilistic quasi-adaptive hash proof system

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-round PAKE from approximate SPH and instantiations from lattices
• Hash proof systems over lattices revisited
• Practical and tightly-secure digital signatures and authenticated key exchange
• A constructive perspective on signcryption security
• Security under message-derived keys: signcryption in iMessage
• More efficient digital signatures with tight multi-user security
• Hardness of LWE on general entropic distributions
• Authenticated key exchange and signatures with tight security in the standard model
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• Tightly CCA-secure encryption scheme in a multi-user setting with corruptions
• Tight leakage-resilient CCA-security from quasi-adaptive hash proof system
• Simulation-sound arguments for LWE and applications to KDM-CCA2 security
• On the adaptive security of MACs and PRFs
• Learning with Rounding, Revisited
• Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
• Improved Short Lattice Signatures in the Standard Model
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Lattice Signatures without Trapdoors
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Stronger Security of Authenticated Key Exchange
• Lossy trapdoor functions and their applications
• Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
• An Efficient and Parallel Gaussian Sampler for Lattices
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• Practical Signatures from Standard Assumptions
• PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model
• Public-key cryptosystems from the worst-case shortest vector problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• Fiat-Shamir: from practice to theory
• Tightly-Secure Authenticated Key Exchange
• On the Impossibility of Tight Cryptographic Reductions
• On lattices, learning with errors, random linear codes, and cryptography
• Almost tight multi-user security under adaptive corruptions \& leakages in the standard model
• Lattice-based signatures with tight adaptive corruptions and more

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