Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 590669

Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets


Kontak, Vanja; Srbljić, Siniša; Škvorc, Dejan
Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets // Proceedings of the 35th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2012)
Opatija, 2012. str. 1496-1501 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


CROSBI ID: 590669 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets

Autori
Kontak, Vanja ; Srbljić, Siniša ; Škvorc, Dejan

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of the 35th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2012) / - Opatija, 2012, 1496-1501

ISBN
978-1-4673-2577-6

Skup
35th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2012)

Mjesto i datum
Opatija, Hrvatska, 21-25.05.2012

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
hashing ; cryptography ; error detection and localization ; space efficiency

Sažetak
One of primary components of computer systems security is preservation of data integrity. In addition to violation prevention, it also includes methods used to detect such violations after they occur. The most common methods for preserving integrity of binary data are based on various hashing functions. However, an inherent downside of using hashing functions is that a single hash can only be used to verify integrity of a single data string as a whole. This results in it being impossible to locate the exact position within the string where the change occurred. Alternative method entails splitting the data string into blocks, each protected by a hash. While this enables more precise location of changes, storing potentially large number of hashes imposes significant space overhead for large data sets. In this paper, we present a space-efficient method for detection and localization of unwanted changes in large data sets. Our method reuses the idea of splitting data into blocks and hashing each block separately, but with certain added properties: logarithmic instead of linear increase of memory space required to store hashes, ease of parallelization, possible application on distributed data, limited self-verification of hashes and efficient recalculation of hashes for dynamically changing data.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Projekti:
036-0362980-1921 - Računalne okoline za sveprisutne raspodijeljene sustave (Srbljić, Siniša, MZOS ) ( POIROT)

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Dejan Škvorc (autor)

Avatar Url Siniša Srbljić (autor)

Citiraj ovu publikaciju

Kontak, Vanja; Srbljić, Siniša; Škvorc, Dejan
Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets // Proceedings of the 35th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2012)
Opatija, 2012. str. 1496-1501 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
Kontak, V., Srbljić, S. & Škvorc, D. (2012) Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets. U: Proceedings of the 35th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO 2012).
@article{article, year = {2012}, pages = {1496-1501}, keywords = {hashing, cryptography, error detection and localization, space efficiency}, isbn = {978-1-4673-2577-6}, title = {Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets}, keyword = {hashing, cryptography, error detection and localization, space efficiency}, publisherplace = {Opatija, Hrvatska} }
@article{article, year = {2012}, pages = {1496-1501}, keywords = {hashing, cryptography, error detection and localization, space efficiency}, isbn = {978-1-4673-2577-6}, title = {Hashing Scheme for Space-efficient Detection and Localization of Changes in Large Data Sets}, keyword = {hashing, cryptography, error detection and localization, space efficiency}, publisherplace = {Opatija, Hrvatska} }




Contrast
Increase Font
Decrease Font
Dyslexic Font