Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Exploring the boundaries of topology-hiding computation

From MaRDI portal
Publication:1653090
Jump to:navigation, search

DOI10.1007/978-3-319-78372-7_10zbMath1415.94405OpenAlexW2794449410MaRDI QIDQ1653090

Marshall Ball, Tal Moran, Tal Malkin, Elette Boyle

Publication date: 17 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78372-7_10



Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (7)

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







This page was built for publication: Exploring the boundaries of topology-hiding computation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1653090&oldid=13964792"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki