Artikler jeg ønsker å lese, foreløpig ikke knyttet til noe prosjekt, men til inspirasjon for mulige fremtidige prosjekter eller for å tilegne meg nye verktøy i verktøykassen. Når lest, legg til i [[Input]], ekstraher lærdommer til [[Eviggrønne notater]], og slett fra listen. - [ ] #to-do 💻 Gjør kompatibel med [[Inputliste]] #### [Founding Quantum Cryptography on Quantum Advantage or, Towards Cryptography from (sharp)P-Hardness](https://eprint.iacr.org/2024/1490.pdf) Huh. - [ ] #to-do 🏢 Print booklet av [Founding Quantum Cryptography on Quantum Advantage or, Towards Cryptography from (sharp)P-Hardness](https://eprint.iacr.org/2024/1490.pdf) #### [Robert Huang (talk) – What cannot be learned in the Quantum Universe?](https://www.youtube.com/watch?v=sDka3e6DXOY) De trykket på "made for kids", så går ikke an å lagre den i spillelister... #### [Quantum cryptography with classical communication](https://arxiv.org/pdf/2201.13445) Høres relevant ut til [[Gemini Quantum Communication and Security Track]]. #### [Bellare, Riepel, Tessaro et al. – Count Corruptions, Not Users: Improved Tightness for Signatures, Encryption and Authenticated Key Exchange](https://eprint.iacr.org/2024/1258.pdf) Veldig relevant til noe av mitt arbeid, dette. #### [Consider the ethical impacts of quantum technologies in defence — before it’s too late](https://www.nature.com/articles/d41586-024-03376-4) Paywalled; access via NTNU? #### [Zero-Knowledge Proofs of Quantumness](https://eprint.iacr.org/2025/100) Interessant? Enda en protokoll som havner innunder [[Gemini Quantum Communication and Security Track]]s paraply i så fall. #### [Security of quantum position-verification limits Hamiltonian simulation via holography](https://arxiv.org/pdf/2401.09058) Er det noe interessant her? #### [Brassard et al. – Quantum Pseudo-Telepathy](https://arxiv.org/pdf/quant-ph/0407221) Inkluderer "The Magic Square Game", som ikke har en klassisk vinnende strategi (men en kvantisk en!). - [ ] #to-do 🏢 Print booklet av [Brassard et al. – Quantum Pseudo-Telepathy](https://arxiv.org/pdf/quant-ph/0407221) #### [Huang, Preskill et al.'23 – Local Minima in Quantum Systems](https://arxiv.org/pdf/2309.16596) Den mer "naturlige" varianten av ground state finding. De viser en eksponensiall separasjon mellom klassisk kompleksitet og kvantekompleksitet. - [ ] #to-do 🏢 Print booklet av [Huang, Preskill et al.'23 – Local Minima in Quantum Systems](https://arxiv.org/pdf/2309.16596) #### [A Black-box Attack on Fixed-Unitary Quantum Encryption Schemes](https://eprint.iacr.org/2024/511.pdf) - [ ] #to-do 🏢 Print booklet av [A Black-box Attack on Fixed-Unitary Quantum Encryption Schemes](https://eprint.iacr.org/2024/511.pdf) #### [Kahanamoku-Meyer, Ragavan, Vaikuntanathan, Van Kirk'24: The Jacobi Factoring Circuit](https://eprint.iacr.org/2024/2034.pdf) - [ ] #to-do 🏢 Print booklet av [Kahanamoku-Meyer, Ragavan, Vaikuntanathan, Van Kirk'24: The Jacobi Factoring Circuit](https://eprint.iacr.org/2024/2034.pdf) #### [Majenz, Malavolta, Walter'24 (kvantepermutasjoner)](https://eprint.iacr.org/2024/1140.pdf) - [ ] #to-do 🏢 Print booklet av [Majenz, Malavolta, Walter'24 (kvantepermutasjoner)](https://eprint.iacr.org/2024/1140.pdf) #### [12 012 – Fowler, Stephens, Groszkowski: High threshold universal quantum computation on the surface code](https://arxiv.org/pdf/0803.0272) #### [C'24 – Chung, Goldin, Gray: On Central Primitives for Quantum Cryptography with Classical Communication](https://eprint.iacr.org/2024/356) - [ ] #to-do 🏢 Print booklet av [C'24 – Chung, Goldin, Gray: On Central Primitives for Quantum Cryptography with Classical Communication](https://eprint.iacr.org/2024/356) #### [Ekerå og Gärtner: A high-level comparison of state-of-the-art quantum algorithms for breaking asymmetric cryptography](https://arxiv.org/pdf/2405.14381) #### [TCC:LomMooQuaWic22 – Post-Quantum insecurity from LWE](https://eprint.iacr.org/2022/869) Denne tror jeg blir viktig å forstå, *spesielt siden jeg selv har holdt det nevnte "folklore belief" frem til nå!* > ##### Abstract (emphasis mine) > We show that for many fundamental cryptographic primitives, proving classical security under the learning-with-errors (LWE) assumption, does not imply post-quantum security. This is despite the fact that LWE is widely believed to be post-quantum secure, and our work does not give any evidence otherwise. Instead, it shows that post-quantum insecurity can arise inside cryptographic constructions, even if the assumptions are post-quantum secure. > > Concretely, our work provides (contrived) constructions of pseudorandom functions, CPA-secure symmetric-key encryption, message-authentication codes, signatures, and CCA-secure public-key encryption schemes, all of which are proven to be classically secure under LWE via black-box reductions, but demonstrably fail to be post-quantum secure. All of these cryptosystems are stateless and non-interactive, but their security is defined via an interactive game that allows the attacker to make oracle queries to the cryptosystem. The polynomial-time quantum attacker can break these schemes by only making a few classical queries to the cryptosystem, and in some cases, a single query suffices. > > Previously, we only had examples of post-quantum insecurity under post-quantum assumptions for stateful/interactive protocols. **Moreover, there appears to be a folklore belief that for stateless/non-interactive cryptosystems with black-box proofs of security, a quantum attack against the scheme should translate into a quantum attack on the assumption. This work shows otherwise.** Our main technique is to carefully embed interactive protocols inside the interactive security games of the above primitives. > > As a result of independent interest, we also show a 3-round quantum disclosure of secrets (QDS) protocol between a classical sender and a receiver, where a quantum receiver learns a secret message in the third round but, assuming LWE, a classical receiver does not. #### [EPRINT:VasKahMck - Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era](https://eprint.iacr.org/2023/1293): > The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian simple groups to cryptography and discuss different scenarios in which this theory is clearly central, providing the relevant definitions to make the material accessible to both cryptographers and group theorists, in the hope of stimulating further interaction between these two (non-disjoint) communities. In particular, we look at constructions based on various group-theoretic factorization problems, review group theoretical hash functions, and discuss fully homomorphic encryption using simple groups. The Hidden Subgroup Problem is also briefly discussed in this context. #### [NSBU18 - Adaptive Attack on Wiesner's Quantum Money](https://arxiv.org/pdf/1404.1507.pdf) > (...) We show efficient adaptive attacks on Wiesner’s quantum money scheme [Wie83] (and its variant by Bennett et al. [BBBW83]), when valid money is accepted and passed on, while invalid money is destroyed. We propose two attacks, the first is inspired by the Elitzur-Vaidman bomb testing problem [EV93, KWH+95], while the second is based on the idea of protective measurements [AAV93]. It allows us to break Wiesner’s scheme with 4 possible states per qubit, and generalizations which use more than 4 states per qubit. The attack shows that Wiesner’s scheme can only be safe if the bank replaces valid notes after validation. [[Scott Aaronson]] [sier](https://scottaaronson.blog/?p=7569): > An application of the [[Elitzur-Vaidman bomb tester]] so simple and beautiful that I teach it in my undergrad Intro to Quantum Information Science class. #### [STOC:BQSY24 - An efficient quantum parallel repetition theorem and applications](https://eprint.iacr.org/2023/1783) > (...) As immediate applications, we show how to derive hardness amplification theorems for quantum bit commitment schemes (answering a question of Yan [Yan22]), EFI pairs (answering a question of Brakerski, Canetti, and Qian [BCQ23]), public-key quantum money schemes (answering a question of Aaronson and Christiano [AC13]), and quantum zero-knowledge argument systems. We also derive an XOR lemma [Yao82] for quantum predicates as a corollary. Hva er "quantum zero-knowledge arguments"?