Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Zahyun Koo"'
Publikováno v:
IEEE Access, Vol 11, Pp 50310-50324 (2023)
As cloud computing and AI as a Service are provided, it is increasingly necessary to deal with privacy sensitive data. To deal with the sensitive data, there are two cases of outsourcing process: i) many clients participate dynamically ii) many clien
Externí odkaz:
https://doaj.org/article/b533193df91741b4a729a6de6d224958
Publikováno v:
IEEE Access, Vol 9, Pp 157083-157092 (2021)
Many lattice-based cryptographic schemes are constructed based on hard problems on an algebraic structured lattice, such as the short integer solution (SIS) problems. These problems are called ring-SIS (R-SIS) and its generalized version, module-SIS
Externí odkaz:
https://doaj.org/article/94daf2a2d4064d24a8a2ccc2c8f275dd
Publikováno v:
IEEE Access, Vol 8, Pp 140998-141006 (2020)
Lattice-based cryptographic scheme is constructed based on hard problems on a lattice such as the short integer solution (SIS) problem and the learning with error (LWE). However, the cryptographic scheme based on SIS or LWE is inefficient since the s
Externí odkaz:
https://doaj.org/article/178e468d785c40e6b7555f1ebaad0c32
Publikováno v:
2022 13th International Conference on Information and Communication Technology Convergence (ICTC).
Publikováno v:
IEEE Access, Vol 9, Pp 157083-157092 (2021)
Many lattice-based cryptographic schemes are constructed based on hard problems on an algebraic structured lattice, such as the short integer solution (SIS) problems. These problems are called ring-SIS (R-SIS) and its generalized version, module-SIS
Publikováno v:
IEEE Access, Vol 8, Pp 140998-141006 (2020)
Lattice-based cryptographic scheme is constructed based on hard problems on a lattice such as the short integer solution (SIS) problem and the learning with error (LWE). However, the cryptographic scheme based on SIS or LWE is inefficient since the s