In this work, we demonstrate the first concurrently composable SPS-NISC. Our construction assumes the existence of:
– a non-interactive (weakly) CCA-secure commitment,
– a stand-alone secure SPS-NISC with subexponential security,
and satisfies the notion of “angel-based” UC security (i.e., UC with a superpolynomial-time helper) with perfect correctness.
We additionally demonstrate that both of the primitives we use (albeit only with polynomial security) are necessary for such concurrently composable SPS-NISC with perfect correctness. As such, our work identifies essentially necessary and sufficient primitives for concurrently composable SPS-NISC with perfect correctness in the plain model.
Intel Owl v4.2.3 releases: analyze files, domains, IPs in multiple ways
sliver v1.5.36 releases: general purpose cross-platform implant framework
NETworkManager v2023.3.26 releases: managing networks/troubleshoot network problems