scientific article; zbMATH DE number 1304080
From MaRDI portal
Publication:4250770
zbMath0931.94019MaRDI QIDQ4250770
Stefan Dziembowski, Ronald Cramer, Tal Rabin, Martin Hirt, Ivan B. Damgård
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
error probabilityverifiable secret sharingmultiparty computationbroadcast channelsecure-channels modelweak secret sharing
Related Items (36)
Adaptively secure distributed PRFs from LWE ⋮ Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Secure Protocols with Asymmetric Trust ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Building blocks of sharding blockchain systems: concepts, approaches, and open problems ⋮ \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation ⋮ Perfect MPC over layered graphs ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Adaptively Secure Non-interactive Threshold Cryptosystems ⋮ Asynchronous Byzantine agreement with optimal resilience ⋮ Secure multi-party computation made simple ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Computations with a deck of cards ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Efficient Simultaneous Broadcast ⋮ On the exact round complexity of secure three-party computation ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Secure Protocol Transformations ⋮ A Single Initialization Server for Multi-party Cryptography ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ Guaranteed output delivery comes free in honest majority MPC ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback ⋮ Dynamic threshold secret reconstruction and its application to the threshold cryptography ⋮ Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
This page was built for publication:
