On the multi-user security of LWE-based NIKE
From MaRDI portal
Publication:6587945
Recommendations
- Limits on the efficiency of (ring) LWE-based non-interactive key exchange
- Limits on the efficiency of (ring) LWE based non-interactive key exchange
- Towards tight adaptive security of non-interactive key exchange
- Almost tight multi-user security under adaptive corruptions from LWE in the standard model
- New techniques for SIDH-based NIKE
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A direct key recovery attack on SIDH
- A toolkit for ring-LWE cryptography
- An efficient key recovery attack on SIDH
- Applied Cryptography and Network Security
- Breaking SIDH in polynomial time
- CSIDH: an efficient post-quantum commutative group action
- Classical hardness of learning with errors
- Composability and On-Line Deniability of Authentication
- Efficient laconic cryptography from learning with errors
- Entropic hardness of Module-LWE from module-NTRU
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully secure functional encryption for inner products, from standard assumptions
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Hardness of LWE on general entropic distributions
- LWE with side information: attacks and concrete security estimation
- LWE without modular reduction and improved side-channel attacks against BLISS
- Lattice cryptography for the internet
- Lattice signatures without trapdoors
- Limits on the efficiency of (ring) LWE based non-interactive key exchange
- Lossiness and entropic hardness for ring-LWE
- New bounds in some transference theorems in the geometry of numbers
- New directions in cryptography
- Non-interactive key exchange
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of learning with errors with binary secrets
- On the impossibility of tight cryptographic reductions
- On tightly secure non-interactive key exchange
- Pseudorandomness of ring-LWE for any ring and modulus
- Public-key cryptosystems from the worst-case shortest vector problem
- Signal-flow-based analysis of wireless security protocols
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- The Twin Diffie-Hellman Problem and Applications
- Towards classical hardness of module-LWE: the linear rank case
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Towards tight adaptive security of non-interactive key exchange
- Worst-case to average-case reductions for module lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(1)
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)
