On the multi-user security of LWE-based NIKE

DOI10.1007/978-3-031-48624-1_2zbMATH Open1543.94737MaRDI QIDQ6587945FDOQ6587945

Authors: Roman Langrehr 

Publication date: 15 August 2024

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

zbMATH Keywords

multi-user securitynon-interactive key exchange schemes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

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)