Two-round oblivious linear evaluation from learning with errors
From MaRDI portal
Publication:5087264
DOI10.1007/978-3-030-97121-2_14zbMATH Open1492.94069OpenAlexW3037625007MaRDI QIDQ5087264FDOQ5087264
Authors: Pedro Branco, Nico Döttling, Paulo Mateus 
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_14
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
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- A Framework for Efficient and Composable Oblivious Transfer
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- New bounds in some transference theorems in the geometry of numbers
- Secure Arithmetic Computation with No Honest Majority
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Trapdoors for lattices: simpler, tighter, faster, smaller
- How to Garble Arithmetic Circuits
- Pseudorandom functions and lattices
- An algorithm for finding a shortest vector in a two-dimensional modular lattice
- Two-message statistically sender-private OT from LWE
- Secure arithmetic computation with constant computational overhead
- Unconditional and composable security using a single stateful Tamper-proof hardware token
- Reusable non-interactive secure computation
- An algebraic approach to maliciously secure private set intersection
- The communication complexity of threshold private set intersection
- Maliciously secure oblivious linear function evaluation with constant overhead
- Two-round oblivious transfer from CDH or LPN
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- UC-secure OT from LWE, revisited
- Two-round oblivious linear evaluation from learning with errors
Cited In (8)
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- Round-optimal black-box secure computation from two-round malicious OT
- Statistically secure linear-rate dimension extension for oblivious affine function evaluation
- Maliciously secure oblivious linear function evaluation with constant overhead
- Oblivious transfer and \(n\)-variate linear function evaluation
- Two-round oblivious linear evaluation from learning with errors
- Batch-OT with optimal rate
- Title not available (Why is that?)
Uses Software
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)
