book chapter · Lecture notes in computer science · 2015

How Secure is Deterministic Encryption?

Mihir Bellare, Rafael Dowsley, Sriram Keelveedhi

Cited by 13Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Bellare, M., Dowsley, R., & Keelveedhi, S. (2015). How Secure is Deterministic Encryption? Lecture notes in computer science, 52–73. https://doi.org/10.1007/978-3-662-46447-2_3

MLA 9

Bellare, Mihir, et al. “How Secure is Deterministic Encryption?” Lecture notes in computer science, 2015, pp. 52–73, https://doi.org/10.1007/978-3-662-46447-2_3.

Chicago

Bellare, Mihir, Rafael Dowsley, and Sriram Keelveedhi. 2015. “How Secure is Deterministic Encryption?” Lecture notes in computer science: 52–73. https://doi.org/10.1007/978-3-662-46447-2_3.

Harvard

Bellare, M., Dowsley, R. and Keelveedhi, S. (2015) ‘How Secure is Deterministic Encryption?’, Lecture notes in computer science, pp. 52–73. Available at: https://doi.org/10.1007/978-3-662-46447-2_3.

BibTeX

@incollection{bellare2015secure,
  title = {{How Secure is Deterministic Encryption?}},
  author = {Bellare, Mihir and Dowsley, Rafael and Keelveedhi, Sriram},
  booktitle = {Lecture notes in computer science},
  pages = {52--73},
  year = {2015},
  doi = {10.1007/978-3-662-46447-2_3}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.