+ BR93, FS86

these.bib

@@ -525,7 +525,7 @@
 @InProceedings{Can01,
   author    = {Canetti, R.},
   title     = {Universally Composable Security: A New Paradigm for Cryptographic Protocols},
-  booktitle = {{FOCS} 2001},
+  booktitle = {{FOCS}},
   year      = {2001},
   pages     = {136--145},
 }
@@ -1461,16 +1461,6 @@
   publisher = {Springer},
 }
 
-@InProceedings{BR93,
-  author    = {M. Bellare and P. Rogaway},
-  title     = {Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols},
-  booktitle = {{ACM-CCS} 1993},
-  year      = {1993},
-  pages     = {62--73},
-  publisher = {ACM},
-  timestamp = {2015.10.06},
-}
-
 @InProceedings{BSZ05,
   author    = {Bellare, Mihir and Shi, Haixia and Zhang, Chong},
   title     = {Foundations of group signatures: The case of dynamic groups},
@@ -1858,16 +1848,17 @@
   howpublished = {Cryptology ePrint Archive, Report 2015/479},
 }
 
-@InProceedings{FS87,
+@InProceedings{FS86,
   author    = {Fiat, Amos and Shamir, Adi},
-  title        = {How to prove yourself: Practical solutions to identification and signature problems},
+  title     = {How To Prove Yourself: Practical Solutions to Identification and Signature Problems},
-  booktitle    = {{Crypto}'86},
+  booktitle = {CRYPTO},
-  year         = {1987},
+  year      = {1986},
-  volume       = {263},
+  editor    = {Odlyzko, Andrew M.},
-  series       = {LNCS},
   pages     = {186--194},
-  organization = {Springer},
+  address   = {Berlin, Heidelberg},
-  publisher    = {Springer},
+  publisher = {Springer Berlin Heidelberg},
+  abstract  = {In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack if factoring is difficult, and typical implementations require only 1{\%} to 4{\%} of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessor-based devices such as smart cards, personal computers, and remote control systems.},
+  isbn      = {978-3-540-47721-1},
 }
 
 @InProceedings{GLF+10,
@@ -2565,4 +2556,66 @@
   isbn      = {1584885513},
 }
 
+@InProceedings{BR93,
+  author    = {Bellare, Mihir and Rogaway, Phillip},
+  title     = {Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols},
+  booktitle = {CCS},
+  year      = {1993},
+  publisher = {ACM},
+  acmid     = {168596},
+  doi       = {10.1145/168588.168596},
+  isbn      = {0-89791-629-8},
+  location  = {Fairfax, Virginia, USA},
+  numpages  = {12},
+  url       = {http://doi.acm.org/10.1145/168588.168596},
+}
+
+@Article{CGH04,
+  author     = {Canetti, Ran and Goldreich, Oded and Halevi, Shai},
+  title      = {The Random Oracle Methodology, Revisited},
+  journal    = {J. of ACM},
+  year       = {2004},
+  volume     = {51},
+  number     = {4},
+  pages      = {557--594},
+  month      = jul,
+  issn       = {0004-5411},
+  acmid      = {1008734},
+  address    = {New York, NY, USA},
+  doi        = {10.1145/1008731.1008734},
+  issue_date = {July 2004},
+  keywords   = {CS-proofs, Correlation intractability, cryptography, diagonalization, the random-oracle model},
+  numpages   = {38},
+  publisher  = {ACM},
+  url        = {http://doi.acm.org/10.1145/1008731.1008734},
+}
+
+@InProceedings{LLM+17,
+  author    = {Libert, Beno{\^i}t and Ling, San and Mouhartem, Fabrice and Nguyen, Khoa and Wang, Huaxiong},
+  title     = {Adaptive Oblivious Transfer with Access Control from Lattice Assumptions},
+  booktitle = {Asiacrypt 2017},
+  year      = {2017},
+  editor    = {Takagi, Tsuyoshi and Peyrin, Thomas},
+  pages     = {533--563},
+  address   = {Cham},
+  publisher = {Springer International Publishing},
+  isbn      = {978-3-319-70694-8},
+}
+
+@InProceedings{LMPY16,
+  author    = {Libert, Beno\^{\i}t and Mouhartem, Fabrice and Peters, Thomas and Yung, Moti},
+  title     = {Practical "Signatures with Efficient Protocols" from Simple Assumptions},
+  booktitle = {AsiaCCS},
+  year      = {2016},
+  pages     = {511--522},
+  publisher = {ACM},
+  acmid     = {2897898},
+  doi       = {10.1145/2897845.2897898},
+  isbn      = {978-1-4503-4233-9},
+  keywords  = {anonymous credentials, efficient privacy-enhancing protocols, group signatures, privacy, signature, signature with efficient protocols, simple cryptographic assumptions},
+  location  = {Xi'an, China},
+  numpages  = {12},
+  url       = {http://doi.acm.org/10.1145/2897845.2897898},
+}
+
 @Comment{jabref-meta: databaseType:bibtex;}