\documentclass[12pt]{article}

\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsfonts}
\usepackage{url}
\usepackage{hyperref}

\begin{document}

\section*{BDLOP}

BDLOP\cite{bdlop} commitments are $\mathcal{O}(n)$ and support NIZK arguments of linear relation. Using MSIS with $R_q \in \mathbb{Z}_q/(X^N + 1)$, prime $q$, and $\log_2(N) \in \mathbb{Z}^{+}$.




\section{Argument}




\newpage
\begin{thebibliography}{999}

\bibitem{bdlop} Carsten Baum and Ivan Damgård and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert,
More Efficient Commitments from Structured Lattice Assumptions,
Cryptology {ePrint} Archive, Paper 2016/997,
2016,
\url{https://eprint.iacr.org/2016/997}

\end{thebibliography}

\end{document}
