Threshold garbled circuits and ad hoc secure computation
type: Item
instance of: scholarly article
title: Threshold garbled circuits and ad hoc secure computation
DOI: 10.1007/978-3-030-77883-5_3
author: Michele Ciampi
author: Vipul Goyal
author: Rafail Ostrovsky
publication date: 2021-12-08T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7440634
MaRDI profile type: Publication
full work available at URL: 978-3-030-77883-5 3
OpenAlex ID: W3159103310
cites work: How to Garble Arithmetic Circuits
cites work: Q4783716
cites work: Distribution design
cites work: Non-Interactive Secure Multiparty Computation
cites work: Ad Hoc PSM Protocols: Secure Computation Without Coordination
cites work: The complexity of multiparty PSM protocols and related models
cites work: Robust non-interactive multiparty computation against constant-size collusion
cites work: Foundations of Homomorphic Secret Sharing
cites work: Spooky Encryption and Its Applications
cites work: A minimal model for secure computation (extended abstract)
cites work: Reusable garbled circuits and succinct functional encryption
cites work: Non-interactive multiparty computation without correlated randomness
cites work: Secure multiparty computation with general interaction patterns
cites work: Secure Computation on the Web: Computing without Simultaneous Interaction
cites work: Adaptively Secure Garbled Circuits from One-Way Functions
cites work: Adaptively indistinguishable garbled circuits
cites work: Adaptive Security of Yao’s Garbled Circuits
cites work: Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
cites work: Improved Garbled Circuit: Free XOR Gates and Applications
cites work: A proof of security of Yao's protocol for two-party computation
description: scientific article; zbMATH DE number 7440634