On the Hardness of Learning with Rounding over Small Modulus (Q2796126): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: How to Garble Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Rounding, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions and Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-Key Encryption Schemes with Auxiliary Inputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GGHLite: More Efficient Multilinear Maps from Ideal Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Deniable Public-Key Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rényi Divergence and Kullback-Leibler Divergence / rank
 
Normal rank

Latest revision as of 15:50, 11 July 2024

scientific article
Language Label Description Also known as
English
On the Hardness of Learning with Rounding over Small Modulus
scientific article

    Statements

    Identifiers