Zobrazeno 1 - 10
of 328
pro vyhledávání: '"Trapdoor function"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEEE Access, Vol 6, Pp 43936-43945 (2018)
Lossy trapdoor functions (LTFs) are very useful tools in constructing complex cryptographic primitives in a black-box manner, such as injective trapdoor functions, collision-resistant hashes, CCA secure public-key encryption, and so on. However, the
Externí odkaz:
https://doaj.org/article/a7a9bca5441c489787eb96433b1a3b2c
Publikováno v:
IEEE Transactions on Industrial Informatics. 18:1991-1999
IoT-enabled smart healthcare systems has the characteristics of heterogeneous fusion, cross domain, collaborative autonomy, dynamic change and open interconnection, but they bring huge challenges in privacy issues. We proposed a scheme of forward pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a769ec72315bac6fba3cb3f405695474
https://doi.org/10.1109/tii.2021.3064691
https://doi.org/10.1109/tii.2021.3064691
Publikováno v:
IEEE Transactions on Cloud Computing. 10:366-382
Signal processing in the encrypted domain is a potential tool to protect sensitive signals against untrusted cloud servers and malicious users in the delegated computing setting, without affecting the accuracy of signal analyzing and processing. Most
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6f2e9a1491e027d30092b9fcc0accfc1
https://doi.org/10.1109/tcc.2019.2948012
https://doi.org/10.1109/tcc.2019.2948012
Publikováno v:
IEEE Transactions on Information Theory. 66:2588-2598
In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the bounded distance decoding problem is hard to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6299670d8d25ad8967bcf43899f096a9
https://doi.org/10.1109/tit.2020.2967047
https://doi.org/10.1109/tit.2020.2967047
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1640-1646
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6de30babd0161c640077fe66efbb749d
https://doi.org/10.1587/transfun.2020eap1053
https://doi.org/10.1587/transfun.2020eap1053
Publikováno v:
Tatra Mountains Mathematical Publications. 77:139-162
In this paper we propose an efficient multivariate encryption scheme based on permutation polynomials over finite fields. We single out a commutative group ℒ(q, m) of permutation polynomials over the finite field F q m. We construct a trapdoor func
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::576c3f9ae91d90d1df51cb853bc1a25e
https://doi.org/10.2478/tmmp-2020-0013
https://doi.org/10.2478/tmmp-2020-0013
Publikováno v:
Theoretical Computer Science. 835:82-96
The encryption schemes based on coding theory are one of the most accredited choices in post-quantum scenario, where QC-LDPC codes are usually employed to construct concrete schemes due to the well security and good efficiency. In this work, we intro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f556927f1345c6d60ca15914cc35e738
https://doi.org/10.1016/j.tcs.2020.06.013
https://doi.org/10.1016/j.tcs.2020.06.013
Publikováno v:
Information Sciences. 516:505-514
Identity-based sequential aggregate signature (IBSAS for short) schemes, introduced by Boldyreva et al. [CCS 2007], allow a large quantity of signers to generate one signature sequentially, in which these messages as well as their order can be attest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43f9d7f54ae2af13f6b1f90a5ec74263
https://doi.org/10.1016/j.ins.2019.12.076
https://doi.org/10.1016/j.ins.2019.12.076