Threshold garbled circuits and ad hoc secure computation

DOI10.1007/978-3-030-77883-5_3MaRDI QIDQ2056781zbMATH OpenOpenAlexFDO

Authors Michele Ciampi, Vipul Goyal, Rafail Ostrovsky

Publication date 8 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-77883-5_3

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• A minimal model for secure computation (extended abstract)
• A proof of security of Yao's protocol for two-party computation
• Ad hoc PSM protocols: secure computation without coordination
• Adaptive security of Yao's garbled circuits
• Adaptively indistinguishable garbled circuits
• Adaptively secure garbled circuits from one-way functions
• Distribution design
• Foundations of homomorphic secret sharing
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• How to Garble Arithmetic Circuits
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Improved Garbled Circuit: Free XOR Gates and Applications
• Non-interactive multiparty computation without correlated randomness
• Non-interactive secure multiparty computation
• Reusable garbled circuits and succinct functional encryption
• Robust non-interactive multiparty computation against constant-size collusion
• Secure computation on the web: computing without simultaneous interaction
• Secure multiparty computation with general interaction patterns
• Spooky Encryption and Its Applications
• The complexity of multiparty PSM protocols and related models

Cited in

(9)

• Adaptively secure garbling with near optimal online complexity
• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Overlaying conditional circuit clauses for secure computation
• Efficient adaptively secure zero-knowledge from garbled circuits
• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Functional encryption with secure key leasing
• Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption
• On the communication complexity of PSM and CDS for symmetric functions

This page was built for publication: Threshold garbled circuits and ad hoc secure computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056781)