all InfoSec news
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments. (arXiv:2103.08975v2 [quant-ph] UPDATED)
Jan. 21, 2022, 2:20 a.m. | Ansis Rosmanis
cs.CR updates on arXiv.org arxiv.org
In his seminal work on recording quantum queries [Crypto 2019], Zhandry
studied interactions between quantum query algorithms and the quantum oracle
corresponding to random functions. Zhandry presented a framework for
interpreting various states in the quantum space of the oracle as databases of
the knowledge acquired by the algorithm and used that interpretation to provide
security proofs in post-quantum cryptography.
In this paper, we introduce a similar interpretation for the case when the
oracle corresponds to random permutations instead of …
More from arxiv.org / cs.CR updates on arXiv.org
One-shot Empirical Privacy Estimation for Federated Learning
1 day, 2 hours ago |
arxiv.org
Transferability Ranking of Adversarial Examples
1 day, 2 hours ago |
arxiv.org
A survey on hardware-based malware detection approaches
1 day, 2 hours ago |
arxiv.org
Explainable Ponzi Schemes Detection on Ethereum
1 day, 2 hours ago |
arxiv.org
Jobs in InfoSec / Cybersecurity
SOC 2 Manager, Audit and Certification
@ Deloitte | US and CA Multiple Locations
Information Security Engineers
@ D. E. Shaw Research | New York City
Junior Cybersecurity Triage Analyst
@ Peraton | Linthicum, MD, United States
Associate Director, Operations Compliance and Investigations Management
@ Legend Biotech | Raritan, New Jersey, United States
Analyst, Cyber Operations Engineer
@ BlackRock | SN6-Singapore - 20 Anson Road
Working Student/Intern/Thesis: Hardware based Cybersecurity Training (m/f/d)
@ AVL | Regensburg, DE