Bounded-concurrent secure multi-party computation with a dishonest majority
From MaRDI portal
(Redirected from Publication:3580972)
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
Cited in
(58)- Private multiparty sampling and approximation of vector combinations
- General composition and universal composability in secure multiparty computation
- Unbounded ABE via bilinear entropy expansion, revisited
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
- Proactive secure multiparty computation with a dishonest majority
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
- Post-quantum multi-party computation
- Efficient constant-round MPC with identifiable abort and public verifiability
- Black-box constructions of bounded-concurrent secure computation
- On the concurrent composition of quantum zero-knowledge
- Game-theoretic fairness meets multi-party protocols: the case of leader election
- Secure multiparty computation in the bounded storage model
- Round-optimal and communication-efficient multiparty computation
- 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 multi-party computation combining BMR and SPDZ
- Lower bounds and impossibility results for concurrent self composition
- Protocols for multiparty coin toss with a dishonest majority
- Blockchains enable non-interactive MPC
- Non-black-box simulation from one-way functions and applications to resettable security
- Network-Hiding Communication and Applications to Multi-party Protocols
- Concurrent non-malleable commitments (and more) in 3 rounds
- Constant-round concurrent zero knowledge in the bounded player model
- Dishonest majority multi-party computation for binary circuits
- Concurrently secure computation in constant rounds
- Universally composable private proximity testing
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Concurrent secure computation with optimal query complexity
- Bounded-concurrent secure two-party computation without setup assumptions
- Protocols for bounded-concurrent secure two-party computation in the plain model
- Local Sequentiality Does Not Help for Concurrent Composition
- Concurrent zero knowledge in the bounded player model
- Cryptography using \texttt{CAPTCHA} puzzles
- On concurrently secure computation in the multiple ideal query model
- An Algebraic Approach to Nonmalleability
- The Complexity of Zero Knowledge
- How to obtain full privacy in auctions
- Constant-Round Nonmalleable Commitments from Any One-Way Function
- On the exact round complexity of self-composable two-party computation
- Magic adversaries versus individual reduction: science wins either way
- On the enumeration of minimal non-pairwise compatibility graphs
- Round-optimal secure multi-party computation
- \(\log^\ast\)-round game-theoretically-fair leader election
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- 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
- Game-theoretically secure protocols for the ordinal random assignment problem
- Secure computation without authentication
- Two-round concurrent 2PC from sub-exponential LWE
- Improved black-box constructions of composable secure computation
- Universally composable SNARKs with transparent setup without programmable random oracle
- The round complexity of black-box post-quantum secure computation
- Fair coin flipping: tighter analysis and the many-party case
- Black-box constant-round secure 2PC with succinct communication
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Is it even possible? On the parallel composition of asynchronous MPC protocols
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)
