Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Jun Kogure"'
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 460-485 (2020)
Since Semaev introduced summation polynomials in 2004, a number of studies have been devoted to improving the index calculus method for solving the elliptic curve discrete logarithm problem (ECDLP) with better complexity than generic methods such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0e80c5dd0ed981c24ad8aef2493f407e
https://doi.org/10.1515/jmc-2019-0029
https://doi.org/10.1515/jmc-2019-0029
Publikováno v:
Journal of Mathematical Cryptology, Vol 11, Iss 1, Pp 1-24 (2017)
In 2015, Fukase and Kashiwabara proposed an efficient method to find a very short lattice vector. Their method has been applied to solve Darmstadt shortest vector problems of dimensions 134 to 150. Their method is based on Schnorr’s random sampling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40d182c0d82a02f40987a9ab00b555cd
https://doi.org/10.1515/jmc-2016-0008
https://doi.org/10.1515/jmc-2016-0008
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing. 27:493-521
The RSA cryptosystem and elliptic curve cryptography (ECC) have been used practically and widely in public key cryptography. The security of RSA and ECC respectively relies on the computational hardness of the integer factorization problem (IFP) and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fd0586c9673091e8a07ce99613ffd04
https://doi.org/10.1007/s00200-016-0291-x
https://doi.org/10.1007/s00200-016-0291-x
Publikováno v:
Security and Communication Networks. 8:2194-2213
Somewhat homomorphic encryption is public key encryption supporting a limited number of additions and multiplications on encrypted data. This encryption gives a powerful tool in performing meaningful computations with protecting data confidentiality,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f9d29596bf7960dce179d47d284f9c7
https://doi.org/10.1002/sec.1164
https://doi.org/10.1002/sec.1164
Publikováno v:
Journal of Mathematical Cryptology, Vol 8, Iss 3, Pp 305-329 (2014)
In this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encrypti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c7780fc37381642e1c55e1622ef7411
https://doaj.org/article/0f52c51c11e44e7f9605e409875bd5d5
https://doaj.org/article/0f52c51c11e44e7f9605e409875bd5d5
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :903-908
SUMMARY The subset sum problem, which is often called as the knapsack problem, is known as an NP-hard problem, and there are several cryptosystems based on the problem. Assuming an oracle for shortest vector problem of lattice, the low-density attack
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f77625d4d366d0aace9083498e0fb0c0
https://doi.org/10.1587/transfun.e95.a.903
https://doi.org/10.1587/transfun.e95.a.903
Publikováno v:
IEICE ESS Fundamentals Review. 1:58-70
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1498b479b7cac6d37ca1ef01286f4d6a
https://doi.org/10.1587/essfr.1.3_58
https://doi.org/10.1587/essfr.1.3_58
Publikováno v:
Designs, Codes and Cryptography. 43:47-59
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost all the problems of density
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d69cdbd74b3f896b050fca458b8bdce1
https://doi.org/10.1007/s10623-007-9058-5
https://doi.org/10.1007/s10623-007-9058-5
Publikováno v:
SCC@ASIACCS
Homomorphic encryption can support meaningful operations on encrypted data, and hence it enables users to outsource their data in encrypted format to cloud services. However, homomorphic encryption cannot operate on ciphertexts with different keys in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfa478767b01c5063807e8762f30f9e0
https://doi.org/10.1145/2732516.2732521
https://doi.org/10.1145/2732516.2732521
Publikováno v:
Information Security and Privacy ISBN: 9783319199610
ACISP
ACISP
Homomorphic encryption enables various calculations while preserving the data confidentiality. Here we apply the homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure statistical analysis between two variables
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e8b81e00cec006d2d8d9839f58adb57
https://doi.org/10.1007/978-3-319-19962-7_27
https://doi.org/10.1007/978-3-319-19962-7_27
