all InfoSec news
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography
Dec. 11, 2023, 1:42 a.m. |
IACR News www.iacr.org
ePrint Report: Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography
Yilei Chen, Jiatu Li
A recent line of research has introduced a systematic approach to explore the complexity of explicit construction problems through the use of meta problems, namely, the range avoidance problem (abbrev. $\textsf{Avoid}$) and the remote point problem (abbrev. $\textsf{RPP}$). The upper and lower bounds for these meta problems provide a unified perspective on the complexity of specific explicit construction problems that were previously …
chen complexity construction cryptography eprint report explicit meta point problem problems report research restricted
More from www.iacr.org / IACR News
Information-theoretic security with asymmetries
2 days, 3 hours ago |
www.iacr.org
Cryptanalytic Audit of the XHash Sponge Function and its Components
2 days, 4 hours ago |
www.iacr.org
Ipotane: Achieving the Best of All Worlds in Asynchronous BFT
2 days, 4 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Security Cyber Risk Analyst
@ Intel | USA - AZ - Chandler
Senior Cloud Security Engineer (Fullstack)
@ Grab | Petaling Jaya, Malaysia
Principal Product Security Engineer
@ Oracle | United States
Cybersecurity Strategy Director
@ Proofpoint | Sunnyvale, CA
Information Security Consultant/Auditor
@ Devoteam | Lisboa, Portugal
IT Security Engineer til Netcompany IT Services
@ Netcompany | Copenhagen, Denmark