Two-Round Oblivious Linear Evaluation from Learning with Errors (Q5087264): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Secure arithmetic computation with constant computational overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Garble Arithmetic Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Functions and Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient protocols for oblivious linear function evaluation from ring-LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-message statistically sender-private OT from LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Round Oblivious Linear Evaluation from Learning with Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reusable non-interactive secure computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-round oblivious transfer from CDH or LPN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token / 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: Maliciously secure oblivious linear function evaluation with constant overhead / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to maliciously secure private set intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The communication complexity of threshold private set intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Arithmetic Computation with No Honest Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a shortest vector in a two-dimensional modular lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries / 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: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / 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: UC-secure OT from LWE, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Latest revision as of 14:48, 29 July 2024

scientific article; zbMATH DE number 7554918
Language Label Description Also known as
English
Two-Round Oblivious Linear Evaluation from Learning with Errors
scientific article; zbMATH DE number 7554918

    Statements

    Two-Round Oblivious Linear Evaluation from Learning with Errors (English)
    0 references
    0 references
    0 references
    0 references
    8 July 2022
    0 references
    0 references
    efficient two-round protocols
    0 references
    0 references