- [ ] The quantum-accessible random oracle model. Bringer [[Random Oracle Model]] inn i [[Kvanteuniverset]], introdusert i [AC'11: Boneh, Dadelen, Fischlin, Lehman, Schaffner, Zhandry – Random Oracles in a Quantum World](https://eprint.iacr.org/2010/428). ### Relevante prosjekter - [[Linear extractability]] - [[PQ-NCE and SIMstar]] - [[PRNGs in the QROM]] - [[The QRO Toolbox]] ### Teknikker - Pre-image awareness - [[The Compressed-Oracle Technique]] - Adaptive reprogramming - [[One-way to hiding]] - [[Semi-classical O2H]] - [[Measure-rewind-measure]] - [[The adaptive reprogramming framework]] - [[The resampling lemma]] - [[The computational adaptive reprogramming framework]] - [[The reprogramming lemma]] - [[Quantum Rewinding]] - [[Measure-and-reprogram]] - [[QRO Lifting Theorem]] ### Litteratur ##### Learning material - Mark Zhandry's tutorial at the [11th BIU winter school on cryptography](http://cyber.biu.ac.il/event/the-11th-biu-winter-school-on-cryptography/) - Kathrin Hövelmanns at Quiques'21: [The One-way to Hiding Lemma](https://www.youtube.com/watch?v=KsEqyUmA46o) ##### Separations - [[Yamakawa-Zhandry]] - [Simons Institute talk](https://www.youtube.com/watch?v=sKqhWutmIuA) - [[Non-uniformity and Quantum Advice in the Quantum Random Oracle Model]] - [C:BitBraKal22 – Constructive Post-Quantum Reductions](https://eprint.iacr.org/2022/298) - [PKC:PanZen23 – Selective Opening Security in the Quantum Random Oracle Model, Revisited](https://eprint.iacr.org/2023/1682) - **Diskusjon med Jiaxin 12024-04-14:** - Dette paperet (som faktisk er det første han og Runzhi gjorde sammen) inkluderer et Lemma som er sterkere enn [[The resampling lemma]], fordi de trenger ikke statistisk distanse mellom punktene som skal programmeres, men det holder med computational indistinguishability. (Ble [senere](https://eprint.iacr.org/2024/797) vist ekvivalent med [[Semi-classical O2H]] av Joseph.) - De har også en tightness teknikk hvor de bruker [[Learning with errors]]-assumption til å bytte ut parametrene slik at alle nøklene blir lossy, og da kan [[One-way to hiding]] anvendes på et statistisk term, så man bare trenger å ta square root på et statistisk term. - MEN [[Chens algoritme]] kan bryte dette?? ("If Chen's algorithm is correct I think we have bigger things to worry about." – Jiaxin) - Sistnevnte teknikk blir brukt både i deres PKC’24 og [AC’23](https://eprint.iacr.org/2023/1380) paper. ##### Tightness - [EC:SaiXagYam18 – Tightly-Secure Key-Encapsulation Mechanism in the Quantum Random Oracle Model](https://eprint.iacr.org/2017/1005) - [AC:JiaZhaMa21 – On the Non-tightness of Measurement-Based Reductions for Key Encapsulation Mechanism in the Quantum Random Oracle Model](https://eprint.iacr.org/2019/494) - [PQCRYPTO:JiaZhaMa19 – Tighter Security Proofs for Generic Key Encapsulation Mechanism in the Quantum Random Oracle Model](https://eprint.iacr.org/2019/134) ##### Classical ROM - Fischlin, Lehmann, Ristenpart, Shrimton, Stam, Tessaro: [AC:FLRSST10 – Random Oracles With(out) Programmability](https://rist.tech.cornell.edu/papers/npro.pdf)