diff --git a/chapter-qkd/chapter.tex b/chapter-qkd/chapter.tex
index 6923e28..fd0b983 100644
--- a/chapter-qkd/chapter.tex
+++ b/chapter-qkd/chapter.tex
@@ -1,4 +1,5 @@
 \chaptertitle{Case Study: Physical Security in Quantum Key Distribution}
+\label{chapter-qkd}
 
 Quantum Computing promises efficient solutions to a number of widely used cryptographic computational problems. As a
 countermeasure, new \emph{post-quantum} cryptosystems have been developed that are not susceptible to known quantum or
diff --git a/chapter-smpc/chapter.tex b/chapter-smpc/chapter.tex
index bdaee6e..a82c73a 100644
--- a/chapter-smpc/chapter.tex
+++ b/chapter-smpc/chapter.tex
@@ -1,10 +1,26 @@
 \chaptertitle{Case Study: Multiparty Computation in Scalable Hardware Security Modules}
 
+Inertial Hardware Security Modules do not only support much larger payloads compared to conventional HSMs, they also
+support much higher power dissipation since they allow for direct air cooling of their payload. Because they rotate at
+high speed, IHSM meshes do not need to be contiguous to provide adequate security. While a non-contiuous rotating mesh
+might theoretically allow a stationary attack tool to quickly penetrate, then retract through one of the mesh's gaps
+while the mesh is rotating, the time available for such an attack would be too short for a practical attack. For a mesh
+with three vertical connecting segments (cf.\ Figure~\ref{fig_proto_mesh} in Chapter~\ref{chapter-ihsm}) rotating at
+\qty{1000}{\rpm}, this time would be in the order of \qty{20}{\milli\second}. Conventional HSM monitoring circuits often
+require a similar amount of time to react to an attack~\cite{obermaier2018}.
+
+Similar to how the increase in payload \emph{size} unlocks new applications such as the Quantum Key Distribution relay
+use case we presented in Chapter~\ref{chapter-qkd}, this increase in sustainable power dissipation by a factor of
+several hundred also unlocks a number of new applications, especially ones that need vastly more computing power than
+conventional HSMs can provide.
+\todo{more text here}
+
 Multiparty Computation (MPC) is a cryptographic construct that allows several networked parties to jointly perform a
 computation in such a way that the inputs to the computation remain private to the parties providing them, and no single
 party must be trusted for the computation to produce the correct result. Conceptually, MPC is similar to a secret
 sharing scheme that shares not just data, but computation between untrusted parties. The computation primitive MPC
 offers is a cryptographic answer to the question of how to bootstrap trust in a computing system. 
+\todo{In this chapter, cite academic publications and patents on HSM cooling!}
 
 %The most challenging scenarios in computing arise when multiple 
 %parties such as manufacturers and operators, servers and clients, or sellers and buyers need to interact through