Secure multi-party computation made simple

DOI10.1016/J.DAM.2005.03.020zbMATH Open1091.94035OpenAlexW1999721188MaRDI QIDQ2489932FDOQ2489932

Authors: Ueli M. Maurer 

Publication date: 28 April 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.020

Recommendations

• scientific article; zbMATH DE number 1952886
• Multiparty computation, an introduction
• scientific article; zbMATH DE number 1304184
• scientific article; zbMATH DE number 1303136
• scientific article; zbMATH DE number 1583776

zbMATH Keywords

adversary structuresSecure multi-party computationverifyable secret sharing

Mathematics Subject Classification ID

Distributed algorithms (68W15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Security and composition of multiparty cryptographic protocols
• General secure multi-party computation from any linear secret-sharing scheme
• Player simulation and general adversary structures in perfect multiparty computation
• The Byzantine Generals Problem
• Title not available (Why is that?)
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (25)

• Computationally sound abstraction and verification of secure multi-party computations
• The meeting businessmen problem: requirements and limitations
• TinyKeys: a new approach to efficient multi-party computation
• Minimal complete primitives for secure multi-party computation
• Title not available (Why is that?)
• On \(d\)-multiplicative secret sharing
• MPC vs. SFE : Unconditional and Computational Security
• MPC with delayed parties over star-like networks
• MPC for \(\mathcal{Q}_2\) access structures over rings and fields
• Operations over linear secret sharing schemes
• The cost of IEEE arithmetic in secure computation
• Improved signature schemes for secure multi-party computation with certified inputs
• Perfect MPC over layered graphs
• Asynchronous privacy-preserving iterative computation on peer-to-peer networks
• Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures
• Public randomness extraction with ephemeral roles and worst-case corruptions
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• VSS Made Simpler
• Title not available (Why is that?)
• Efficient fully secure computation via distributed zero-knowledge proofs
• Strong \((n, t, n)\) verifiable secret sharing scheme
• Multiparty computation, an introduction
• On-line secret sharing
• When is a semi-honest secure multiparty computation valuable?
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

This page was built for publication: Secure multi-party computation made simple

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