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
Jobs in InfoSec / Cybersecurity
Azure Security Architect
@ First Quality | Remote US - Eastern or Central Timezone
Cyber Security Principal Consultant
@ Capco | New York City
Information Security Engineers
@ D. E. Shaw Research | New York City
Associate, IT Security Incident Response
@ EBRD | London, GB
Data Privacy Officer (4년 이상, 제약/화학 산업군, 서울 근무)
@ Merck Group | Seoul, Seoul, KR, 06178
GN- Industry Strategy- Health Strategy - Consultant
@ Accenture | Bengaluru, BDC7A