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 20 of 40 for “"Learning With Errors"”.

  1. Performance Comparison of Learning with Errors Cryptosystems

    … even in the quantum setting. In particular, the Learning with Errors (LWE) problem, introduced by Regev, gives a means for constructing numerous public key cryptosystems with very strong proofs of security based on the hardness of finding a short vector in a lattice. We analyze and compare the …

    rit Repository record for Performance Comparison of Learning with Errors Cryptosystems (opens in a new tab)

  2. Algebraic Number Theory and Lattice-Based Cryptography: Equivalence and Cryptanalysis of RLWE and PLWE

    … One of the well-studied lattice problems is the Learning with Errors (LWE) problem, which was introduced by Oded Regev in 2005. He showed that LWE is at least as hard as certain worst-case lattice problems, which are believed to remain hard even for quantum computers. Despite its strong security …

    aalto Repository record for Algebraic Number Theory and Lattice-Based Cryptography: Equivalence and Cryptanalysis of RLWE and PLWE (opens in a new tab)

  3. Fast Bootstrapping in Z_q

    … technique to compute the NAND gate using the Learning With Errors cryptosystem (LWE), along with a novel bootstrapping technique that turns turns this cryptosystem into a fully-homomorphic encryption scheme that allows a very short and fast implementation. We present an extension of their …

    waterloo Repository record for Fast Bootstrapping in Z_q (opens in a new tab)

  4. Maximal curves, zeta functions, and digital signatures

    Curves with as many points as possible over a finite field Fq under the Hasse-Weil bound are called maximal curves. Besides being interesting as extremal objects, maximal curves have applications in coding theory. A maximal curves may also have a great deal of symmetry, i.e. have an automorphism …

    colostate Repository record for Maximal curves, zeta functions, and digital signatures (opens in a new tab)

  5. ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY

    … for all polynomial-size Branching Programs from Learning With Errors assumption (Regev STOC’05). Attribute based encryption (ABE) is an advanced encryption system with a built-in mechanism to generate keys associated with functions which in turn provide restricted access to encrypted data. Most …

    cornell Repository record for ATTRIBUTE-BASED ENCRYPTIONS AND FORMAL VERIFICATION OF LATTICE-BASED CRYPTOGRAPHY (opens in a new tab)

  6. Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes

    … area, one of the most promising ideas being the Learning With Errors (LWE) problem posed by Oded Regev's. Although this problem has proved to be versatile as a basis for homomorphic encryption schemes, the large key sizes result in a quadratic overhead making this inefficient for practical …

    rit Repository record for Cyclotomic Polynomials in Ring-LWE Homomorphic Encryption Schemes (opens in a new tab)

  7. Smoothening Functions and the Homomorphism Learning Problem

    … certain algebraic and geometrical aspects of the Learning With Errors (LWE) problem introduced in Reg05. On the algebraic front, we view it as a Learning Homomorphisms with Noise problem, and provide a generic construction of a public-key cryptosystem based on this generalization. On the geometric …

    waterloo Repository record for Smoothening Functions and the Homomorphism Learning Problem (opens in a new tab)

  8. A Survey on Homomorphic Encryption Based on the Learning with Rounding Problem

    Much of modern day cryptography deals with the notion of security and efficiency. The main concern with any cryptosystem deals with the practicality of being able to implement any encryption algorithm over large data sets. In this paper, we will look at the various properties of the Learning With …

    boise Repository record for A Survey on Homomorphic Encryption Based on the Learning with Rounding Problem (opens in a new tab)

  9. Homomorphic Encryption

    … improvements to the underlying lemmas dealing with modulus switching and noise management, and show that the lemmas as currently stated are false. We then examine a lower bound on the hardness of the Learning With Errors lattice problem, and use this to develop specific parameters for the BGV …

    waterloo Repository record for Homomorphic Encryption (opens in a new tab)

  10. Non-Interactive Proofs: What Assumptions Are Sufficient?

    … can we build non-interactive proof systems with succinct verification and zero-knowledge. We obtain the following results. - Succinct Arguments: We construct the first non-interactive succinct arguments (SNARGs) for P from standard assumptions. Our construction is based on the polynomial …

    jhu Repository record for Non-Interactive Proofs: What Assumptions Are Sufficient? (opens in a new tab)

  11. More Than Error Correction: Cryptography from Codes

    … fully homomorphic encryption scheme based on Learning with Errors, a code-related problem, designed by Brakerski et al. We will also cover algebraic manipulation detection codes, a newly proposed extension of error-correcting codes and a lightweight alternative to MACs as an authentication …

    waterloo Repository record for More Than Error Correction: Cryptography from Codes (opens in a new tab)

  12. Post-quantum cryptographic algorithms

    … cryptographic algorithms designed to withstand the capabilities of quantum devices. Our research encompasses a diverse array of cryptographic primitives with a particular focus on lattice-based algorithms, empahasing on their security, efficiency, and applicability in real-world …

    greece Repository record for Post-quantum cryptographic algorithms (opens in a new tab)

  13. Reduction-Respecting Parameters for Lattice-Based Cryptosystems

    … current lattice-based cryptosystems using the learning with errors (LWE) problem select parameters for which the reduction to the underlying lattice problem gives no meaningful assurance of concrete security. We analyze the runtime of the algorithm constructed in the reductions and select …

    mcmaster Repository record for Reduction-Respecting Parameters for Lattice-Based Cryptosystems (opens in a new tab)

  14. Cryptanalysis by Algebraic Relations

    … polynomial equation systems. Equipped with algebraic relations of small degree, we will then show lower bounds for primitives of two cryptographic areas: Pseudorandom Generators. A pseudorandom generator (PRG) is a deterministic function that stretches a random bit string to a longer …

    ethz Repository record for Cryptanalysis by Algebraic Relations (opens in a new tab)

  15. Homomorphic Encryption and Cryptanalysis of Lattice Cryptography

    … studying certain attacks against the Ring Learning with Errors problem, 4. precisely characterizing the performance of an algorithm for solving the Approximate Common Divisor problem.

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

  16. Homomorphic Encryption: Computing on encrypted data

    … compute mathematical functions on encrypted data without decryption. The output of the computations is itself in encrypted form which when decrypted is identical to the output had the computation been performed on the plaintexts directly. A homomorphic encryption scheme is said to be fully …

    chalmers Repository record for Homomorphic Encryption: Computing on encrypted data (opens in a new tab)

  17. Bridging Early and Modern Lattice Cryptosystems: A Theoretical Journey through SVP, LWE and Kyber

    … problems. The thesis then details Regev's Learning with Errors (LWE) problem and shows its impact on the development of practical public-key schemes while maintaining the security guarantees from the well-studied worst-case lattice problems. Further, we discuss the structured variants such …

    waterloo Repository record for Bridging Early and Modern Lattice Cryptosystems: A Theoretical Journey through SVP, LWE and Kyber (opens in a new tab)

  18. Overstretched Parameters in Lattice-Based Cryptography

    Lattice-based cryptosystems such as Learning With Errors (LWE) and NTRU have gained popularity as one of the main methods for constructing cryptosystems secure against a quantum attacker. The process of instantiating these involves fixing multiple parameters based on cost estimates for performing …

    chalmers Repository record for Overstretched Parameters in Lattice-Based Cryptography (opens in a new tab)

  19. Homomorphic Encryption and the Approximate GCD Problem

    With the advent of cloud computing, everyone from Fortune 500 businesses to personal consumers to the US government is storing massive amounts of sensitive data in service centers that may not be trustworthy. It is of vital importance to leverage the benefits of storing data in the cloud while …

    clemson Repository record for Homomorphic Encryption and the Approximate GCD Problem (opens in a new tab)

Page 1 of 2