Lattice-Based Cryptography

DOI10.1007/11818175_8zbMath1161.94425MaRDI QIDQ5756637

Oded Regev

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

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

Local Testing of Lattices, Unnamed Item, Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH, A Digital Signature Scheme Based on CVP  ∞, Fiat-Shamir signatures based on module-NTRU, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, A lattice-based identity-based proxy blind signature scheme in the standard model, Circuit complexity of linear functions: gate elimination and feeble security, Cryptanalysis of the extension field cancellation cryptosystem, Security comparisons and performance analyses of post-quantum signature algorithms, D-NTRU: more efficient and average-case IND-CPA secure NTRU variant, Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage, Tightly secure signature schemes from the LWE and subset sum assumptions, Towards factoring in \(\mathrm{SL}(2,\mathbb F_{2^n})\), Cryptographic hardness for learning intersections of halfspaces, A unified framework of identity-based sequential aggregate signatures from 2-level HIBE schemes, Gate Elimination for Linear Functions and New Feebly Secure Constructions, Algebraic cryptography: new constructions and their security against provable break, Integer Reconstruction Public-Key Encryption