CCS format

Author: tzinas

backward-reduction.tex

@@ -18,16 +18,21 @@ \subsection{Supersafety $\rightarrow$ Perfect Timeliness}\label{sec:backward-red
 
 \import{./}{algorithms/algorithm-backward-reduction.tex}
 
-\begin{figure}
+\begin{figure*}
   \centering
-  \includegraphics[width=0.9\columnwidth,keepaspectratio]{figures/backward-reduction.pdf}
+  \iflncs
+    \includegraphics[width=0.9\columnwidth,keepaspectratio]{figures/backward-reduction.pdf}
+  \fi
+  \ifccs
+    \includegraphics[width=1.4\columnwidth,keepaspectratio]{figures/backward-reduction.pdf}
+  \fi
   \caption{The reduction from Supersafety
     (the $\Pi$ protocol) to Perfect Timeliness (the $\Pi^*$ protocol).
     New transactions of $\Ledger[][][r]$ are included in
     $\Ledger[*][][r]$ with recorded round $r$.
   }
  \label{fig:backward-reduction}
-\end{figure}
+\end{figure*}
 
 %We now prove that protocol $\Pi^*$ is perfectly timely.
 
@@ -83,6 +88,29 @@ \subsection{A Perfectly Timely, Supersafe Protocol with Clients}
 Otherwise, the transaction is rejected as invalid.
 The protocol is illustrated in Figure~\ref{fig:client-support}.
 
+\ifccs
+  \begin{figure*}[b]
+    \centering
+    \includegraphics[width=1\columnwidth,keepaspectratio]{figures/perfectly-timely-clients.pdf}
+    \caption{Client support for the perfectly timely and supersafe protocol $\Pi*$.
+    }
+  \label{fig:client-support}
+  \end{figure*}
+\fi
+
+\ifccs
+  \begin{figure*}[b]
+  \centering
+  \includegraphics[width=0.75\columnwidth,keepaspectratio]{figures/perfectly-timely-clients-feedback.pdf}
+  \caption{The client-supporting supersafe and perfectly timely protocol $\Pi^*$
+            using only one instance of $\Pi$ for efficiency.
+            Normal transactions and ledgers are shown in solid black lines;
+            auxiliary transactions are shown in dashed
+            orange lines.}
+  \label{fig:client-support-feedback}
+  \end{figure*}
+\fi
+
 A late-joining client first synchronizes $\Pi_1$ and $\Pi_2$ with the rest
 of the peers.
 Due to safety, liveness and the validity rule of $\Pi_2$,
@@ -94,13 +122,15 @@ \subsection{A Perfectly Timely, Supersafe Protocol with Clients}
 operating as a full online node without $\Pi_2$, i.e., it outputs the ledger $\Ledger[*]$.
 From this point on, the client is perfectly timely and supersafe.
 
-\begin{figure}
-  \centering
-  \includegraphics[width=0.7\columnwidth,keepaspectratio]{figures/perfectly-timely-clients.pdf}
-  \caption{Client support for the perfectly timely and supersafe protocol $\Pi*$.
-  }
- \label{fig:client-support}
-\end{figure}
+\iflncs
+  \begin{figure*}
+    \centering
+    \includegraphics[width=0.7\columnwidth,keepaspectratio]{figures/perfectly-timely-clients.pdf}
+    \caption{Client support for the perfectly timely and supersafe protocol $\Pi*$.
+    }
+  \label{fig:client-support}
+  \end{figure*}
+\fi
 
 Lastly, to make this protocol efficient, we observe that the payload of
 $\Pi_2$ transactions does not need to include the whole $\Pi_1$ transaction, but
@@ -116,14 +146,15 @@ \subsection{A Perfectly Timely, Supersafe Protocol with Clients}
 only apply to the orange transactions. This final construction is illustrated in
 Figure~\ref{fig:client-support-feedback}.
 
-\begin{figure}
+\iflncs
+  \begin{figure*}
   \centering
   \includegraphics[width=0.55\columnwidth,keepaspectratio]{figures/perfectly-timely-clients-feedback.pdf}
   \caption{The client-supporting supersafe and perfectly timely protocol $\Pi^*$
-           using only one instance of $\Pi$ for efficiency.
-           Normal transactions and ledgers are shown in solid black lines;
-           auxiliary transactions are shown in dashed
-           orange lines.}
- \label{fig:client-support-feedback}
-\end{figure}
-
+            using only one instance of $\Pi$ for efficiency.
+            Normal transactions and ledgers are shown in solid black lines;
+            auxiliary transactions are shown in dashed
+            orange lines.}
+  \label{fig:client-support-feedback}
+  \end{figure*}
+\fi

body.tex

@@ -18,4 +18,6 @@
 \import{./}{forward-reduction.tex}
 \import{./}{backward-reduction.tex}
 \import{./}{conclusion.tex}
-\import{./}{acknowledgements.tex}
+\ifanonymous
+  \import{./}{acknowledgements.tex}
+\fi

