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 17 of 17 for “"Hashing (Computer science)"”.

  1. Perceptually based methods for robust image hashing

    … of conventional cryptographic (and other) hashing algorithms such as message digest 5 (MD5) and secure hash algorithm 1 (SHA-1) is that they are extremely sensitive to the message; i.e., changing even one bit of the input message will change the output dramatically. However, multimedia data …

    texas Repository record for Perceptually based methods for robust image hashing (opens in a new tab)

  2. Perfect hashing and related problems

    One of the most common tasks in many computer applications is the maintenance of a dictionary of words. The three most basic operations on the dictionary are find, insert, and delete. An important data structure that supports these operations is a hash table. On a hash table, a basic operation …

    vt Repository record for Perfect hashing and related problems (opens in a new tab)

  3. Direct perfect hashing functions for external files

    … (M.S.)--Michigan State University. Department of Computer Science, 1988

    msu Repository record for Direct perfect hashing functions for external files (opens in a new tab)

  4. Improving Cuckoo Hashing with Perfect Hashing

    In computer science, the data structure is a systematic way of organizing data such that it can be used efficiently. There are many hashing techniques that aim at storing keys in memory to increase key access efficiency and to make hashing efficient. One option to increase throughput is to use the …

    umkc Repository record for Improving Cuckoo Hashing with Perfect Hashing (opens in a new tab)

  5. On the security and efficiency of encryption

    This thesis is concerned with the design and analysis of practical provably-secure encryption schemes. We give several results that include new schemes with attractive tradeoffs between efficiency and security and new techniques for analyzing existing schemes. Our results are divided into three …

    gatech Repository record for On the security and efficiency of encryption (opens in a new tab)

  6. Privacy Preserving EEG-based Authentication Using Perceptual Hashing

    … the user accurately. In that, perceptual hashing is utilized and instead of raw EEG signals, their perceptually hashed values are used in the authentication process. In addition to describing the authentication process, algorithms to compute the perceptual hash are developed based on two …

    unt Repository record for Privacy Preserving EEG-based Authentication Using Perceptual Hashing (opens in a new tab)

  7. Space-efficient data sketching algorithms for network applications

    Sketching techniques are widely adopted in network applications. Sketching algorithms “encode” data into succinct data structures that can later be accessed and “decoded” for various purposes, such as network measurement, accounting, anomaly detection and etc. Bloom filters and counter braids are …

    gatech Repository record for Space-efficient data sketching algorithms for network applications (opens in a new tab)

  8. Towards Efficient Delivery of Dynamic Web Content

    … into cooperative clouds was presented. Dynamic hashing technique for efficient, load-balanced, and reliable documents lookups and updates was presented. Utility-based scheme for cooperative document placement in cache clouds was proposed. The proposed architecture and techniques were evaluated …

    gatech Repository record for Towards Efficient Delivery of Dynamic Web Content (opens in a new tab)

  9. Deep Hashing for Image Similarity Search

    Hashing for similarity search is one of the most widely used methods to solve the approximate nearest neighbor search problem. In this method, one first maps data items from a real valued high-dimensional space to a suitable low dimensional binary code space and then performs the approximate …

    ucf Repository record for Deep Hashing for Image Similarity Search (opens in a new tab)

  10. Towards Designing Energy-Efficient Secure Hashes

    In computer security, cryptographic algorithms and protocols are required to ensure security of data and applications. This research investigates techniques to reduce the energy consumed by cryptographic hash functions. The specific hash functions considered are Message Digest-2 (MD2), Message …

    unf Repository record for Towards Designing Energy-Efficient Secure Hashes (opens in a new tab) Download PDF for Towards Designing Energy-Efficient Secure Hashes (opens in a new tab)

  11. Energy-efficient HMAC for wireless communications

    … resting upon repeated use of the SHA256 hashing operator, impose additional resource requirements and thus also impact system availability. We address this particular integrity/availability trade-off by proposing an energy-saving algorithmic engineering method on the internal SHA256 …

    unf Repository record for Energy-efficient HMAC for wireless communications (opens in a new tab) Download PDF for Energy-efficient HMAC for wireless communications (opens in a new tab)

  12. Confidential remote computing

    <p>Since their market launch in late 2015, trusted hardware enclaves have revolutionised the computing world with data-in-use protections. Their security features of confidentiality, integrity and attestation attract many application developers to move their valuable assets, such as cryptographic …

    oxford Repository record for Confidential remote computing (opens in a new tab)