Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange

DOI10.1007/978-3-030-45374-9_13zbMath1501.94043OpenAlexW3022658964MaRDI QIDQ5041164

Pritish Kamath, Siyao Guo, Alon Rosen, Katerina Sotiraki

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_13

zbMATH Keywords

LWE based key-exchange protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Non-committing encryption with constant ciphertext expansion from standard assumptions ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ An efficient and generic construction for Signal's handshake (X3DH): post-quantum, state leakage secure, and deniable ⋮ On removing rejection conditions in practical lattice-based signatures

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs with transitive groups
• Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
• On the Hardness of Learning with Rounding over Small Modulus
• New and Improved Key-Homomorphic Pseudorandom Functions
• Pseudorandom Functions and Lattices
• Lattice Cryptography for the Internet
• Rényi Divergence and Kullback-Leibler Divergence
• On Sequences of Pairs of Dependent Random Variables
• On measures of dependence
• On Ideal Lattices and Learning with Errors over Rings
• New directions in cryptography
• Pseudorandom Functions: Three Decades Later
• Public-key cryptosystems from the worst-case shortest vector problem
• Das statistische Problem der Korrelation als Variations‐ und Eigenwertproblem und sein Zusammenhang mit der Ausgleichsrechnung
• On lattices, learning with errors, random linear codes, and cryptography