ccs-preamble.tex

@@ -0,0 +1,22 @@
+\fancyhf{} % Remove fancy page headers
+\fancyhead[C]{SBC '24} % TODO: replace 9999 with your paper number
+\fancyfoot[C]{\thepage}
+
+\acmConference[SBC]{SBC}{Aug 7 - 9, 2024}{Alfred Lerner Hall, Columbia University}
+\acmYear{}
+
+\acmPrice{}
+\acmDOI{}
+\acmISBN{}
+
+\fancypagestyle{firstpage}{
+  \fancyhf{}
+  \renewcommand{\footrulewidth}{0pt}
+  \fancyfoot[C]{\vspace*{-3.5\baselineskip}\thepage}
+}
+
+\settopmatter{printacmref=false, printccs=false, printfolios=false}
+\setcopyright{none}
+\renewcommand\footnotetextcopyrightpermission[1]{}
+
+%%\ccsPaper{9999} % TODO: replace with your paper number once obtained

chains-to-ledgers.tex

@@ -32,6 +32,15 @@ \subsection{From Chains to Ledgers}
   Furthermore, $\Chain[][P_1][r_1] \preccurlyeq \Chain[][P_1][r_2]$ (sticky).
 \end{definition}
 
+\ifccs
+  \begin{figure*}
+    \centering
+    \includegraphics[width=0.7\columnwidth,keepaspectratio]{figures/freshness-timeliness.pdf}
+    \caption{The chain in the proof of Theorem~\ref{thm:freshness-to-timeliness}.}
+    \label{fig:freshness-to-timeliness}
+  \end{figure*}
+\fi
+
 \noindent
 \textbf{From Temporal Blockchains to Temporal Ledgers.}
 Any temporal blockchain protocol can be transformed into a
@@ -97,12 +106,14 @@ \subsection{From Chains to Ledgers}
   Because of freshness, it holds that $r_1 - r^* \leq w$.
   Therefore, from $r \leq r_1 - v$ it follows that $r - r^* \leq w - v = 0$.
 
-  \begin{figure}
-    \centering
-    \includegraphics[width=0.5\columnwidth,keepaspectratio]{figures/freshness-timeliness.pdf}
-    \caption{The chain in the proof of Theorem~\ref{thm:freshness-to-timeliness}.}
-    \label{fig:freshness-to-timeliness}
-  \end{figure}
+  \iflncs
+    \begin{figure*}
+      \centering
+      \includegraphics[width=0.5\columnwidth,keepaspectratio]{figures/freshness-timeliness.pdf}
+      \caption{The chain in the proof of Theorem~\ref{thm:freshness-to-timeliness}.}
+      \label{fig:freshness-to-timeliness}
+    \end{figure*}
+  \fi
 
   This is a contradiction because block $B$ extends a chain that contains $B^*$,
   and hence $r > r^*$.

forward-reduction.tex

@@ -16,15 +16,20 @@ \subsection{Timeliness $\rightarrow$ Supersafety}
 The reduction is illustrated
 in Figure~\ref{fig:reduction-timeliness-supersafety} and Algorithm~\ref{alg:reduction-timeliness-supersafety}.
 
-\begin{figure}
+\begin{figure*}
   \centering
-  \includegraphics[width=0.7\columnwidth,keepaspectratio]{figures/forward-reduction.pdf}
+  \iflncs
+    \includegraphics[width=0.7\columnwidth,keepaspectratio]{figures/forward-reduction.pdf}
+  \fi
+  \ifccs
+    \includegraphics[width=1.1\columnwidth,keepaspectratio]{figures/forward-reduction.pdf}
+  \fi
   \caption{The reduction from Timeliness
     (the $\Pi$ protocol) to Supersafety (the $\Pi^*$ protocol). A transaction is illustrated
     as a black circle and its recorded round is displayed below.
   }
  \label{fig:reduction-timeliness-supersafety}
-\end{figure}
+\end{figure*}
 
 When the \rread function is invoked, the temporal ledger of party $P$ is acquired
 in Line~\ref{line.reduction-t-s-ledger}.

frontpage.tex

@@ -1,5 +1,7 @@
 \import{./}{title.tex}
+\iflncs
 \maketitle
+\fi
 
 \iftoday
 \noindent
@@ -8,3 +10,6 @@
 \fi
 
 \import{./}{abstract.tex}
+\ifccs
+\maketitle
+\fi

introduction.tex

@@ -64,7 +64,7 @@ \section{Introduction}
         the two properties are morally equivalent.
 \end{enumerate}
 
-\begin{figure}
+\begin{figure*}
   \centering
   % \includegraphics[width=1.0\columnwidth,keepaspectratio]{figures/timeliness-overview.pdf}
   \definecolor{myblue}{HTML}{cfe2f3}
@@ -102,7 +102,7 @@ \section{Introduction}
     \draw[arrow] (braceMid) + (0,-5pt) -- (braceMid |- recency.north) node [pos=0.5, left, font=\footnotesize] {Lem~\ref{lem.longest-chain-recency}};
 
     \draw[arrow] (streamlet.east) -- (recency.west) node [pos=0.5, above, font=\footnotesize] {Thm~\ref{thm.streamlet-recency}};
-    
+
     \coordinate (recencyMid) at ($(recency.south west)+(1.2cm,0)$);
     \draw[arrow] (recencyMid) -- (recencyMid |- freshness.north) node [left, pos=0.5, font=\footnotesize] {Thm~\ref{thm.recency-to-freshness}};
 
@@ -141,7 +141,7 @@ \section{Introduction}
   and vice versa (Theorems~\ref{thm:timeliness-to-supersafety}-\ref{thm:backward-reduction}, bottom).
   }
  \label{fig:overview}
