Two-Round Oblivious Linear Evaluation from Learning with Errors
From MaRDI portal
Publication:5087264
DOI10.1007/978-3-030-97121-2_14zbMath1492.94069MaRDI QIDQ5087264
Nico Döttling, Pedro Branco, 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
Related Items
Two-Round Oblivious Linear Evaluation from Learning with Errors, Round-optimal black-box secure computation from two-round malicious OT, Batch-OT with optimal rate
Uses Software
Cites Work
- New bounds in some transference theorems in the geometry of numbers
- 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
- Efficient protocols for oblivious linear function evaluation from ring-LWE
- UC-secure OT from LWE, revisited
- Two-round oblivious transfer from CDH or LPN
- An algebraic approach to maliciously secure private set intersection
- Reusable non-interactive secure computation
- The communication complexity of threshold private set intersection
- Maliciously secure oblivious linear function evaluation with constant overhead
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Pseudorandom Functions and Lattices
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token
- Trapdoors for hard lattices and new cryptographic constructions
- A Framework for Efficient and Composable Oblivious Transfer
- Secure Arithmetic Computation with No Honest Majority
- Two-Round Oblivious Linear Evaluation from Learning with Errors
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- How to Garble Arithmetic Circuits
- On lattices, learning with errors, random linear codes, and cryptography
