Linked e-resources
Details
Table of Contents
Intro
Preface
Organization
Contents
Quantum Cryptography
Tight Bounds for Simon's Algorithm
1 Introduction
2 Amplitude Amplification
3 Simon's Algorithm
3.1 Algorithm Description
3.2 Analysis with Periodic Permutations
3.3 Limitations of Simon's Algorithm
3.4 A General Criterion
3.5 With Random Functions
4 Exact Variant of Simon's Algorithm
4.1 The Algorithm of Brassard and Høyer
4.2 Our Improved Variant
5 Grover-meets-Simon
5.1 Algorithm Description
5.2 Cost Analysis
6 The Offline Simon's Algorithm
6.1 Algorithm Description
6.2 Cost Analysis
7 Applications in Cryptanalysis
7.1 Landscape of Known Simon-Based Attacks
7.2 Cost Estimates in Practice
8 Conclusion
References
Constructions for Quantum Indistinguishability Obfuscation
1 Introduction
1.1 Overview of Results and Techniques
1.2 More on Related Work
1.3 Open Questions
2 Preliminaries
2.1 Basic Classical Cryptographic Notions
2.2 Classical Circuits and Algorithms
2.3 Classical Indistinguishability and Obfuscation
2.4 Basic Quantum Notions
2.5 Norms and Pseudo-distance
2.6 Quantum Indistinguishability
3 Indistinguishability Obfuscation for Quantum Circuits
4 Quantum Indistinguishability Obfuscation for Clifford Circuits
4.1 qiO for Clifford Circuits via a Canonical Form
4.2 qiO for Clifford Circuits via Gate Teleportation
5 Obfuscating Beyond Clifford Circuits
5.1 Single-Qubit Circuits
5.2 qiO via Gate Teleportation for all Quantum Circuits
6 Quantum Indistinguishability Obfuscation with Respect to a Pseudo-Distance
6.1 Approximately Equivalent Quantum Circuits
6.2 Indistinguishability Obfuscation for Approximately Equivalent Quantum Circuits
6.3 qiOD for Circuits Close to the Gottesman-Chuang Hierarchy
References
On Forging SPHINCS+-Haraka Signatures on a Fault-Tolerant Quantum Computer
1 Introduction
2 Preliminaries
2.1 The SPHINCS+ Signature Scheme
2.2 Quantum Computing
2.3 Grover's Algorithm on Preimage Resistance
2.4 Fault-Tolerant Resource Estimation
3 Reversible Implementations
3.1 Haraka
3.2 SHAKE-256
4 Attacking the SPHINCS+ Signature Scheme
4.1 Forging a SPHINCS+ Signature on the XMSS component
4.2 Forging a SPHINCS+ Signature on the WOTS Component
5 Fault-Tolerant Cost
5.1 Haraka
5.2 SHAKE-256
6 Conclusion
References
Post-quantum Cryptography
Post-quantum Key-Blinding for Authentication in Anonymity Networks
1 Introduction
1.1 Our Contributions and Paper Structure
1.2 Related Work
2 Background
2.1 Onion Services
2.2 Key-Blinding Signature Scheme Definitions
3 Unlinkability of Signature Schemes with Key-Blinding
4 A Lattice-Based Key-Blinding Scheme
4.1 blDilithium-QROM Description
4.2 blDilithium-QROM Security
4.3 Key-Blinding Dilithium
5 An Isogeny-Based Key-Blinding Scheme
Preface
Organization
Contents
Quantum Cryptography
Tight Bounds for Simon's Algorithm
1 Introduction
2 Amplitude Amplification
3 Simon's Algorithm
3.1 Algorithm Description
3.2 Analysis with Periodic Permutations
3.3 Limitations of Simon's Algorithm
3.4 A General Criterion
3.5 With Random Functions
4 Exact Variant of Simon's Algorithm
4.1 The Algorithm of Brassard and Høyer
4.2 Our Improved Variant
5 Grover-meets-Simon
5.1 Algorithm Description
5.2 Cost Analysis
6 The Offline Simon's Algorithm
6.1 Algorithm Description
6.2 Cost Analysis
7 Applications in Cryptanalysis
7.1 Landscape of Known Simon-Based Attacks
7.2 Cost Estimates in Practice
8 Conclusion
References
Constructions for Quantum Indistinguishability Obfuscation
1 Introduction
1.1 Overview of Results and Techniques
1.2 More on Related Work
1.3 Open Questions
2 Preliminaries
2.1 Basic Classical Cryptographic Notions
2.2 Classical Circuits and Algorithms
2.3 Classical Indistinguishability and Obfuscation
2.4 Basic Quantum Notions
2.5 Norms and Pseudo-distance
2.6 Quantum Indistinguishability
3 Indistinguishability Obfuscation for Quantum Circuits
4 Quantum Indistinguishability Obfuscation for Clifford Circuits
4.1 qiO for Clifford Circuits via a Canonical Form
4.2 qiO for Clifford Circuits via Gate Teleportation
5 Obfuscating Beyond Clifford Circuits
5.1 Single-Qubit Circuits
5.2 qiO via Gate Teleportation for all Quantum Circuits
6 Quantum Indistinguishability Obfuscation with Respect to a Pseudo-Distance
6.1 Approximately Equivalent Quantum Circuits
6.2 Indistinguishability Obfuscation for Approximately Equivalent Quantum Circuits
6.3 qiOD for Circuits Close to the Gottesman-Chuang Hierarchy
References
On Forging SPHINCS+-Haraka Signatures on a Fault-Tolerant Quantum Computer
1 Introduction
2 Preliminaries
2.1 The SPHINCS+ Signature Scheme
2.2 Quantum Computing
2.3 Grover's Algorithm on Preimage Resistance
2.4 Fault-Tolerant Resource Estimation
3 Reversible Implementations
3.1 Haraka
3.2 SHAKE-256
4 Attacking the SPHINCS+ Signature Scheme
4.1 Forging a SPHINCS+ Signature on the XMSS component
4.2 Forging a SPHINCS+ Signature on the WOTS Component
5 Fault-Tolerant Cost
5.1 Haraka
5.2 SHAKE-256
6 Conclusion
References
Post-quantum Cryptography
Post-quantum Key-Blinding for Authentication in Anonymity Networks
1 Introduction
1.1 Our Contributions and Paper Structure
1.2 Related Work
2 Background
2.1 Onion Services
2.2 Key-Blinding Signature Scheme Definitions
3 Unlinkability of Signature Schemes with Key-Blinding
4 A Lattice-Based Key-Blinding Scheme
4.1 blDilithium-QROM Description
4.2 blDilithium-QROM Security
4.3 Key-Blinding Dilithium
5 An Isogeny-Based Key-Blinding Scheme