Secure Multiparty Computation and Secret Sharing

DOI10.1017/CBO9781107337756zbMath1322.68003MaRDI QIDQ5500574

Jesper Buus Nielsen, Ronald Cramer, Ivan B. Damgård

Publication date: 6 August 2015

cryptography secret sharing secure multiparty computation

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01)

Related Items (44)

Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ The quadratic hull of a code and the geometric view on multiplication algorithms ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ Oblivious transfer in incomplete networks ⋮ Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms ⋮ Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ Complexity and performance of secure floating-point polynomial evaluation protocols ⋮ Secret Sharing Schemes with Algebraic Properties and Applications ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Optimality of a protocol by Feige-Kilian-Naor for three-party secure computation ⋮ Properties of constacyclic codes under the Schur product ⋮ Secret sharing schemes with strong multiplication and a large number of players from toric varieties ⋮ Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract) ⋮ Full threshold change range of threshold changeable secret sharing ⋮ On secret sharing, randomness, and random-less reductions for secret sharing ⋮ Improved single-round secure multiplication using regenerating codes ⋮ Perfect MPC over layered graphs ⋮ Some new classes of additive MDS and almost MDS codes over finite fields ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers ⋮ An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption ⋮ Trojan-resilience without cryptography ⋮ Privacy preserving distributed optimization using homomorphic encryption ⋮ A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Probabilistic secret sharing ⋮ Secure Multi-party Computation: Information Flow of Outputs and Game Theory ⋮ ON THE CONSTRUCTION OF A SEMANTICALLY SECURE MODIFICATION OF THE MCELIECE CRYPTOSYSTEM ⋮ Secure Outsourced Computation ⋮ Nearly optimal robust secret sharing ⋮ Unnamed Item ⋮ Yet another compiler for active security or: efficient MPC over arbitrary rings ⋮ A note on secure multiparty computation via higher residue symbols ⋮ Squares of matrix-product codes ⋮ Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes ⋮ Secure multi-party quantum computation with a dishonest majority ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Unnamed Item ⋮ High dimensional affine codes whose square has a designed minimum distance ⋮ Reverse firewalls for actively secure MPCs ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics

This page was built for publication: Secure Multiparty Computation and Secret Sharing