Fast and efficient perfectly secure network-agnostic secure computation
From MaRDI portal
Cites work
- \textsc{Tardigrade}: an atomic broadcast protocol for arbitrary network conditions
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Asynchronous byzantine agreement protocols
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Communication-efficient unconditional MPC with guaranteed output delivery
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Efficient perfectly secure computation with optimal resilience
- General secure multi-party computation from any linear secret-sharing scheme
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- scientific article; zbMATH DE number 1759772 (Why is no real title available?)
- Title not available (Why is no real title available?)
- Network agnostic MPC with statistical security
- Network-agnostic security comes (almost) for free in DKG and MPC
- Perfect asynchronous MPC with linear communication overhead
- Perfectly-Secure MPC with Linear Communication Complexity
- Perfectly-secure multiplication for any \(t < n/3\)
- Perfectly-secure synchronous MPC with asynchronous fallback guarantees
- Perfectly-Secure Synchronous MPC with Asynchronous Fallback Guarantees
- Probabilistic termination and composability of cryptographic protocols
- Revisiting asynchronous fault tolerant computation with optimal resilience
- Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback
- Scalable and Unconditionally Secure Multiparty Computation
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- State machine replication under changing network conditions
- Synchronous consensus with optimal asynchronous fallback guarantees
- Universally composable security: a new paradigm for cryptographic protocols
- Universally composable synchronous computation
This page was built for publication: Fast and efficient perfectly secure network-agnostic secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299818)
