Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 13 of 13 for “"Hash tree"”.

  1. Recursive hash trees

    … well to only a limited class of applications. Hash tables are one such DMS. This paper presents a series of assumptions that bound the applicability of hash tables and similar DMS. The chief focus of this paper is a particular variation of the standard hash table, the Recursive Hash Tree. The …

    ut-knoxville Repository record for Recursive hash trees (opens in a new tab)

  2. Algoritmy pro vyhledání nejdelšího shodného prefixu

    … poznatků představuje nový algoritmus Generic Hash Tree Bitmap. Ten je mnohonásobně rychlejší než jiné používané metody, zatímco jeho paměťové nároky jsou mnohdy nižší. Implementace algoritmu se stala součástí knihovny Netbench.

    brno-tech Repository record for Algoritmy pro vyhledání nejdelšího shodného prefixu (opens in a new tab)

  3. Toward practical verification of analytic queries: New authenticated data structures and cloud-assisted techniques

    … ADS called the Intersection and Function Merkle Hash tree (IFMH-tree), which integrates the Intersection tree (I-tree) and the Merkle hash tree (MH-tree). We develop both one-signature and multi-signature variants of the IFMH-tree and evaluate their effectiveness in supporting representative …

    iastate Repository record for Toward practical verification of analytic queries: New authenticated data structures and cloud-assisted techniques (opens in a new tab)

  4. Verifiable and redactable medical documents

    … for this solution examines the use of Merkle Hash Trees to provide the redaction and verification characteristics required. Using the Merkle Hash Tree, various Continuity of Care Documents will have their various elements extracted for storage in the signature scheme. An analysis of the …

    gatech Repository record for Verifiable and redactable medical documents (opens in a new tab)

  5. Digital Documentation of Urban Recreation Parks with 3D Geometry & Qualitative Information

    This doctoral thesis is about an “Internet of Trees” Blockchain case study for the smart forest industry and concerns the development of a customized and user-friendly tree-shape 2.5D model for the digital documentation and monitoring of the natural environment and urban recreation parks rich in …

    greece Repository record for Digital Documentation of Urban Recreation Parks with 3D Geometry & Qualitative Information (opens in a new tab)

  6. The Design and Implementation of a Verified File System with End-to-End Data Integrity

    … IFSCQ achieves this by constructing a Merkle hash tree of the whole disk, and by proving that tampered disk blocks will always be detected if they ever occur. We demonstrate that IFSCQ runs with reasonable overhead while detecting several kinds of attacks.

    rice Repository record for The Design and Implementation of a Verified File System with End-to-End Data Integrity (opens in a new tab)

  7. Forensic analysis of unallocated space

    … a space efficient data structure of fingerprint hash tables for storing the massive forensic data from law enforcement databases in a flash drive and utilizing hash tree indexing for fast searching. We also apply group testing to identify the fragmentation point of the file and locate the …

    uoit Repository record for Forensic analysis of unallocated space (opens in a new tab)

  8. Parity-based Data Outsourcing: Extension, Implementation, and Evaluation

    … of the PDO model. We compare it with Merkle Hash Tree (MH-tree) and Signature Chain, two existing techniques that support query authentication, in terms of storage, communication, and computation overhead.</p>

    iastate Repository record for Parity-based Data Outsourcing: Extension, Implementation, and Evaluation (opens in a new tab)

  9. Algorithms for Achieving Fault-tolerance and Ensuring Security in Cloud Computing Systems

    … a challenge-response protocol based on Merkle hash tree data structure. Our second scheme is a slight variation of the first one, where we introduce some approaches to overcome the limitations of convergent encryption. In this scheme, we use ciphertext policy attribute-based access structure to …

    uky-thes Repository record for Algorithms for Achieving Fault-tolerance and Ensuring Security in Cloud Computing Systems (opens in a new tab)

  10. Improved Internet Security Protocols Using Cryptographic One-Way Hash Chains

    … that utilize the one-way cryptographic hash functions in designing improved network security protocols are investigated. The proposed approaches are designed to be scalable and easy to implement in modern technology. The first contribution explores session cookies with emphasis on the …

    ucf Repository record for Improved Internet Security Protocols Using Cryptographic One-Way Hash Chains (opens in a new tab)

  11. Toward securing links and large-scale

    … are node collaboration for entity authenticity, hash tree for data authenticity, and random network coding for data availability. This scheme is the first one in its category that provides a practical solution to all the aforementioned security services.

    gatech Repository record for Toward securing links and large-scale (opens in a new tab)

  12. Preserving privacy with user-controlled sharing of verified information

    Personal information, especially certified personal information, can be very valuable to its subject, but it can also be abused by other parties for identify theft, blackmail, fraud, and more. One partial solution to the problem is credentials, whereby personal information is tied to identity, for …

    gatech Repository record for Preserving privacy with user-controlled sharing of verified information (opens in a new tab)

  13. ALGORITHMS AND DATA STRUCTURES TO DETECT ONCOVIRUSES IN HUMAN CANCER USING NEXT GENERATION SEQUENCING DATA

    … speed and memory usage. Data structures such as hash and tree are widely implemented to improve the performance of computing algorithms. Here, I described both data structures that have been developed in our center and compared their performance. Hash out performed tree when mapping the reads to …

    houston Repository record for ALGORITHMS AND DATA STRUCTURES TO DETECT ONCOVIRUSES IN HUMAN CANCER USING NEXT GENERATION SEQUENCING DATA (opens in a new tab)