Dec 17, 2021 · One of the most important computational problems in lattice theory is the Shortest Vector Problem (SVP) which aims to find the shortest nonzero ...
Dec 17, 2021 · Ajtai, M.: The shortest vector problem in L 2 is NP-hard for randomized reductions (extended abstract). In: Vitter, J.S. (ed.) Proceedings of ...
Approximating the shortest vector of a given lattice is one of the most important computational problems in public-key cryptanalysis and lattice-based ...
Jun 21, 2019 · Solving these involves the Lenstra–Lenstra–Lovász lattice basis reduction algorithm, or LLL. This algorithm is the quintessential lattice ...
Missing: Cloud- Assisted Secure Outsourcing
Abstract. We investigate the problem of securely outsourcing the modular exponentiations in cryptography to an untrusted server, and analyze the security and ...
Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem. Xiulan Li, Yanbin Pan, Chengliang Tian. To appear ...
We propose a lattice basis reduction scheme such that the clients can outsource their main computation workloads to the untrusted cloud servers. We employ ...
Sep 21, 2018 · Abstract—Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the.
Missing: Vector | Show results with:Vector
We propose a lattice basis reduction scheme such that the clients can outsource their main computation workloads to the untrusted cloud servers. We employ ...
Approximating the shortest vector of a given lattice is one of the most important computational problems in public-key cryptanalysis and lattice-based ...