Secure multi-party computation made simple

DOI10.1007/3-540-36413-7_2MaRDI QIDQ4414265zbMATH OpenFDO

Authors Ueli M. Maurer

Publication date 24 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2576/25760014.htm

zbMATH Keywords

adversary structuressecret-sharingSecure multi-party computationverifiable secret-sharing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Secure multi-party computation made simple
• Multiparty computation from threshold homomorphic encryption
• Multiparty computation, an introduction
• Quorum-based secure multi-party computation
• Introduction to secure computation

Cited in

(29)

• On the (in)efficiency of non-interactive secure multiparty computation
• Minimal complete primitives for secure multi-party computation
• Yet another compiler for active security or: efficient MPC over arbitrary rings
• Random probing security: verification, composition, expansion and new constructions
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Improved signature schemes for secure multi-party computation with certified inputs
• Secure multi-party computation made simple
• Secure multi-party computation
• Computationally sound abstraction and verification of secure multi-party computations
• Systematizing secure computation for research and decision support
• Three specific secure computation service protocols
• When is a semi-honest secure multiparty computation valuable?
• Broadcast from minicast secure against general adversaries
• Secure Protocols with Asymmetric Trust
• Secure multi-party computation protocol for sequencing problem
• Improved primitives for secure multiparty integer computation
• MPC vs. SFE : Unconditional and Computational Security
• Minimal complete primitives for secure multi-party computation
• CNF-FSS and its applications
• Multiparty computation, an introduction
• TinyKeys: a new approach to efficient multi-party computation
• Mixed-technique multi-party computations composed of two-party computations
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
• Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
• Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
• Threshold fully homomorphic encryption over the torus
• Network agnostic MPC with statistical security
• MPC with delayed parties over star-like networks
• General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption

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 Q4414265)