Temat: Encryption - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Confidential Greedy Graph Algorithm
Autorzy:: Waszkiewicz, D.
Horubala, A.
Sapiecha, P.
Andrzejczak, M.
Powiązania:: https://bibliotekanauki.pl/articles/226681.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: cryptography
fully homomorphic encryption
confidential graph algorithm
cloud computing
Opis:: Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing. Security of our solution is based on fully homomorphic encryption scheme. The time complexity and the security aspects of considered algorithm are described.
Źródło:: International Journal of Electronics and Telecommunications; 2018, 64, 2; 179-183
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Block Cipher Based Public Key Encryption via Indistinguishability Obfuscation
Autorzy:: Horubała, A.
Waszkiewicz, D.
Andrzejczak, M.
Sapiecha, P.
Powiązania:: https://bibliotekanauki.pl/articles/226598.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: indistinguishability obfuscation
public key cryptosystems
homomorphic encryption
cloud computing
information protection
Opis:: The article is devoted to generation techniques of the new public key crypto-systems, which are based on application of indistinguishability obfuscation methods to selected private key crypto-systems. The techniques are applied to symmetric key crypto-system and the target system is asymmetric one. As an input for our approach an implementation of symmetric block cipher with a given private-key is considered. Different obfuscation methods are subjected to processing. The target system would be treated as a public-key for newly created public crypto-system. The approach seems to be interesting from theoretical point of view. Moreover, it can be useful for information protection in a cloud-computing model.
Źródło:: International Journal of Electronics and Telecommunications; 2018, 64, 2; 173-178
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja