Order-C secure multiparty computation for highly repetitive circuits

DOI10.1007/978-3-030-77886-6_23OpenAlexW3158441657MaRDI QIDQ2056761

Abhishek Jain, Gabrielle Beck, Gabriel Kaptchuk, Aarushi Goel

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_23

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computer system organization (68Mxx)

Related Items (7)

Secure multiparty computation with free branching ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Sharing transformation and dishonest majority MPC with packed secret sharing ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Cryptography with weights: MPC, encryption and signatures ⋮ Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

Cites Work

• Unnamed Item
• Fast large-scale honest-majority MPC for malicious adversaries
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• Guaranteed output delivery comes free in honest majority MPC
• How to share a secret
• Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable and Unconditionally Secure Multiparty Computation
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The knowledge complexity of interactive proof-systems
• Circuits resilient to additive attacks with applications to secure computation
• Robust Multiparty Computation with Linear Communication Complexity
• Scalable Secure Multiparty Computation

This page was built for publication: Order-C secure multiparty computation for highly repetitive circuits