all InfoSec news
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
Nov. 7, 2022, 12:18 a.m. |
IACR News www.iacr.org
ePrint Report: On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness
Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra
A multiparty computation protocol is {\em perfectly secure} for some function $f$ if it perfectly emulates an ideal computation of $f$. Thus, perfect security is the strongest and most desirable notion of security, as it guarantees security in the face of any adversary and eliminates the dependency on any security parameter. Ben-Or et al. [STOC '88] and …
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
1 day, 8 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
1 day, 8 hours ago |
www.iacr.org
Improving Generic Attacks Using Exceptional Functions
1 day, 8 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
2 days, 12 hours ago |
www.iacr.org
A Variation on Knellwolf and Meier's Attack on the Knapsack Generator
2 days, 12 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
Cyber Consultant
@ Frazer-Nash Consultancy | Gloucester, England, United Kingdom
Senior Vulnerability Management Reporting & Analytics Developer
@ Baker Hughes | IN-KA-BANGALORE-NEON BUILDING WEST TOWER
Product Security Architect
@ ChargePoint | Italy