Bunch of layout changes

This commit is contained in:
jaseg 2024-07-31 13:43:09 +02:00
parent 713d515801
commit f5ff0de576
3 changed files with 99 additions and 10 deletions

Binary file not shown.

View file

@ -1,7 +1,7 @@
\documentclass[12pt,a4paper,notitlepage,twoside]{report}
\documentclass[11pt,a4paper,notitlepage,twoside]{report}
\usepackage[ngerman, english]{babel}
\usepackage[utf8]{inputenc}
\usepackage[a4paper, top=2cm, bottom=3.5cm, inner=3.5cm, outer=5cm]{geometry}
\usepackage[a4paper, top=3cm, bottom=3.5cm, inner=3.5cm, outer=5cm, marginpar=4cm]{geometry}
% Matti remarkable tablet special size
%\usepackage[paperwidth=15cm, paperheight=244mm, top=1cm, bottom=1cm, left=5mm, right=5mm]{geometry}
\usepackage[T1]{fontenc}
@ -36,12 +36,15 @@
\usepackage{extdash}
\usepackage{amsthm}
\usepackage{tabularx}
%\usepackage{showframe} Useful for page layout debugging
\usepackage{multirow}
\usepackage{multicol}
\usepackage{tikz}
\usepackage{mathtools}
\usepackage{setspace}
\usepackage{titlesec}
\usepackage{fancybox}
\usepackage{fancyhdr}
\DeclarePairedDelimiter{\ceil}{\lceil}{\rceil}
\DeclarePairedDelimiter{\paren}{(}{)}
@ -81,9 +84,45 @@
\newcommand{\degree}{\ensuremath{^\circ}}
\newcolumntype{P}[1]{>{\centering\arraybackslash}p{#1}}
\setlength{\marginparwidth}{3cm}
\definecolor{todoboxcolor}{RGB}{251 224 252}
\newcommand{\todo}[1]{\marginpar{\setlength{\fboxsep}{4mm}\colorbox{todoboxcolor}{\parbox{\marginparwidth}{\raggedright\textsf{\small\textbf{To do}\\\footnotesize#1}}}}}
\pagestyle{fancy}
\fancyhead[C]{}
\fancyhead[ER]{\footnotesize\leftmark}
\fancyhead[OL]{\footnotesize\rightmark}
\fancyhead[EL,OR]{\thepage}
\fancyfoot[LCR]{}
\fancypagestyle{plain}{%
\fancyhf{}%
\renewcommand{\headrulewidth}{0pt}%
\renewcommand{\footrulewidth}{0pt}%
}
\raggedbottom
\renewcommand{\chaptermark}[1]{\markboth{#1}{}}
\renewcommand{\sectionmark}[1]{\markright{\thesection\ #1}}
\addtolength{\headwidth}{\marginparsep}
\addtolength{\headwidth}{\marginparwidth}
\addtolength{\headwidth}{-1cm}
\newcommand{\todo}[1]{
\marginpar{
\setlength{\fboxsep}{2mm}
\shadowbox{
\parbox{3cm}{
\raggedright
\textsf{
\small\textbf{To do}\\
\footnotesize#1
}
}
}
}
}
\begin{document}
\dominitoc

View file

@ -58,7 +58,7 @@
isbn = {978-1-4503-4139-4}
}
@inproceedings{arpPrivacyThreatsUltrasonic2017,
@inproceedings{arpPrivacyThreatsUltrasonic2017a,
title = {Privacy {{Threats}} through {{Ultrasonic Side Channels}} on {{Mobile Devices}}},
booktitle = {2017 {{IEEE European Symposium}} on {{Security}} and {{Privacy}} ({{EuroS}}\&{{P}})},
author = {Arp, Daniel and Quiring, Erwin and Wressnegger, Christian and Rieck, Konrad},
@ -190,6 +190,22 @@
file = {/home/jaseg/Zotero/storage/4PL34JUV/Barnett and Phoenix - 2011 - Securing a quantum key distribution relay network .pdf}
}
@inproceedings{barootiPublicKeyEncryptionQuantum2023,
title = {Public-{{Key Encryption}} with~{{Quantum Keys}}},
booktitle = {Theory of {{Cryptography}}},
author = {Barooti, Khashayar and Grilo, Alex B. and Huguenin-Dumittan, Loïs and Malavolta, Giulio and Sattath, Or and Vu, Quoc-Huy and Walter, Michael},
editor = {Rothblum, Guy and Wee, Hoeteck},
date = {2023},
pages = {198--227},
publisher = {Springer Nature Switzerland},
location = {Cham},
doi = {10.1007/978-3-031-48624-1_8},
abstract = {In the framework of Impagliazzos five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist (MiniCrypt). However, the boundaries between these worlds can change when quantum information is taken into account. Recent work has shown that quantum variants of oblivious transfer and multi-party computation, both primitives that are classically in Cryptomania, can be constructed from one-way functions, placing them in the realm of quantum MiniCrypt (the so-called MiniQCrypt). This naturally raises the following question: Is it possible to construct a quantum variant of public-key encryption, which is at the heart of Cryptomania, from one-way functions or potentially weaker assumptions?},
isbn = {978-3-031-48624-1},
langid = {english},
file = {/home/jaseg/Sync/Research/Zotero/Barooti et al_2023_Public-Key Encryption with Quantum Keys.pdf}
}
@online{bartusekCryptographyCertifiedDeletion2023,
title = {Cryptography with {{Certified Deletion}}},
author = {Bartusek, James and Khurana, Dakshita},
@ -311,6 +327,24 @@
langid = {english}
}
@article{bibakQuantumKeyDistribution2021,
title = {Quantum Key Distribution with {{PRF}}({{Hash}}, {{Nonce}}) Achieves Everlasting Security},
author = {Bibak, Khodakhast and Ritchie, Robert},
date = {2021-07},
journaltitle = {Quantum Information Processing},
shortjournal = {Quantum Inf Process},
volume = {20},
number = {7},
pages = {228},
issn = {1570-0755, 1573-1332},
doi = {10.1007/s11128-021-03164-3},
url = {https://link.springer.com/10.1007/s11128-021-03164-3},
urldate = {2024-07-29},
abstract = {Peev et al. (Int J Quantum Inf 03:225231, 2005) introduced a key-efficient two-step hash function for authentication in quantum key distribution (QKD). They suggested using a publicly known hash function as part of this scheme. Improving on this, Pacher et al. (Quantum Inf Process 15:327362, 2016) suggested a method to restore information-theoretic security (ITS) by using almost universal hash functions instead of publicly known hash functions. While their scheme is a key-efficient almost-strongly universal (ASU) family, like any other ASU family, it only provides a one-time MAC. Here, we propose the use of a MAC paradigm called PRF(Hash, Nonce) for authentication in QKD. This MAC has several advantages which make it suited for QKD. In particular, unlike the above constructions, it is a many-time MAC and is also more key-efficient. In fact, PRF(Hash, Nonce) is even more key-efficient than the WegmanCarter paradigm, the most widely used MAC scheme for authentication in QKD. Furthermore, it provides everlasting security, which means that if authentication remains unbroken during the execution of QKD, then the resulting keys retain ITS, which guarantees that the adversary cannot gain any new information on the keys even with unlimited computational power.},
langid = {english},
file = {/home/jaseg/Zotero/storage/RDABDXY6/Bibak and Ritchie - 2021 - Quantum key distribution with PRF(Hash, Nonce) ach.pdf}
}
@inproceedings{blantonPrivateObliviousSet2012,
title = {Private and Oblivious Set and Multiset Operations},
author = {Blanton, Marina and Aguiar, Everaldo},
@ -1104,6 +1138,22 @@
file = {/home/jaseg/Zotero/storage/J7DQKVVH/Goos et al. - 1999 - Information Theoretically Secure Communication in .pdf}
}
@inproceedings{griloObliviousTransferMiniQCrypt2021,
title = {Oblivious {{Transfer Is}} in {{MiniQCrypt}}},
booktitle = {Advances in {{Cryptology}} {{EUROCRYPT}} 2021},
author = {Grilo, Alex B. and Lin, Huijia and Song, Fang and Vaikuntanathan, Vinod},
editor = {Canteaut, Anne and Standaert, François-Xavier},
date = {2021},
pages = {531--561},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-77886-6_18},
abstract = {MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum polynomial-time adversaries, building on the foundational work of Crépeau and Killian (FOCS 1988) and Bennett, Brassard, Crépeau and Skubiszewska (CRYPTO 1991). Combining the OT protocol with prior works, we obtain secure two-party and multi-party computation protocols also in MiniQCrypt. This is in contrast to the classical world, where it is widely believed that one-way functions alone do not give us OT.},
isbn = {978-3-030-77886-6},
langid = {english},
file = {/home/jaseg/Sync/Research/Zotero/Grilo et al_2021_Oblivious Transfer Is in MiniQCrypt.pdf}
}
@article{grisafiPISTISTrustedComputing,
title = {{{PISTIS}}: {{Trusted Computing Architecture}} for {{Low-end Embedded Systems}}},
author = {Grisafi, Michele and Ammar, Mahmoud and Crispo, Bruno and Roveri, Marco},
@ -1703,11 +1753,11 @@
issn = {2511-9044, 2511-9044},
doi = {10.1002/qute.201800011},
url = {http://arxiv.org/abs/1703.09278},
urldate = {2024-05-02},
urldate = {2024-05-27},
abstract = {Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable QKD. In this article we review the theoretical foundations of continuous-variable quantum key distribution (CV-QKD) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of CV-QKD, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice.},
langid = {english},
keywords = {Quantum Physics},
file = {/home/jaseg/Zotero/storage/A2BQHUUW/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf}
file = {/home/jaseg/Zotero/storage/I7UL2SKX/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf}
}
@article{laudenbachContinuousVariableQuantumKey2018a,
@ -1725,11 +1775,11 @@
issn = {2511-9044, 2511-9044},
doi = {10.1002/qute.201800011},
url = {http://arxiv.org/abs/1703.09278},
urldate = {2024-05-27},
urldate = {2024-05-02},
abstract = {Quantum key distribution using weak coherent states and homodyne detection is a promising candidate for practical quantum-cryptographic implementations due to its compatibility with existing telecom equipment and high detection efficiencies. However, despite the actual simplicity of the protocol, the security analysis of this method is rather involved compared to discrete-variable QKD. In this article we review the theoretical foundations of continuous-variable quantum key distribution (CV-QKD) with Gaussian modulation and rederive the essential relations from scratch in a pedagogical way. The aim of this paper is to be as comprehensive and self-contained as possible in order to be well intelligible even for readers with little pre-knowledge on the subject. Although the present article is a theoretical discussion of CV-QKD, its focus lies on practical implementations, taking into account various kinds of hardware imperfections and suggesting practical methods to perform the security analysis subsequent to the key exchange. Apart from a review of well known results, this manuscript presents a set of new original noise models which are helpful to get an estimate of how well a given set of hardware will perform in practice.},
langid = {english},
keywords = {Quantum Physics},
file = {/home/jaseg/Zotero/storage/I7UL2SKX/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf}
file = {/home/jaseg/Zotero/storage/A2BQHUUW/Laudenbach et al. - 2018 - Continuous-Variable Quantum Key Distribution with .pdf}
}
@article{laudenbachContinuousVariableQuantumKey2018b,
@ -2162,7 +2212,7 @@
file = {/home/jaseg/Zotero/storage/EBAXQHG5/Mosavirik et al. - 2022 - ImpedanceVerif On-Chip Impedance Sensing for Syst.pdf}
}
@article{mosavirikSiliconEchoesNonInvasive2023,
@article{mosavirikSiliconEchoesNonInvasive2023a,
title = {Silicon {{Echoes}}: {{Non-Invasive Trojan}} and {{Tamper Detection}} Using {{Frequency-Selective Impedance Analysis}}},
shorttitle = {Silicon {{Echoes}}},
author = {Mosavirik, Tahoura and Monfared, Saleh Khalaj and Safa, Maryam Saadat and Tajik, Shahin},