Theory of Cryptography

DOI10.1007/11681878zbMath1112.94023OpenAlexW3149533473WikidataQ57254512 ScholiaQ57254512MaRDI QIDQ5898361

Martin Hirt, Zuzana Beerliová-Trubíniová

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (18)

Fluid MPC: secure multiparty computation with dynamic participants ⋮ Honest majority MPC with abort with minimal online communication ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Secure message transmission in asynchronous networks ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited ⋮ Quantum private comparison protocol with five-particle cluster states ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ On the exact round complexity of secure three-party computation ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ An efficient passive-to-active compiler for honest-majority MPC over rings

This page was built for publication: Theory of Cryptography