Ensuring correctness, completeness, and Freshness for Outsourced Tree-Indexed Data

被引:6
|
作者
Tran Khanh Dang [1 ,2 ]
机构
[1] Natl Univ Ho Chi Minh City, Fac Comp Sci & Engn, Ho Chi Minh City, Vietnam
[2] Middlesex Univ, Sch Comp Sci, London, England
关键词
database services outsourcing; dynamic search trees; query assurance; security and privacy; untrusted servers;
D O I
10.4018/irmj.2008010104
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
In an outsourced database service model, query assurance takes an important role among well-known security issues. To the best of our knowledge, however, none of the existing research work has dealt with ensuring the query assurance for outsourced tree-indexed data. To address this issue, the system must prove authenticity and data integrity, completeness, and freshness guarantees for the result set. These objectives imply that data in the result set is originated from the actual data owner and has not been tampered with; the server did not omit any tuples matching the query conditions; and the result set was generated with respect to the most recent snapshot of the database. In this paper, we propose a vanguard solution to provide query assurance for outsourced tree-indexed data on untrusted servers with high query assurance and at reasonable costs. Experimental results with real datasets confirm the effciency of our approach and theoretical analyses.
引用
下载
收藏
页码:59 / 76
页数:18
相关论文
共 50 条
  • [1] Providing Query Assurance for Outsourced Tree-Indexed Data
    Dang, Tran Khanh
    Son, Nguyen Thanh
    MODELING, SIMULATION AND OPTIMIZATION OF COMPLEX PROCESSES, 2008, : 207 - 224
  • [2] Tree-indexed processes
    Pemantle, R
    STATISTICAL SCIENCE, 1995, 10 (02) : 200 - 213
  • [3] THE RANGE OF TREE-INDEXED RANDOM WALK
    Le Gall, Jean-Francois
    Lin, Shen
    JOURNAL OF THE INSTITUTE OF MATHEMATICS OF JUSSIEU, 2016, 15 (02) : 271 - 317
  • [4] On the existence of accessibility in a tree-indexed percolation model
    Coletti, Cristian F.
    Gava, Renato J.
    Rodriguez, Pablo M.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 492 : 382 - 388
  • [5] CAPACITY OF THE RANGE OF TREE-INDEXED RANDOM WALK
    Bai, Tianyi
    Wan, Yijun
    ANNALS OF APPLIED PROBABILITY, 2022, 32 (03): : 1557 - 1589
  • [6] On the distribution of range for tree-indexed random walks
    Berger, Aaron
    Ji, Caleb
    Metz, Erik
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 81 : 256 - 264
  • [7] Random fractals and tree-indexed Markov chains
    Durand, Arnaud
    REVISTA MATEMATICA IBEROAMERICANA, 2009, 25 (03) : 1089 - 1126
  • [8] THE RANGE OF TREE-INDEXED RANDOM WALK IN LOW DIMENSIONS
    Le Gall, Jean-Francois
    Lin, Shen
    ANNALS OF PROBABILITY, 2015, 43 (05): : 2701 - 2728
  • [9] A conditional limit theorem for tree-indexed random walk
    Le Gall, JF
    STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2006, 116 (04) : 539 - 567
  • [10] On stopping rules for tree-indexed quantum Markov chains
    Souissi, Abdessatar
    INFINITE DIMENSIONAL ANALYSIS QUANTUM PROBABILITY AND RELATED TOPICS, 2023, 26 (03)