View : 329 Download: 0
Oracle Indistinguishability and Its Applications
- Title
- Oracle Indistinguishability and Its Applications
- Authors
- Yun, Aaram
- Ewha Authors
- 윤아람
- SCOPUS Author ID
- 윤아람
- Issue Date
- 2023
- Journal Title
- IEEE ACCESS
- ISSN
- 2169-3536
- Citation
- IEEE ACCESS vol. 11, pp. 85640 - 85655
- Keywords
- Oracle indistinguishability; quantum security; classical security; pseudorandom functions; PRF; oracle security; NMAC; RC construction
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Indexed
- SCIE; SCOPUS
- Document Type
- Article
- Abstract
- There are many 'cascade-type' constructions in symmetric key cryptography. For these, the output of a PRF (or a block cipher) is cascaded to the key of the next PRF, and this continues until all blocks of the given message are exhausted. In order to prove the security of these constructions, traditionally multi-oracle families, together with query-based hybrid arguments are used, but these produce longer proofs which cannot be extended to quantum security. In this paper, we point that the oracle indistinguishability, first formalized by Zhandry and later extended by Song and Yun, is a useful tool for proving security of cascade-type constructions, both classically and quantumly. To illustrate this, using oracle indistinguishability, we give a classical security proof of NMAC. Also, we prove that the RC (Randomized Cascade) construction, which gives a PRF out of a weak PRF, is secure, both classically and quantumly.
- DOI
- 10.1109/ACCESS.2023.3303575
- Appears in Collections:
- 인공지능대학 > 사이버보안학과 > Journal papers
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML