Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "authentication" wg kryterium: Temat


Wyświetlanie 1-4 z 4
Tytuł:
A study of various authentication mechanisms towards the secure Internet of Things networks
Autorzy:
Vairagade, Rupali Sachin
Brahmananda, S. H.
Powiązania:
https://bibliotekanauki.pl/articles/2050106.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
Internet of Things
secure authentication
mutual authentication
cryptography-based authentication
lightweight approach
identity approach
Opis:
Internet of Things (IoT) plays a major function in the public infrastructure, including power grids, control systems, smart cards, smart cities, intelligent transportation, education, and so on. The IoT networks provide ample benefits arising from transmission of the data between the IoT nodes and the servers. However, security constitutes a major concern in the IoT applications, as secret information may get disclosed to the unauthorized third-party in the network. Thus, secure authentication is a major requirement for managing and communicating with respect to the devices in the IoT environment. In this survey, 50 research papers are reviewed, referring to various authentication protocols used for ensuring adequate security in the network. The authentication methods are categorized on the basis of the security mechanisms, namely, the lightweight approach, the identity approach, the mutual authentication approach, and the cryptography-based authentication approaches, with the challenges faced by these existing methods being reported. Moreover, a simple overview is provided based on authentication protocols, toolsets, and evaluation metrics. Conform to this survey, most of the research articles concentrated on the lightweightbased approaches, and the most commonly applied evaluation metrics include packet loss, throughput, and efficiency.
Źródło:
Control and Cybernetics; 2020, 49, 4; 393-418
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Homomorphic linear authentication schemes from ε-ASU2 functions for proofs of retrievability
Autorzy:
Liu, S.
Chem, K.
Powiązania:
https://bibliotekanauki.pl/articles/206226.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
authentication code
proof of retrievability
Opis:
Proof of Retrievability (POR) refers to interactive auditing protocols executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with the help of the stored data. Retrievability means that it should be possible for a client to extract his/her data from the server's valid responses. An essential step leading to retrievability is the server's unforgeability of valid responses, i.e, any server coming up with valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With Homomorphic Linear Authentication (HLA) schemes, the server�' several responses can be aggregated into one, hence reducing the communication complexity. In this paper, we explore some new constructions of ε-almost strong universal hashing functions (ε-ASU2), which are used to build homomorphic linear authenticator schemes in POR to provide unforgeability. We show the HLA scheme involved in Shacham and Waters' POR scheme (see Shacham and Waters, 2008) is just an employment of a class ε-ASU2 functions. Using another class of ε-ASU2 for authentication in POR results in a new HLA scheme, which enjoys unforgability, the same shortest responses as the SW scheme, but reduces the local storage from O(n+s) to O(n) for information soundness, and from O(s) to O(1) for knowledge-soundness.
Źródło:
Control and Cybernetics; 2012, 41, 2; 335-351
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust distributed privacy-preserving secure aggregation in vehicular communication
Autorzy:
Qin, B.
Wu, Q.
Domingo-Ferrer, J.
Susilo, W.
Powiązania:
https://bibliotekanauki.pl/articles/206240.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
authentication
vehicle privacy
data aggregation
VANETs
Opis:
Vehicular ad hoc networks (VANETs), formed by computers embedded in vehicles and the traffic infrastructure, are expected to develop in the near future to improve traffic safety and efficiency. To this end, VANETs should be designed to be resistant against various abuses and attacks. In this paper, we first review the existing proposals to provide security, privacy, and data aggregation in vehicle-to-vehicle communication. We then address the fundamental issue of achieving these conflicting properties in a unified solution, having observed that separate efforts cannot fulfill the VANET design objectives. A set of new mechanisms are suggested for efficiently managing identities and securely compressing cryptographic witnesses, which are among the major obstacles to the deployment of strong security mechanisms in VANETs. Finally, we employ the standard threshold cryptographic technology to improve the basic protocol with robustness.
Źródło:
Control and Cybernetics; 2012, 41, 2; 277-296
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient provably secure certificateless aggregate signature applicable to mobile computation
Autorzy:
Xiong, H.
Wu, Q.
Chen, Z.
Powiązania:
https://bibliotekanauki.pl/articles/206221.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
message authentication
certificateless cryptography
aggregate signature
mobile computing
Opis:
An aggregate signature scheme allows a public algorithm to aggregate n signatures on n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme. Compared with up-to-date certificateless aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model; (2) the security is proven in the strongest security model so far; (3) the signers do not need to be synchronized; and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/ computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.
Źródło:
Control and Cybernetics; 2012, 41, 2; 373-391
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies