Bounded-concurrent secure multi-party computation with a dishonest majority

DOI10.1145/1007352.1007393zbMATH Open1192.68077OpenAlexW2064265141MaRDI QIDQ3580972FDOQ3580972

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007393

Recommendations

Protocols for bounded-concurrent secure two-party computation in the plain model
Bounded-concurrent secure two-party computation without setup assumptions
Black-box constructions of bounded-concurrent secure computation
Adaptively secure multi-party computation with dishonest majority
scientific article; zbMATH DE number 2009981

Mathematics Subject Classification ID

Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Cited In (44)

Efficient constant-round multi-party computation combining BMR and SPDZ
Cryptography Using Captcha Puzzles
Constant-Round Nonmalleable Commitments from Any One-Way Function
Black-box constructions of bounded-concurrent secure computation
Post-quantum multi-party computation
Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
On the concurrent composition of quantum zero-knowledge
An Algebraic Approach to Nonmalleability
Round-optimal secure multi-party computation
Game-theoretically secure protocols for the ordinal random assignment problem
Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
Game-theoretic fairness meets multi-party protocols: the case of leader election
Efficient NIZK arguments with straight-line simulation and extraction
Two-round concurrent 2PC from sub-exponential LWE
The Complexity of Zero Knowledge
Magic Adversaries Versus Individual Reduction: Science Wins Either Way
Protocols for multiparty coin toss with a dishonest majority
Maliciously secure massively parallel computation for all-but-one corruptions
Unbounded ABE via bilinear entropy expansion, revisited
Private multiparty sampling and approximation of vector combinations
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Protocols for bounded-concurrent secure two-party computation in the plain model
On concurrent multi-party quantum computation
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
Network-Hiding Communication and Applications to Multi-party Protocols
Round-optimal and communication-efficient multiparty computation
Non-black-box simulation from one-way functions and applications to resettable security
Round-optimal multi-party computation with identifiable abort
\(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
Efficient constant-round MPC with identifiable abort and public verifiability
Proactive secure multiparty computation with a dishonest majority
On the Exact Round Complexity of Self-composable Two-Party Computation
Lower bounds and impossibility results for concurrent self composition
How to obtain full privacy in auctions
From fairness to full security in multiparty computation
\(\log^\ast\)-round game-theoretically-fair leader election
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
Universally Composable Private Proximity Testing
General composition and universal composability in secure multiparty computation
Blockchains enable non-interactive MPC
Local Sequentiality Does Not Help for Concurrent Composition
Secure computation without authentication
On the enumeration of minimal non-pairwise compatibility graphs

This page was built for publication: Bounded-concurrent secure multi-party computation with a dishonest majority

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