Constant-overhead unconditionally secure multiparty computation over binary fields

DOI10.1007/978-3-030-77886-6_28MaRDI QIDQ2056769zbMATH OpenOpenAlexFDO

Authors Antigoni Polychroniadou, Yifan Song

Publication date 8 December 2021

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

Mathematics Subject Classification ID

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

Cites work

• A new approach to practical active-secure two-party computation
• Amortized complexity of information-theoretically secure MPC revisited
• Circuits resilient to additive attacks with applications to secure computation
• Communication-efficient unconditional MPC with guaranteed output delivery
• Constant-overhead secure computation of Boolean circuits using preprocessing
• Constant-overhead unconditionally secure multiparty computation over binary fields
• Efficient fully secure computation via distributed zero-knowledge proofs
• Fast large-scale honest-majority MPC for malicious adversaries
• Guaranteed output delivery comes free in honest majority MPC
• How to share a secret
• scientific article; zbMATH DE number 4195141 (Why is no real title available?)
• Minimising communication in honest-majority MPC by batchwise multiplication verification
• Multiparty Computation from Somewhat Homomorphic Encryption
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable and Unconditionally Secure Multiparty Computation
• The price of active security in cryptographic protocols
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(11)

• Constant-overhead unconditionally secure multiparty computation over binary fields
• Unconditional communication-efficient MPC via Hall's marriage theorem
• Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC
• Limits of polynomial packings for \(\mathbb{Z}_{p^k}\) and \(\mathbb{F}_{p^k}\)
• On interactive oracle proofs for Boolean R1CS statements
• Sharing transformation and dishonest majority MPC with packed secret sharing
• Degree-D reverse multiplication-friendly embeddings: constructions and applications
• The price of active security in cryptographic protocols
• Fully secure MPC and zk-FLIOP over rings: new constructions, improvements and extensions
• (1/ )-rate Boolean garbling scheme from generic groups
• Perfectly-secure multiparty computation with linear communication complexity over any modulus

This page was built for publication: Constant-overhead unconditionally secure multiparty computation over binary fields

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