Lattice-Based Cryptography
From MaRDI portal
Publication:5756637
DOI10.1007/11818175_8zbMath1161.94425OpenAlexW1761303171MaRDI QIDQ5756637
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_8
Related Items (19)
Local Testing of Lattices ⋮ A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes ⋮ Fiat-Shamir signatures based on module-NTRU ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Circuit complexity of linear functions: gate elimination and feeble security ⋮ Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage ⋮ A lattice-based identity-based proxy blind signature scheme in the standard model ⋮ Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\) ⋮ Integer Reconstruction Public-Key Encryption ⋮ Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH ⋮ Gate Elimination for Linear Functions and New Feebly Secure Constructions ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Cryptanalysis of the extension field cancellation cryptosystem ⋮ Cryptographic hardness for learning intersections of halfspaces ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Unnamed Item ⋮ Security comparisons and performance analyses of post-quantum signature algorithms
This page was built for publication: Lattice-Based Cryptography
