Copy

Satoshi NAKAYAMA, Maki YOSHIDA, Shingo OKAMURA, Toru FUJIWARA, "A Private and Consistent Data Retrieval Scheme with Log-Squared Communication" in IEICE TRANSACTIONS on Fundamentals, vol. E90-A, no. 1, pp. 204-215, January 2007, doi:10.1093/ietfec/e90-a.1.204.
Abstract:Data retrieval is used to obtain a particular data item from a database. A user requests an item in the database from a database server by sending a query, and obtains the item from an answer to the query. Security requirements of data retrieval include protecting the privacy of the user, the secrecy of the database, and the consistency of answers. In this paper, a data retrieval scheme which satisfies all the security requirements is defined and an efficient construction is proposed. In the proposed construction, the size of a query and an answer isO((logN)²), and the size of data published by the database server when the database is updated is onlyO(1). The proposed construction uses the Merkle tree, a commitment scheme, and Oblivious Transfer. The proof of the security is given under the assumption that the used cryptographic schemes are secure.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e90-a.1.204/_p

Copy

@ARTICLE{e90-a_1_204,
author={Satoshi NAKAYAMA, Maki YOSHIDA, Shingo OKAMURA, Toru FUJIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Private and Consistent Data Retrieval Scheme with Log-Squared Communication},
year={2007},
volume={E90-A},
number={1},
pages={204-215},
abstract={Data retrieval is used to obtain a particular data item from a database. A user requests an item in the database from a database server by sending a query, and obtains the item from an answer to the query. Security requirements of data retrieval include protecting the privacy of the user, the secrecy of the database, and the consistency of answers. In this paper, a data retrieval scheme which satisfies all the security requirements is defined and an efficient construction is proposed. In the proposed construction, the size of a query and an answer isO((logN)²), and the size of data published by the database server when the database is updated is onlyO(1). The proposed construction uses the Merkle tree, a commitment scheme, and Oblivious Transfer. The proof of the security is given under the assumption that the used cryptographic schemes are secure.},
keywords={},
doi={10.1093/ietfec/e90-a.1.204},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - A Private and Consistent Data Retrieval Scheme with Log-Squared Communication
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 204
EP - 215
AU - Satoshi NAKAYAMA
AU - Maki YOSHIDA
AU - Shingo OKAMURA
AU - Toru FUJIWARA
PY - 2007
DO -10.1093/ietfec/e90-a.1.204
JO - IEICE TRANSACTIONS on Fundamentals
SN -1745-1337
VL - E90-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2007
AB -Data retrieval is used to obtain a particular data item from a database. A user requests an item in the database from a database server by sending a query, and obtains the item from an answer to the query. Security requirements of data retrieval include protecting the privacy of the user, the secrecy of the database, and the consistency of answers. In this paper, a data retrieval scheme which satisfies all the security requirements is defined and an efficient construction is proposed. In the proposed construction, the size of a query and an answer isO((logN)²), and the size of data published by the database server when the database is updated is onlyO(1). The proposed construction uses the Merkle tree, a commitment scheme, and Oblivious Transfer. The proof of the security is given under the assumption that the used cryptographic schemes are secure.
ER -