Towards topology-hiding computation from oblivious transfer

DOI10.1007/978-3-031-48615-9_13zbMATH Open1544.94223MaRDI QIDQ6581794

Alexander Bienstock, Pierre-Jean Meyer, Marshall Ball, Lisa Kohl

Publication date: 1 August 2024

zbMATH Keywords

all-but-one semi-honest corruptionslocally simulatable MPC

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Topology-hiding computation beyond semi-honest adversaries
• Exploring the boundaries of topology-hiding computation
• Security and composition of multiparty cryptographic protocols
• Two-round oblivious transfer from CDH or LPN
• Topology-hiding communication from minimal assumptions
• Is information-theoretic topology-hiding computation possible?
• Network-Hiding Communication and Applications to Multi-party Protocols
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
• Candidate One-Way Functions Based on Expander Graphs
• Topology-Hiding Computation
• Topology-Hiding Computation Beyond Logarithmic Diameter
• Universally Composable Oblivious Transfer Based on a Variant of LPN
• Topology-hiding computation on all graphs
• Topology-hiding computation on all graphs
• Towards practical topology-hiding computation

This page was built for publication: Towards topology-hiding computation from oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581794)