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

DOI10.1145/1007352.1007393zbMath1192.68077OpenAlexW2064265141MaRDI QIDQ3580972

Rafael Pass

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

Mathematics Subject Classification ID

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

Related Items (38)

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

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