Temat: ID, - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: ID-based, Proxy, Threshold Signature Scheme
Autorzy:: Pomykała, Jacek
Kułakowski, Henryk
Sapiecha, Piotr
Grela, Błażej
Powiązania:: https://bibliotekanauki.pl/articles/1844644.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: ID-based
proxy
threshold
signature
scheme
Opis:: We propose the proxy threshold signature scheme with the application of elegant construction of verifiable delegating key in the ID-based infrastructure, and also with the bilinear pairings. The protocol satisfies the classical security requirements used in the proxy delegation of signing rights. The description of the system architecture and the possible application of the protocol in edge computing designs is enclosed.
Źródło:: International Journal of Electronics and Telecommunications; 2021, 67, 2; 201-205
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Secure And Efficient Encryption Scheme Based on Bilinear Mapping
Autorzy:: Verma, Vandani
Mishra, Pragya
Powiązania:: https://bibliotekanauki.pl/articles/2124750.pdf
Data publikacji:: 2022
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: bilinear mapping
encryption
KGC
ID-OWE
discrete log problem
Opis:: With the increasing uses of internet technologies in daily life, vulnerability of personal data/information is also increasing. Performing secure communication over the channel which is insecure has always been a problem because of speedy development of various technologies. Encryption scheme provides secrecy to data by enabling only authorized user to access it. In the proposed paper, we present an encryption algorithm designed for data security based on bilinear mapping and prove it secure by providing its security theoretical proof against adaptive chosen cipher-text attack. With the help of a lemma, we have shown that no polynomially bounded adversary has non-negligible advantage in the challenging game. We also give the comparative analysis of the proposed scheme in terms of security and performance with Deng et al., 2020 and Jiang et al., 2021 schemes and prove that proposed algorithm is more efficient and secure than others existing in literature against adaptive chosen cipher-text attack.
Źródło:: International Journal of Electronics and Telecommunications; 2022, 68, 3; 469--473
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "ID," wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język