Zobrazeno 1 - 10
of 401
pro vyhledávání: '"Concrete security"'
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 7, Pp 50588-50594 (2019)
There has been a great deal of work on improving the efficiency of fully homomorphic encryption (FHE) scheme. Our approach, in this regard, is to use the idea of packed ciphertexts to construct a multi-bit FHE with a short public key on the basis of
Externí odkaz:
https://doaj.org/article/b1c7264017af4de596b0bb43f49fc91d
Autor:
Palash Sarkar, Subhadip Singha
Publikováno v:
Advances in Mathematics of Communications. 17:484-499
Regev (2005) introduced the learning with errors (LWE) problem and showed a quantum reduction from a worst case lattice problem to LWE. Building on the work of Peikert (2009), a classical reduction from the gap shortest vector problem to LWE was obta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e166463a03c09d59da466c4c17ad7813
https://doi.org/10.3934/amc.2021004
https://doi.org/10.3934/amc.2021004
Publikováno v:
IEEE Transactions on Cloud Computing. 10:1819-1830
In cloud computing, resources are usually in cloud service provider's network and typically accessed remotely by the cloud users via public channels. Key agreement enables secure channel establishment over a public channel for the secure communicatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ce9baeaf0f208f52b648f3cfad5b9d6
https://doi.org/10.1109/tcc.2020.3008795
https://doi.org/10.1109/tcc.2020.3008795
Publikováno v:
CCS 2021-ACM SIGSAC Conference on Computer and Communications Security
CCS 2021-ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS
CCS 2021-ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Nov 2021, Virtual Event, South Korea. pp.2541-2563, ⟨10.1145/3460120.3484548⟩
CCS
International audience; In this paper we enhance the EasyCrypt proof assistant to reason about computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle ca
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b208fe87f394ab3c610c6a3ba5f9e67
https://doi.org/10.1145/3589962
https://doi.org/10.1145/3589962
Publikováno v:
IEEE Transactions on Information Theory. 68:1329-1354
Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteau et al.'s work in ASIACRYPT 2018, this paper further studies the concrete security of one i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::001d94b6a8bf0a704e15b062a43d2519
https://doi.org/10.1109/tit.2021.3128315
https://doi.org/10.1109/tit.2021.3128315
Publikováno v:
IEEE Transactions on Control of Network Systems. 8:187-199
We study a multiperiod optimal power flow (OPF) problem in unbalanced three-phase radial distribution networks with batteries. To address this problem, we first take the resistance-line battery model that treats lossy batteries by adding resistive li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e8e2af528326c667ad6e192bd7fd56a
https://doi.org/10.1109/tcns.2020.3024319
https://doi.org/10.1109/tcns.2020.3024319
Autor:
Guoyan Zhang, Chun Guo
Publikováno v:
Designs, Codes and Cryptography. 89:407-440
Initiated by Luby and Rackoff (SIAM J. Computing, ’88), the information theoretic security of Feistel networks built upon random functions has been extensively studied. In sharp contrast, the exact security of Feistel networks built upon invertible
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c236d1d4a9c57a693e33cca676fd621
https://doi.org/10.1007/s10623-020-00820-0
https://doi.org/10.1007/s10623-020-00820-0
Autor:
Palash Sarkar, Subhadip Singha
Publikováno v:
Advances in Mathematics of Communications. 15:257-266
A key step in Regev's (2009) reduction of the Discrete Gaussian Sampling (DGS) problem to that of solving the Learning With Errors (LWE) problem is a statistical test required for verifying possible solutions to the LWE problem. We derive a lower bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f6a93590d4c84839fb7b68639296a269
https://doi.org/10.3934/amc.2020057
https://doi.org/10.3934/amc.2020057
Publikováno v:
Intelligent Automation & Soft Computing. 30:983-993
Recently, Khan et al. [An online-offline certificateless signature scheme for internet of health things,” Journal of Healthcare Engineering, vol. 2020] presented a new certificateless offline/online signature scheme for Internet of Health Things (I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbcdcbcb6dd7bf54d02d581664ff608d
https://doi.org/10.32604/iasc.2021.019486
https://doi.org/10.32604/iasc.2021.019486