Verifiable computation in multiparty protocols with honest majority

DOI10.1007/978-3-319-12475-9_11zbMATH Open1368.94109OpenAlexW143108255MaRDI QIDQ2948147FDOQ2948147

Authors: Peeter Laud, Alisa Pankova 

Publication date: 29 September 2015

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12475-9_11

Recommendations

• Efficient compiler to covert security with public verifiability for honest majority MPC
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Universally verifiable multiparty computation from threshold homomorphic cryptosystems
• Efficient Two Party and Multi Party Computation Against Covert Adversaries

zbMATH Keywords

secure multiparty computationverifiable computationlinear PCP

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14)

Cited In (15)

• Collusion-Free Multiparty Computation in the Mediated Model
• Committed MPC -- maliciously secure multiparty computation from homomorphic commitments
• Robust multiparty computation with faster verification time
• Efficient compiler to covert security with public verifiability for honest majority MPC
• Title not available (Why is that?)
• Proactive secure multiparty computation with a dishonest majority
• More efficient dishonest majority secure computation over \(\mathbb{Z}_{2^k}\) via Galois rings
• Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender
• Title not available (Why is that?)
• Realizable Rational Multiparty Cryptographic Protocols
• Function-Dependent Commitments for Verifiable Multi-party Computation
• Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
• Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
• Verifiable partial escrow of integer factors.
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

This page was built for publication: Verifiable computation in multiparty protocols with honest majority

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