Two-message statistically sender-private OT from LWE
type: Item
instance of: scholarly article
title: Two-message statistically sender-private OT from LWE
zbMATH Open document ID: 1430.94060
DOI: 10.1007/978-3-030-03810-6_14
author: Zvika Brakerski
author: Nico Döttling
publication date: 2018-12-06T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6989748
MaRDI profile type: Publication
full work available at URL: 978-3-030-03810-6 14
OpenAlex ID: W2898733944
cites work: Q2778845
cites work: Q4938616
cites work: Two-message witness indistinguishability and secure computation in the plain model from new assumptions
cites work: Promise zero knowledge and its applications to round optimal MPC
cites work: Round optimal concurrent MPC via strong simulation
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: Q3210162
cites work: Four round secure computation without setup
cites work: Classical hardness of learning with errors
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Q4542514
cites work: Definitions and properties of zero-knowledge proof systems
cites work: Round-optimal secure multi-party computation
cites work: Smooth projective hashing and two-message oblivious transfer
cites work: Distinguisher-dependent simulation in two rounds and its applications
cites work: Nash on game theory applications
cites work: Smooth Projective Hashing and Two-Message Oblivious Transfer
cites work: Statistical witness indistinguishability (and more) in two messages
cites work: Round optimal concurrent non-malleability from polynomial hardness
cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Efficient oblivious transfer protocols
cites work: Maliciously Circuit-Private FHE
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Pseudorandomness of ring-LWE for any ring and modulus
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On lattices, learning with errors, random linear codes, and cryptography
description: scientific article; zbMATH DE number 6989748