Topology-hiding computation beyond semi-honest adversaries
From MaRDI portal
Publication:1631311
DOI10.1007/978-3-030-03810-6_1zbMath1430.94078OpenAlexW2795256152MaRDI QIDQ1631311
Chen-Da Liu-Zhang, Rio LaVigne, Tal Moran, Daniel Tschudi, Marta Mularczyk, Ueli M. Maurer
Publication date: 6 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03810-6_1
Related Items (6)
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 ⋮ Topology-hiding computation on all graphs ⋮ Topology-hiding computation for networks with unknown delays
Cites Work
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Topology-hiding computation beyond semi-honest adversaries
- Exploring the boundaries of topology-hiding computation
- Communications in unknown networks: preserving the secret of topology
- Network-Hiding Communication and Applications to Multi-party Protocols
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Perfectly secure message transmission
- Topology-Hiding Computation
- Obfuscation of Probabilistic Circuits and Applications
- Topology-Hiding Computation Beyond Logarithmic Diameter
- Advances in Cryptology - EUROCRYPT 2004
- On lattices, learning with errors, random linear codes, and cryptography
- Topology-hiding computation on all graphs
This page was built for publication: Topology-hiding computation beyond semi-honest adversaries
