Network-Hiding Communication and Applications to Multi-party Protocols
From MaRDI portal
Publication:2829220
DOI10.1007/978-3-662-53008-5_12zbMath1391.94759OpenAlexW2478434674MaRDI QIDQ2829220
Daniel Tschudi, Ueli M. Maurer, Vassilis Zikas, Martin Hirt
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Network protocols (68M12)
Related Items
Topology-hiding computation beyond semi-honest adversaries, Is information-theoretic topology-hiding computation possible?, Correction to: ``Topology-hiding communication from minimal assumptions, Towards practical topology-hiding computation, Must the communication graph of MPC protocols be an expander?, Topology-hiding computation on all graphs, Topology-hiding computation for networks with unknown delays, Network-Hiding Communication and Applications to Multi-party Protocols, Topology-Hiding Computation Beyond Logarithmic Diameter
Cites Work
- Almost-everywhere secure computation with edge corruptions
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Communications in unknown networks: preserving the secret of topology
- Network-Hiding Communication and Applications to Multi-party Protocols
- Fast and unconditionally secure anonymous channel
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- The Hidden Graph Model
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Scalable leader election
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Foundations of Cryptography
- Communication Locality in Secure Multi-party Computation
- Breaking the O ( n 2 ) bit barrier
- Topology-Hiding Computation
- Advances in Cryptology - EUROCRYPT 2004
- Almost-Everywhere Secure Computation