all InfoSec news
Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity
May 11, 2023, 5:48 p.m. |
IACR News www.iacr.org
ePrint Report: Unconditionally Secure Multiparty Computation for Symmetric Functions with Low Bottleneck Complexity
Reo Eriguchi
Bottleneck complexity is an efficiency measure of secure multiparty computation (MPC) introduced by Boyle et al. (ICALP 2018) to achieve load-balancing. Roughly speaking, it is defined as the maximum communication complexity required by any player within the protocol execution. Since it is impossible to achieve sublinear bottleneck complexity in the number of players $n$ for all functions, a prior work constructed MPC protocols with low …
communication complexity computation defined efficiency eprint report functions low measure mpc report secure multiparty computation speaking symmetric
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
1 day, 19 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
1 day, 19 hours ago |
www.iacr.org
Improving Generic Attacks Using Exceptional Functions
1 day, 19 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
2 days, 23 hours ago |
www.iacr.org
A Variation on Knellwolf and Meier's Attack on the Knapsack Generator
2 days, 23 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist II: Network Architect
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Engineering Manager - Cloud Security team
@ SentinelOne | Prague, Czech Republic
Legal & Compliance Apprentice (H/F)
@ Novo Nordisk | Puteaux, Île-de-France, FR
Manager, Governance Risk & Compliance
@ Comcast | Virtual