Network-Hiding Communication and Applications to Multi-party Protocols
DOI10.1007/978-3-662-53008-5_12zbMATH Open1391.94759OpenAlexW2478434674MaRDI QIDQ2829220FDOQ2829220
Authors: Martin Hirt, Ueli M. Maurer, Daniel Tschudi, Vassilis Zikas 
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_12
Recommendations
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network protocols (68M12)
Cites Work
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Almost-Everywhere Secure Computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Advances in Cryptology - EUROCRYPT 2004
- Scalable leader election
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Almost-everywhere secure computation with edge corruptions
- Communications in unknown networks: preserving the secret of topology
- Network-Hiding Communication and Applications to Multi-party Protocols
- Topology-hiding computation
- The hidden graph model: communication locality and optimal resiliency with adaptive faults
- Communication Locality in Secure Multi-party Computation
- Fast and unconditionally secure anonymous channel
Cited In (13)
- Towards topology-hiding computation from oblivious transfer
- Title not available (Why is that?)
- Topology-hiding computation beyond semi-honest adversaries
- Topology-hiding computation
- Topology-hiding computation beyond logarithmic diameter
- Network-Hiding Communication and Applications to Multi-party Protocols
- Topology-hiding computation on all graphs
- Topology-hiding computation for networks with unknown delays
- Is information-theoretic topology-hiding computation possible?
- Must the communication graph of MPC protocols be an expander?
- Correction to: ``Topology-hiding communication from minimal assumptions
- Towards practical topology-hiding computation
- Stealthy protocols: metrics and open problems
This page was built for publication: Network-Hiding Communication and Applications to Multi-party Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829220)
