all InfoSec news
Simple Soundness Proofs
Jan. 5, 2024, 10:36 a.m. |
IACR News www.iacr.org
ePrint Report: Simple Soundness Proofs
Alex Kampa
We present a general method to simplify soundness proofs under certain conditions. Given an adversary $\mathcal{A}$ able to break a scheme $S$ with non-negligible probability $t$, we define the concept of $\textit{trace}$ of a $\textit{winning configuration}$, which is already implicitly used in soundness proofs. If a scheme can be constructed that (1) takes a random configuration $e$, being the inputs and execution environment of $\mathcal{A}$, (2) "guesses" a trace, (3) modifies $e$ based …
adversary alex concept conditions configuration eprint report general non report simple simplify trace under winning
More from www.iacr.org / IACR News
Regev Factoring Beyond Fibonacci: Optimizing Prefactors
2 days, 11 hours ago |
www.iacr.org
NTRU-based FHE for Larger Key and Message Space
2 days, 12 hours ago |
www.iacr.org
Vision Mark-32: ZK-Friendly Hash Function Over Binary Tower Fields
2 days, 12 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Network Security Engineer
@ Meta | Menlo Park, CA | Remote, US
Security Engineer, Investigations - i3
@ Meta | Washington, DC
Threat Investigator- Security Analyst
@ Meta | Menlo Park, CA | Seattle, WA | Washington, DC
Security Operations Engineer II
@ Microsoft | Redmond, Washington, United States
Engineering -- Tech Risk -- Global Cyber Defense & Intelligence -- Bug Bounty -- Associate -- Dallas
@ Goldman Sachs | Dallas, Texas, United States