Feb. 7, 2024, 5:10 a.m. | Quang Dao Aayush Jain

cs.CR updates on arXiv.org arxiv.org

Over the past few decades, we have seen a proliferation of advanced cryptographic primitives with lossy or homomorphic properties built from various assumptions such as Quadratic Residuosity, Decisional Diffie-Hellman, and Learning with Errors. These primitives imply hard problems in the complexity class $SZK$ (statistical zero-knowledge); as a consequence, they can only be based on assumptions that are broken in $BPP^{SZK}$. This poses a barrier for building advanced primitives from code-based assumptions, as the only known such assumption is Learning Parity …

advanced can class code complexity cryptographic cryptography cs.cc cs.cr cs.it diffie errors hard hellman imply knowledge lossy math.it problems proliferation

Privacy Engineer

@ Snap Inc. | Santa Monica - 2850 Ocean Park Blvd

Senior Security Researcher - Security Automation (Cortex)

@ Palo Alto Networks | Tel Aviv-Yafo, Israel

Information Systems Security Engineer (ISSE)

@ Interclypse | Annapolis Junction, MD, US

Information Systems Security Officer (ISSO)

@ Interclypse | Annapolis Junction, MD, US

Systems Security Engineer (Hybrid)

@ RTX | FL410: Largo FL MFG 7887 Bryan Dairy Road , Largo, FL, 33777 USA

Principal Cyber Security Engineer (Onsite)

@ RTX | HIA33: Cedar Rapids, IA (Intertrade) 400 Collins Road NE MS 153-220, Cedar Rapids, IA, 52411-6636 USA