article · 2002

Undeniable Replies For Database Queries

Ahto Buldas, Meelis Roos, Jan Willemson, Cybernetica As

Cited by 0Abstract and details only

Abstract

Let D be a public on-line database that is maintained by a party who is possibly not completely trustworthy. We study cryptographic techniques preventing the party (1) from undetectably modifying the content of D, and (2) from giving contradictory answers to the same query q, after a relatively short cryptographic digest d of D is made public. Previous work by Buldas, Laud and Lipmaa gives efficient solution for queries that require the answer Yes or No. The goal of this paper is to widen the scope of their techniques and cover much more complex types of queries. We present efficient methods for the queries that return a list of consecutive records as the reply. We show that the amount of additional cryptographic code that must be included into the answer can still remain quite small.

Cite this paper

APA 7

Buldas, A., Roos, M., Willemson, J., & As, C. (2002). Undeniable Replies For Database Queries.

MLA 9

Buldas, Ahto, et al. “Undeniable Replies For Database Queries.” 2002.

Chicago

Buldas, Ahto, Meelis Roos, Jan Willemson, and Cybernetica As. 2002. “Undeniable Replies For Database Queries.”

Harvard

Buldas, A. et al. (2002) ‘Undeniable Replies For Database Queries’.

BibTeX

@article{buldas2002undeniable,
  title = {{Undeniable Replies For Database Queries}},
  author = {Buldas, Ahto and Roos, Meelis and Willemson, Jan and As, Cybernetica},
  year = {2002}
}

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