Two-round oblivious linear evaluation from learning with errors
From MaRDI portal
Recommendations
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Maliciously secure oblivious linear function evaluation with constant overhead
- Oblivious transfer and n-variate linear function evaluation
- Oblivious polynomial evaluation and oblivious neural learning
- UC-secure OT from LWE, revisited
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- An algebraic approach to maliciously secure private set intersection
- An algorithm for finding a shortest vector in a two-dimensional modular lattice
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- How to Garble Arithmetic Circuits
- Maliciously secure oblivious linear function evaluation with constant overhead
- New bounds in some transference theorems in the geometry of numbers
- On lattices, learning with errors, random linear codes, and cryptography
- Pseudorandom functions and lattices
- Reusable non-interactive secure computation
- Secure arithmetic computation with constant computational overhead
- Secure Arithmetic Computation with No Honest Majority
- The communication complexity of threshold private set intersection
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Two-message statistically sender-private OT from LWE
- Two-round oblivious linear evaluation from learning with errors
- Two-round oblivious transfer from CDH or LPN
- UC-secure OT from LWE, revisited
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(9)- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Batch-OT with optimal rate
- Maliciously secure oblivious linear function evaluation with constant overhead
- Oblivious transfer and n-variate linear function evaluation
- scientific article; zbMATH DE number 2081076 (Why is no real title available?)
- Two-round oblivious linear evaluation from learning with errors
- Statistically secure linear-rate dimension extension for oblivious affine function evaluation
- Round-optimal black-box secure computation from two-round malicious OT
- Laconic cryptography with preprocessing
This page was built for publication: Two-round oblivious linear evaluation from learning with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087264)
