Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem

DOI10.1007/978-3-030-93206-0_14zbMath1499.68051OpenAlexW4205301524MaRDI QIDQ5095931

Yanbin Pan, Chengliang Tian, Xiulan Li

Publication date: 11 August 2022

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-93206-0_14

zbMATH Keywords

Gram matrixcloud computingunimodular transformationoutsourcing computationapproximate SVP

Mathematics Subject Classification ID

Cryptography (94A60) Internet topics (68M11) Computer security (68M25)

Uses Software

• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient computation outsourcing for inverting a class of homomorphic functions
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Blockchain-based two-party fair contract signing scheme
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
• New Algorithms for Secure Outsourcing of Modular Exponentiations
• Finding a Small Root of a Univariate Modular Equation
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• LLL reducing with the most significant bits
• An Efficient LLL Gram Using Buffered Transformations
• Trapdoors for hard lattices and new cryptographic constructions
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• Floating-Point LLL Revisited
• Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
• Theory of Cryptography
• Algorithmic Number Theory

This page was built for publication: Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem