Secure multi-party computation without agreement
From MaRDI portal
Publication:2501711
DOI10.1007/s00145-005-0319-zzbMath1102.68472OpenAlexW2064829080MaRDI QIDQ2501711
Publication date: 12 September 2006
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-005-0319-z
Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (35)
Secure Computation, I/O-Efficient Algorithms and Distributed Signatures ⋮ Two attacks on rank metric code-based schemes: RankSign and an IBE scheme ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Secure Computation with Minimal Interaction, Revisited ⋮ Synchronous consensus with optimal asynchronous fallback guarantees ⋮ On fully secure MPC with solitary output ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ \textsc{SuperPack}: dishonest majority MPC with constant online communication ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ High-throughput secure three-party computation with an honest majority ⋮ Non-interactive zero-knowledge proofs to multiple verifiers ⋮ Fairness versus guaranteed output delivery in secure multiparty computation ⋮ Completeness theorems for adaptively secure broadcast ⋮ Secure computation with low communication from cross-checking ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Resource fairness and composability of cryptographic protocols ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Efficient, actively secure MPC with a dishonest majority: a survey ⋮ Symmetric cryptographic solution to Yao's millionaires' problem and an evaluation of secure multiparty computations ⋮ Characterization of secure multiparty computation without broadcast ⋮ High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ From fairness to full security in multiparty computation ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Legally-Enforceable Fairness in Secure Two-Party Computation ⋮ Low cost constant round MPC combining BMR and oblivious transfer ⋮ Cryptography in the multi-string model ⋮ General composition and universal composability in secure multiparty computation ⋮ Probabilistic Termination and Composability of Cryptographic Protocols ⋮ Probabilistic termination and composability of cryptographic protocols ⋮ Multiparty generation of an RSA modulus ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings ⋮ Broadcast-optimal two-round MPC
This page was built for publication: Secure multi-party computation without agreement
