all InfoSec news
Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus
March 1, 2024, 3:06 a.m. |
IACR News www.iacr.org
ePrint Report: Perfectly-Secure Multiparty Computation with Linear Communication Complexity over Any Modulus
Daniel Escudero, Yifan Song, Wenhao Wang
Consider the task of secure multiparty computation (MPC) among $n$ parties with perfect security and guaranteed output delivery, supporting $t
In this work we provide an MPC protocol in this setting: perfect security, G.O.D. and $t
communication complexity computation daniel delivery eprint report linear mpc perfect protocol report secure multiparty computation security song task wang work
More from www.iacr.org / IACR News
Compact Key Storage: A Modern Approach to Key Backup and Delegation
1 day, 19 hours ago |
www.iacr.org
Quantum Evolving Secret Sharing for General Access Structures
1 day, 19 hours ago |
www.iacr.org
Preliminary Analysis of Ascon-Xof and Ascon-Hash
1 day, 19 hours ago |
www.iacr.org
PhD Student in Cryptography
1 day, 23 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
CyberSOC Technical Lead
@ Integrity360 | Sandyford, Dublin, Ireland
Cyber Security Strategy Consultant
@ Capco | New York City
Cyber Security Senior Consultant
@ Capco | Chicago, IL
Senior Security Researcher - Linux MacOS EDR (Cortex)
@ Palo Alto Networks | Tel Aviv-Yafo, Israel
Sr. Manager, NetSec GTM Programs
@ Palo Alto Networks | Santa Clara, CA, United States
SOC Analyst I
@ Fortress Security Risk Management | Cleveland, OH, United States