Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
From MaRDI portal
Cites work
- A full proof of the BGW protocol for perfectly secure multiparty computation
- Adaptive security, erasures, and network assumptions in communication-local MPC
- Adaptive versus Static Security in the UC Model
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Breaking the O(√ n)-Bit Barrier
- Communication Complexity of Byzantine Agreement, Revisited
- Communication Locality in Secure Multi-party Computation
- Completeness theorems for adaptively secure broadcast
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Easy impossibility proofs for distributed consensus problems
- Edge Fault Tolerance on Sparse Networks
- Foundations of Cryptography
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- Information-theoretic topology-hiding broadcast: wheels, stars, friendship, and beyond
- Is information-theoretic topology-hiding computation possible?
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Leader election with poly-logarithmic communication per party
- Must the communication graph of MPC protocols be an expander?
- Network-Hiding Communication and Applications to Multi-party Protocols
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Scalable leader election
- Secure multi-party computation in large networks
- Security and composition of multiparty cryptographic protocols
- Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW
- The Byzantine generals strike again
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- Topology-hiding communication from minimal assumptions
- Topology-hiding computation
- Topology-hiding computation beyond logarithmic diameter
- Topology-hiding computation on all graphs
- Towards topology-hiding computation from oblivious transfer
- Universally composable security: a new paradigm for cryptographic protocols
- Universally composable two-party and multi-party secure computation
This page was built for publication: Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7299833)
