main-listas.tex

\documentclass
{llncs}




%\makeatletter
%\def\input@path{{../}}
%\makeatother
%
\input{common-packages}

\newif\iffull
\fullfalse
%\usepackage{fullpage}
\input{preamble}


\author{Alonso Gonz\'alez\thanks{Funded by CONICYT, CONICYT-PCHA/Doctorado Nacional/2013-21130937.} \inst{1} \and  Carla R\`afols \inst{2}}
\institute{DCC, Universidad de Chile, Chile \and DTIC, Universitat Pompeu Fabra, Barcelona}

\title{New Techniques for Non-Interactive Shuffle and Range Arguments}
\begin{document}
%\begin{doublespace}

\maketitle
%\vspace*{-.5cm}
\begin{abstract}
    \input{abstract}
\end{abstract} 

\section{Introduction}
    \input{intro/introduction}
    \subsection{Our Techniques}\label{sec:techniques}
        \input{intro/our-techniques}
%    \subsection{Applications}\label{sec:intro-app}
%        \input{intro/applications}
    \subsection{Related Work}
        \input{intro/related-work}
\iffull
    \subsection{Organization}
        \input{intro/organization}
\fi
\section{Preliminaries} \label{secc:prelim}
    \input{prelim/prelim}
    \subsection{Decisional Assumptions} 
        \input{prelim/dec-assumptions} \label{sec:dec-ass}
            \subsection{Computational Assumptions}\label{sec:comp-assump}
        \input{prelim/comp-assumptions}
%    \subsection{Commitment Schemes} \label{sec:comm}
%         \input{prelim/comm}
    \subsection{Groth-Sahai NIZK Proofs} \label{GSproofs} \label{sec:gs}
        \input{prelim/gs-proofs}
    \subsection{Quasi-Adaptive NIZK Arguments} \label{zkdef} \label{sec:zkdef}
        \input{prelim/qanizk}
        \subsubsection{QA-NIZK Argument for Linear Subspaces.} \label{Sect:QANIZKlinspace}
            \input{prelim/qanizk-linear}
\section{Extended Multi-Pedersen Commitments} \label{sec:mp-comm}
    \input{mp-comm/mp-comm}
\section{QA-NIZK For Bit-Strings, Revisited} \label{sec:bits}
    \input{bits/bits}  
    \subsection{Constant-Size Argument for $\Lang_{ck,\sfbits}^n$} \label{sec:bits-n}
        \input{bits/matr-bits}
       

\section{Aggregated NIZK Set Membership Arguments} \label{sec:bin-lang}
    \input{bin-languages/bin-languages}
    \subsection{QA-NIZK Argument of Membership in $\Lang_{\matr{M},\matr{N},\matr{\Lambda},\grkb{\alpha}}^n$} \label{sec:bin-lan-constr}
       \input{bin-languages/construction} 


\section{Proof of Correctness of a Shuffle} \label{sec:shuffle}
\input{shuffles/shuffles}
%    \subsection{Security Proof}
%        \input{shuffles/security-proofs}
\section{Range Argument in the Interval $[0,2^n-1]$} \label{sec:range-proof}
    \input{range-proofs/range-proofs}
\bibliographystyle{abbrv}
\bibliography{cryptobib/abbrev2,cryptobib/crypto,manualbib}

\iffalse
\appendix
\section{Groth-Sahai Proofs} \label{app:gs-proofs}
    \input{prelim/app-gsproofs}
\section{Quasi-Adaptive NIZK} \label{app:qanizk}
    \input{prelim/app-qanizk}
\section{Extended Multi-Pedersen Commitments: Proofs} \label{app:mp}
    \input{mp-comm/app_mp}
%\section{QA-NIZK for Bit-Strings, Revisited} \label{app:bits}
%In this section, we give the details of the QA-NIZK argument to prove that a MP commitment opens to a bit-string.
%    \subsection{The scheme} \label{sec:bits-scheme} 
%        \input{bits/proof-system}
%    \subsection{Security Proof} \label{app:proofbits}
%        \input{bits/proof}
\section{Details of the Constant-size Argument for $\Lang_{ck,\sfbits}^n$} \label{app:bits-n}
        \input{bits/matr-bits-intuition}
        \input{bits/matr-bits-sec-proof}
\section{Details of Aggregated NIZK Set Membership Arguments} \label{app:bin-lang}
    \input{bin-languages/app_bin_construction}
    \subsection{Security Proofs}
        \input{bin-languages/bin-lang-proof}
\section{Details of the Proof of Correctness of a Shuffle} \label{app:shuffle}
    \input{shuffles/detailed-description}
    \subsection{Security Proofs}
        \input{shuffles/security-proofs}
\section{Details of the Range Argument} \label{app:range-proof}
    \input{range-proofs/detailed-construction}
    \subsection{Security Proofs}
        \input{range-proofs/security-proofs}
\fi
\end{document}