On the multi-user security of LWE-based NIKE
From MaRDI portal
Publication:6587945
DOI10.1007/978-3-031-48624-1_2zbMATH Open1543.94737MaRDI QIDQ6587945
Publication date: 15 August 2024
Cites Work
- Title not available (Why is that?)
- Signal-flow-based analysis of wireless security protocols
- New bounds in some transference theorems in the geometry of numbers
- LWE without modular reduction and improved side-channel attacks against BLISS
- CSIDH: an efficient post-quantum commutative group action
- On tightly secure non-interactive key exchange
- Lossiness and entropic hardness for ring-LWE
- LWE with side information: attacks and concrete security estimation
- Hardness of LWE on general entropic distributions
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Towards classical hardness of module-LWE: the linear rank case
- Towards tight adaptive security of non-interactive key exchange
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
- Lattice Signatures without Trapdoors
- Lattice Cryptography for the Internet
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- Composability and On-Line Deniability of Authentication
- New directions in cryptography
- Applied Cryptography and Network Security
- Non-Interactive Key Exchange
- A Toolkit for Ring-LWE Cryptography
- Pseudorandomness of ring-LWE for any ring and modulus
- Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange
- Public-key cryptosystems from the worst-case shortest vector problem
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- The Twin Diffie-Hellman Problem and Applications
- Classical hardness of learning with errors
- On the Impossibility of Tight Cryptographic Reductions
- On lattices, learning with errors, random linear codes, and cryptography
- Efficient laconic cryptography from learning with errors
- An efficient key recovery attack on SIDH
- A direct key recovery attack on SIDH
- Breaking SIDH in polynomial time
- Entropic hardness of Module-LWE from module-NTRU
This page was built for publication: On the multi-user security of LWE-based NIKE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587945)
