Threshold garbled circuits and ad hoc secure computation

DOI10.1007/978-3-030-77883-5_3OpenAlexW3159103310MaRDI QIDQ2056781

Vipul Goyal, Rafail Ostrovsky, Michele Ciampi

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

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

Related Items (1)

Functional encryption with secure key leasing

Cites Work

• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• The complexity of multiparty PSM protocols and related models
• Robust non-interactive multiparty computation against constant-size collusion
• Adaptively indistinguishable garbled circuits
• Non-interactive multiparty computation without correlated randomness
• Distribution Design
• Secure Multiparty Computation with General Interaction Patterns
• A minimal model for secure computation (extended abstract)
• Spooky Encryption and Its Applications
• Adaptively Secure Garbled Circuits from One-Way Functions
• Non-Interactive Secure Multiparty Computation
• Adaptive Security of Yao’s Garbled Circuits
• Improved Garbled Circuit: Free XOR Gates and Applications
• Foundations of Homomorphic Secret Sharing
• Secure Computation on the Web: Computing without Simultaneous Interaction
• Ad Hoc PSM Protocols: Secure Computation Without Coordination
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• How to Garble Arithmetic Circuits
• Reusable garbled circuits and succinct functional encryption

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