Pseudorandom functions in NC class from the standard LWE assumption (Q2243895): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114690126, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A sieve algorithm for the shortest lattice vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Rounding, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: New and Improved Key-Homomorphic Pseudorandom Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions and Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private Puncturable PRFs from Standard Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key Homomorphic PRFs and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Private constrained PRFs (and more) from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Pseudorandom Functions via On-the-Fly Adaptation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and more efficient PRFs with tight security from LWE and matrix-DDH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Key-homomorphic pseudorandom functions from LWE with small modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest lattice vectors faster using quantum search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient lattice PRFs from keyed pseudorandom synthesizers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizers and their application to the parallel construction of pseudo-random functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Lattice Cryptography / 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: A hierarchy of polynomial time lattice basis reduction algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301801 / rank
 
Normal rank

Revision as of 03:04, 27 July 2024

scientific article
Language Label Description Also known as
English
Pseudorandom functions in NC class from the standard LWE assumption
scientific article

    Statements

    Pseudorandom functions in NC class from the standard LWE assumption (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 November 2021
    0 references
    pseudorandom function
    0 references
    standard LWE
    0 references
    LWR
    0 references
    polynomial modulus
    0 references
    NC circuit class
    0 references

    Identifiers