-\end{figure}
+\end{figure*}
 
 \noindent
 \textbf{Overview of the results.}

longest-chain-proof.tex

@@ -88,14 +88,19 @@ \subsection{Longest Chain Protocols are Timely}
 
   For the second inequality, refer to Figure~\ref{fig:longest-chain-recency-proof}.
 
-  \begin{figure}
+  \begin{figure*}
     \centering
-    \includegraphics[width=0.5\columnwidth,keepaspectratio]{figures/longest-chain-proof.pdf}
+    \iflncs
+      \includegraphics[width=0.5\columnwidth,keepaspectratio]{figures/longest-chain-proof.pdf}
+    \fi
+    \ifccs
+      \includegraphics[width=0.8\columnwidth,keepaspectratio]{figures/longest-chain-proof.pdf}
+    \fi
     \caption{Longest chain recency proof. Block $B'$ is illustrated in the
              earliest possible position.
     }
    \label{fig:longest-chain-recency-proof}
-  \end{figure}
+  \end{figure*}
 
   On the other hand, by Inequality~\ref{eq:bitcoin-r-bound}, $r - (r' + 2) \geq w - 1 \geq s$ and
   we can apply Chain Growth between rounds $r' + 2$ and $r$

preamble.sty

@@ -16,33 +16,30 @@
 
 \iflncs
   \usepackage{cite}
+  \usepackage{amssymb}
 \fi
+
 % \usepackage{algorithmic}
 \usepackage{graphicx}
 \usepackage{textcomp}
 \usepackage{xspace}
-\usepackage[table,xcdraw,dvipsnames]{xcolor}
+%\usepackage[table,xcdraw,dvipsnames]{xcolor}
 \usepackage{tikz}
 \usepackage{mdframed}
 
 % \let\proof\relax
 % \let\endproof\relax
 \usepackage{amsfonts}
 \usepackage{amsmath}
-\usepackage{amssymb}
 \usepackage{mathtools}
 \usepackage{xargs}
 
-\iflncs
-  \usepackage{amssymb}
-\fi
 \iftwocolumn
 	\usepackage{amsthm}
 \fi
 \PassOptionsToPackage{hyphens}{url}\usepackage{hyperref}
 \usepackage{bookmark}
 \usepackage{hyperref}
-\usepackage{mathtools}
 \usepackage{listings}
 \usepackage{import}
 \usepackage{algorithm}
@@ -183,26 +180,10 @@
 %pagestyle{plain}
 
 \ifccs
-% \iftwocolumn
-%     \newtheorem{theorem}{Theorem}[section]
-%     \newtheorem{corollary}{Corollary}[theorem]
-     \newtheorem{lemma}[theorem]{Lemma}
-%
      \theoremstyle{remark}
      \newtheorem*{remark}{Remark}
 
      \newtheorem*{theorem*}{Theorem}
-%
-    \theoremstyle{definition}
-    \newtheorem{definition}{Definition}[section]
-% \fi
-\fi
-
-
-\iflncs
-  \newtheorem{Lemma}{lemma}{lemma}
-  \newenvironment{Claim}{claim}{claim}
-  \newenvironment{Definition}{definition}{definition}
 \fi
 
 \ifccs

timeliness.tex

@@ -8,8 +8,9 @@
 
 %\anonymoustrue
 %\notestrue
-\lncstrue
-\todaytrue
+%\lncstrue
+\ccstrue
+%\todaytrue
 
 \ifccs
   \twocolumntrue

title.tex

@@ -1,16 +1,27 @@
 \title{On-Chain Timestamps Are Accurate}
-\ifanonymous{
-  \author{}\institute{}
-}
+\ifanonymous{\iflncs
+\author{}\institute{}
+\fi}
 \else
+
 \author{
         Apostolos Tzinas\inst{2,3} \and
         Srivatsan Sridhar \inst{1} \and
         Dionysis Zindros\inst{1,3}
 }
+\iflncs
 \institute{
            Stanford University \and
            National Technical University of Athens \and
            Common Prefix
 }
+\else
+\affiliation{
+\institution{
+           Stanford University \and
+           National Technical University of Athens \and
+           Common Prefix
+}
+}
+\fi
 \fi