Approximate-Deterministic Public Key Encryption from Hard Learning Problems (Q3179474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Rounding, Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and Efficiently Searchable Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Learning with Rounding over Small Modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instantiating Random Oracles via UCEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identity-Based (Lossy) Trapdoor Functions and Applications / 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: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Codes and a New Variant of the Learning-With-Errors Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: IND-CCA Secure Cryptography Based on a Variant of the LPN Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lapin: An Efficient Authentication Protocol Based on Ring-LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Chosen-Ciphertext Security from Low-Noise LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / 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: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / 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: A Framework for Efficient and Composable Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy trapdoor functions and their applications / 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: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Barriers in cryptography with weak, correlated and leaky sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN / rank
 
Normal rank

Latest revision as of 04:26, 13 July 2024

scientific article
Language Label Description Also known as
English
Approximate-Deterministic Public Key Encryption from Hard Learning Problems
scientific article

    Statements

    Approximate-Deterministic Public Key Encryption from Hard Learning Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2016
    0 references
    deterministic public key encryption
    0 references
    learning parity with noise
    0 references
    learning with errors
    0 references
    0 references

    Identifiers