-
Notifications
You must be signed in to change notification settings - Fork 0
/
main-listas-full.tex
107 lines (89 loc) · 3.8 KB
/
main-listas-full.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
\documentclass[11pt]{llncs}
%\makeatletter
%\def\input@path{{../}}
%\makeatother
%
\input{common-packages}
\usepackage{fullpage}
\newif\iffull
\fulltrue
%\usepackage{fullpage}
\input{preamble}
%\author[1]{Alonso Gonz\'alez}
%\author[1]{Alejandro Hevia}
%\affil[1]{Departamento de Ciencias de la Computaci\'on, Universidad de Chile, Chile\\
%\tt [email protected], [email protected]}}
%\author[2]{Carla R\`afols}
%\affil[2]{Horst-G\"ortz Institute for IT Security and Faculty of Mathematics, Ruhr-Universit\"at Bochum, Germany\\
%{\tt [email protected]}}
\author{\vspace*{-.5cm}}
\institute{\vspace*{-.8cm}}
\title{Aggregated Non-Interactive Zero-Knowledge Set Membership 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{Related Work}
\input{intro/related-work}
\subsection{Organization}
\input{intro/organization}
\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}
\subsection{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 Proof in the Interval $[0,2^n-1]$} \label{sec:range-proof}
\input{range-proofs/range-proofs}
\subsection{Security Proofs}
\input{range-proofs/security-proofs}
\bibliographystyle{abbrv}
\bibliography{cryptobib/abbrev2,cryptobib/crypto,manualbib}
\appendix
\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. We denote by $\indexSet{n}{k}$ the set $\{(i,j):i,j\in[n+k]\}\setminus\{(i,i),i\in[n]\}$.
\subsection{The scheme} \label{sec:bits-scheme}
\input{bits/proof-system}
\subsection{Security Proof} \label{app:proofbits}
\input{bits/proof}
\subsection{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{Proof of Correctness of a Shuffle: Security Proof} \label{app:shuffle}
\input{shuffles/security-proofs}
\end{document}