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 12 of 12 for “"lattice cryptography"”.

  1. Simply safe lattice cryptography

    Lattice cryptography has many compelling features, like security under worst-case hardness assumptions, apparent security against quantum attacks, efficiency and parallelism, and powerful constructions like fully homomorphic encryption. While standard constructions such as lattice-based key …

    gatech Repository record for Simply safe lattice cryptography (opens in a new tab)

  2. Frontiers in Lattice Cryptography and Program Obfuscation

    … we explore the frontiers of theory of cryptography along two lines. In the first direction, we explore Lattice Cryptography, which is the primary sub-area of post-quantum cryptographic research. Our first contribution is the construction of a deniable attribute-based encryption scheme …

    maryland Repository record for Frontiers in Lattice Cryptography and Program Obfuscation (opens in a new tab)

  3. Homomorphic Encryption and Cryptanalysis of Lattice Cryptography

    … is vulnerable to theft and misuse. Modern cryptography presents several powerful techniques that can help to solve the puzzle of how to harness data for use while at the same time protecting it---one such technique is homomorphic encryption that allows computations to be done on data while …

    clemson Repository record for Homomorphic Encryption and Cryptanalysis of Lattice Cryptography (opens in a new tab)

  4. Lattice-Based Cryptography: A Comparative Study of GGH and NTRU

    … thesis examines the mathematical foundations of lattice based cryptography, with a focus on Goldreich--Goldwasser--Halevi (GGH) and ``Number Theorists R Us" (NTRU). Fundamental concepts of lattice theory such as lattice bases, lattice reduction, Shortest Vector Problem (SVP), and Closest Vector …

    csusb Repository record for Lattice-Based Cryptography: A Comparative Study of GGH and NTRU (opens in a new tab)

  5. PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION

    Lattice cryptography has seen rapid development in the past decade due to its role in enabling various emerging technologies such as post-quantum public-key cryptosystems and Fully Homomorphic Encryption (FHE) schemes that allow computing on encrypted data. In spite of the attractiveness of these …

    nus Repository record for PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION (opens in a new tab) Download file for PRACTICAL POST-QUANTUM CRYPTOGRAPHY & FULLY HOMOMORPHIC ENCRYPTION ON GRAPHICS PROCESSORS: DESIGN & PERFORMANCE EVALUATION (opens in a new tab)

  6. Towards practical homomorphic encryption and efficient implementation

    … and their efficient implementation in PALISADE lattice cryptography software library is presented. Originally proposed by Gentry, bootstrapping plays a central role in extending a somewhat homomorphic encryption (SHE) scheme towards full homomorphism. Several novel techniques to extend …

    njit Repository record for Towards practical homomorphic encryption and efficient implementation (opens in a new tab)

  7. A Summary of the FV Homomorphic Encryption Scheme and the Average-Case Noise Growth

    … existing schemes. This includes a background on lattices, cyclotomic fields, rings of integers, and the underlying believed-to-be-hard problems existing schemes take advantage of. We will then shift our attention to the FV scheme which is based on the ring-LWE problem and is one of the main …

    sask Repository record for A Summary of the FV Homomorphic Encryption Scheme and the Average-Case Noise Growth (opens in a new tab)

  8. From lattices to tensor cores : accelerating communication-efficient private information retrieval

    … revealing which record was accessed. Modern lattice-based PIR reduces each query to a database matrix–vector product under linearly homomorphic encryption with preprocessing, producing a large query-independent hint that the client uses for decryption. At deployment-scale workloads, …

    texas Repository record for From lattices to tensor cores : accelerating communication-efficient private information retrieval (opens in a new tab)

  9. Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS

    Public key cryptography, as deployed on the internet today, stands on shaky ground. For over twenty years now it has been known that the systems in widespread use are insecure against adversaries equipped with quantum computers -- a fact that has largely been discounted due to the enormous …

    waterloo Repository record for Practical Lattice Cryptosystems: NTRUEncrypt and NTRUMLS (opens in a new tab)

  10. PRIVACY-PRESERVING COLLABORATIVE MACHINE LEARNING USING HOMOMORPHIC ENCRYPTION

    Homomorphic Encryption (HE) is an emerging field with great potential for safeguarding privacy in machine learning (ML) applications. It enables computations to be performed on encrypted data without requiring decryption, thereby offering new possibilities for ML applications that demand data …

    nus Repository record for PRIVACY-PRESERVING COLLABORATIVE MACHINE LEARNING USING HOMOMORPHIC ENCRYPTION (opens in a new tab) Download file for PRIVACY-PRESERVING COLLABORATIVE MACHINE LEARNING USING HOMOMORPHIC ENCRYPTION (opens in a new tab)

  11. Tight Multi-Target Security for Key Encapsulation Mechanisms

    … resistant to all known quantum attacks, such as lattice-based schemes. A desirable property for any KEM is multi-target security, capturing the idea that security does not degrade below the targeted level as the number of users of a protocol or the amount of communication per user scales to a …

    waterloo Repository record for Tight Multi-Target Security for Key Encapsulation Mechanisms (opens in a new tab)

  12. Anonimity-first time locks using proof of work /

    Anonimity-first Time Locks using Proof of Work.

    vilnius Repository record for Anonimity-first time locks using proof of work / (opens in a new tab)