|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2008 IEEE 24th International Conference on Data Engineering
Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors
Cancun, Mexico
April 07-April 12
ISBN: 978-1-4244-1836-7
| ASCII Text | x | ||
| Mikhail J. Atallah, YounSun Cho, Ashish Kundu, "Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors," Data Engineering, International Conference on, pp. 696-704, 2008 IEEE 24th International Conference on Data Engineering, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDE.2008.4497478, author = {Mikhail J. Atallah and YounSun Cho and Ashish Kundu}, title = {Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors}, journal ={Data Engineering, International Conference on}, volume = {0}, year = {2008}, isbn = {978-1-4244-1836-7}, pages = {696-704}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDE.2008.4497478}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Data Engineering, International Conference on TI - Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors SN - 978-1-4244-1836-7 SP696 EP704 A1 - Mikhail J. Atallah, A1 - YounSun Cho, A1 - Ashish Kundu, PY - 2008 VL - 0 JA - Data Engineering, International Conference on ER - | |||
In the third-party model for the distribution of data, the trusted data creator or owner provides an untrusted party D with data and integrity verification (IV) items for that data. When a user U gets a subset of the data at D or is already in possession of that subset, U may request from D the IV items that make it possible for U to verify the integrity of its data: D must then provide u with the (hopefully small) number of needed IVs. Most of the published work in this area uses the Merkle tree or variants thereof. For the problem of 2-dimensional range data, the best published solutions require D to store O(n log n) IV items for a database of n items, and allow a user U to be sent only O(log n) of those IVs for the purpose of verifying the integrity of the data it receives from D (regardless of the size of U's query rectangle). For data that is modeled as a 2-dimensional grid (such as GIS or image data), this paper shows that better bounds are possible: The number of IVs stored at D (and the time it takes to compute them) can be brought down to O(n), and the number of IVs sent to U for verification can be brought down to a constant.
Citation:
Mikhail J. Atallah, YounSun Cho, Ashish Kundu, "Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors," icde, pp.696-704, 2008 IEEE 24th International Conference on Data Engineering, 2008
Usage of this product signifies your acceptance of the Terms of Use.