scientific article
From MaRDI portal
Publication:2707598
zbMath0971.68049MaRDI QIDQ2707598
C. Pandu Rangan, Kannan Srinathan
Publication date: 8 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (9)
Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ Secure multi-party computation in large networks ⋮ Batch secret sharing for secure multi-party computation in asynchronous network ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ Secure message transmission in asynchronous networks ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Reducing communication costs in robust peer-to-peer networks ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Robust random number generation for peer-to-peer systems
This page was built for publication:
