Adaptively secure garbling with near optimal online complexity
type: Item
instance of: scholarly article
title: Adaptively secure garbling with near optimal online complexity
zbMATH Open document ID: 1428.94073
DOI: 10.1007/978-3-319-78375-8_18
author: Sanjam Garg
author: Akshayaram Srinivasan
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 6900714
MaRDI profile type: Publication
full work available at URL: 978-3-319-78375-8 18
OpenAlex ID: W2795149599
Recommended article: Adaptive security of practical garbling schemes
Recommended article: Adaptively secure garbling schemes for parallel computations
Recommended article: Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
Recommended article: Adaptive garbled RAM from laconic oblivious transfer
Recommended article: Adaptively Secure Garbled Circuits from One-Way Functions
Recommended article: Limits on the adaptive security of Yao's garbling
Recommended article: Efficient adaptively secure zero-knowledge from garbled circuits
Recommended article: Adaptive Security with Quasi-Optimal Rate
Recommended article: Threshold garbled circuits and ad hoc secure computation
description: scientific article; zbMATH DE number 6900714