JOC for BD18; AB08 and MSS17

these.bib

@@ -2395,12 +2395,17 @@
   isbn      = {978-3-540-33109-4},
 }
 
-@Misc{BD17,
+@Article{BD18,
-  author       = {Razvan Barbulescu and Sylvain Duquesne},
+  author   = {Barbulescu, Razvan and Duquesne, Sylvain},
-  title        = {Updating key size estimations for pairings},
+  title    = {Updating Key Size Estimations for Pairings},
-  howpublished = {Cryptology ePrint Archive, Report 2017/334},
+  journal  = {Journal of Cryptology},
-  year         = {2017},
+  year     = {2018},
-  note         = {\url{https://ia.cr/2017/334}},
+  month    = {Jan},
+  issn     = {1432-1378},
+  abstract = {Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings and propose new key sizes using an analysis which is more precise than the analysis in a recent article of Menezes, Sarkar and Singh. We also select pairing-friendly curves for standard security levels.},
+  day      = {29},
+  doi      = {10.1007/s00145-018-9280-5},
+  url      = {https://doi.org/10.1007/s00145-018-9280-5},
 }
 
 @InProceedings{KB16,
@@ -2505,4 +2510,51 @@
   url       = {http://doi.acm.org/10.1145/800157.805047},
 }
 
+@InProceedings{MSS17,
+  author    = {Menezes, Alfred and Sarkar, Palash and Singh, Shashank},
+  title     = {{Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography}},
+  booktitle = {Paradigms in Cryptology -- Mycrypt 2016. Malicious and Exploratory Cryptology},
+  year      = {2017},
+  editor    = {Phan, Rapha{\"e}l C.-W. and Yung, Moti},
+  pages     = {83--108},
+  address   = {Cham},
+  publisher = {Springer International Publishing},
+  abstract  = {In the past two years there have been several advances in Number Field Sieve (NFS) algorithms for computing discrete logarithms in finite fields                                                                                   {\$}{\$}{\{}{\backslash}mathbb F{\}}{\_}{\{}p^n{\}}{\$}{\$}                   where p is prime and                                                                                   {\$}{\$}n > 1{\$}{\$}                   is a small integer. This article presents a concise overview of these algorithms and discusses some of the challenges with assessing their impact on keylengths for pairing-based cryptosystems.},
+  isbn      = {978-3-319-61273-7},
+}
+
+@Article{Gil77,
+  author  = {John Gill},
+  title   = {Computational Complexity of Probabilistic Turing Machines},
+  journal = {SIAM Journal on Computing},
+  year    = {1977},
+  volume  = {6},
+  number  = {4},
+  pages   = {675-695},
+  doi     = {10.1137/0206049},
+  eprint  = {https://doi.org/10.1137/0206049},
+  url     = { 
+        https://doi.org/10.1137/0206049
+    
+},
+}
+
+@Misc{Rab60,
+  author       = {Rabin, Michael Oser},
+  title        = {Degree of difficulty of computing a function and a partial ordering of recursive sets},
+  howpublished = {Technical Report 2, {Hebrew University of Jerusalem}},
+  year         = {1960},
+  publisher    = {Hebrew University},
+}
+
+@Book{AB09,
+  title     = {Computational Complexity: A Modern Approach},
+  publisher = {Cambridge University Press},
+  year      = {2009},
+  author    = {Arora, Sanjeev and Barak, Boaz},
+  address   = {New York, NY, USA},
+  edition   = {1st},
+  isbn      = {0521424267, 9780521424264},
+}
+
 @Comment{jabref-meta: databaseType:bibtex;}