Network-Hiding Communication and Applications to Multi-party Protocols

DOI10.1007/978-3-662-53008-5_12MaRDI QIDQ2829220zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Network protocols (68M12) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• Topology-hiding communication from minimal assumptions
• Network oblivious transfer
• Secure Network Coding on a Wiretap Network

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• Advances in Cryptology - EUROCRYPT 2004
• Almost-Everywhere Secure Computation
• Almost-everywhere secure computation with edge corruptions
• Bounded-concurrent secure multi-party computation with a dishonest majority
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• Communication Locality in Secure Multi-party Computation
• Communications in unknown networks: preserving the secret of topology
• Fast and unconditionally secure anonymous channel
• Foundations of Cryptography
• Network-Hiding Communication and Applications to Multi-party Protocols
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Scalable leader election
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The hidden graph model: communication locality and optimal resiliency with adaptive faults
• Topology-hiding computation

Cited in

(15)

• Topology-hiding computation beyond semi-honest adversaries
• Stealthy protocols: metrics and open problems
• Topology-hiding computation for networks with unknown delays
• Is information-theoretic topology-hiding computation possible?
• Network-Hiding Communication and Applications to Multi-party Protocols
• scientific article; zbMATH DE number 2011627 (Why is no real title available?)
• Topology-hiding computation
• Topology-hiding computation beyond logarithmic diameter
• Topology-hiding computation on all graphs
• Correction to: ``Topology-hiding communication from minimal assumptions
• Must the communication graph of MPC protocols be an expander?
• Towards practical topology-hiding computation
• Towards topology-hiding computation from oblivious transfer
• Information-theoretic topology-hiding broadcast: wheels, stars, friendship, and beyond
• Maintaining sublinear locality over time: adaptively secure MPC on a reusable hidden graph

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)