Pages that link to "Item:Q5418699"

The following pages link to GGHLite: More Efficient Multilinear Maps from Ideal Lattices (Q5418699):

Displaying 23 items.

• Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
• A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
• Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
• How to build time-lock encryption (Q1791669) (← links)
• On the integer polynomial learning with errors problem (Q2061918) (← links)
• On the robustness of randomized classifiers to adversarial examples (Q2102396) (← links)
• Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
• Cryptanalysis of multilinear maps from ideal lattices: revisited (Q2407051) (← links)
• On the hardness of module learning with errors with short distributions (Q2677644) (← links)
• Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
• On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
• A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586) (← links)
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero (Q2971014) (← links)
• Practical Order-Revealing Encryption with Limited Leakage (Q4639494) (← links)
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
• Provably Secure NTRU Instances over Prime Cyclotomic Rings (Q5738796) (← links)
• Computing Generator in Cyclotomic Integer Rings (Q5738871) (← links)
• Short Stickelberger Class Relations and Application to Ideal-SVP (Q5738882) (← links)
• A polynomial time algorithm for breaking NTRU encryption with multiple keys (Q6109713) (← links)
• Generating subgroups of ray class groups with small prime ideals (Q6165881) (← links)
• Hardness of (M)LWE with semi-uniform seeds (Q6204543) (← links)