src_e53adb99e40ae66258
- Source-provided label
- Not reported
- Evidence class
- mentioned in report
- Confidence
- Not reported
- Observed
- Oct 04, 2026 21:24 UTC
- Retrieved
- Oct 08, 2026 03:46 UTC
ePrint Report: Breaking the $n^2$ Barrier: Information-Theoretic MPC with Sub-Quadratic Communication Alexander Bienstock, Yuval Efron, Kevin Yeo Secure multi-party computation (MPC) considers the problem of securely computing a function across $n$ parties such that no adversary controlling $t$ corrupted parties may learn any additional information beyond the function output. For information-theor
Breaking the $n^2$ Barrier: Information-Theoretic MPC with Sub-Quadratic Communicationf870020dc1e13b1c47e540515582101ffa700d6087c4b70d58666e06bc318391Network indicators are visibly defanged. This page does not make them clickable or send them to another service.
No validated file hashes or network indicators are stored for this record.
This record contains metadata and attribution only. It does not host, download, unpack, render, or execute malware samples.
Sources represented on this page. Publication and observation dates describe the content; successful batch dates describe local collection. A recent batch does not certify complete coverage or current provider availability.
1 sources: 0 stale, 0 needing attention, 0 paused, 1 unverified.
Stale means older than twice the recorded collection interval, with a minimum of one hour; without an interval, the threshold is 24 hours. Cached content remains available while a feed is stale, paused, or unverified.