Vehicular ad-hoc network (VANETs) has been a hot research topic in recent years. In this environment, each vehicle can broadcast messages to other vehicles and inform drivers to change their route right away in order to enhance the efficiency of driving and to avoid accidents. Since vehicles communicate through wireless tunnel, many malicious attacks may occur during the transmission of messages. Consequently, ensuring the correctness of receiving messages and verifying the authenticity of the sender is necessary. Besides, we also need to protect the real identities of vehicles from revealing to guarantee the privacy. To satisfy these security properties, many related researches have been proposed. However, they all have some drawbacks. For example: 1. The cost of the certificate management and the exposure problem of the certificate. 2. Waiting for RSU to verify the messages: Once more vehicles need RSU, RSU will have much more overhead and it can¡¦t achieve real-time authentication. In this thesis, we come up with an anonymous authentication and key agreement scheme based on chameleon hashing and ID-based cryptography in the vehicular communication environment. In our scheme, every vehicle can generate many different chameleon hash values to represent itself, and others can prove the ownership of chameleon hash value. Furthermore, unlike other pseudonymous authentication schemes, we also achieve one-to-one private communication via ID-based cryptography. Finally, we not only overcome some problems in previous works but also fulfill some necessary security requirements in vehicular communication environment.

Anonymous authentication is a mean of authorizing a user without leakage of user personal information. The technology of Anonymous Authentication Systems (AAS) provides privacy of the user and yet preserves the security of the system. This thesis presents the basic cryptographic primitives, which can provide anonymous authentication. Among these primitives there are usually some asymmetric cryptosystems, but an essential part of anonymous authentication is based on zero knowledge protocols, blind signature schemes, threshold group schemes, etc., that are presented in Chapter 1. Generally, Anonymous Authentication Systems have application as electronic coin, electronic cash, group signatures, anonymous access systems, electronic vote, etc., which are analyzed and presented in Chapters 2 and 3. In the practical section, the implementation (in the environment .NET in C#) of the AAS system is presented and described in Chapter 4, which is being developed at the FEEC BUT.

In this dissertation, we design and analyze five authentication protocols that answer to the a firmative the following fi ve questions associated with the authentication functions in computer networks. 1. The transport protocol HTTP is intended to be lightweight. In particular, the execution of applications on top of HTTP is intended to be relatively inexpensive and to take full advantage of the middle boxes in the Internet. To achieve this goal, HTTP does not provide any security guarantees, including any authentication of a server by its clients. This situation raises the following question. Is it possible to design a version of HTTP that is still lightweight and yet provides some security guarantees including the authentication of servers by their clients? 2. The authentication protocol in HTTPS, called TLS, allows a client to authenti- cate the server with which it is communicating. Unfortunately, this protocol is known to be vulnerable to human mistakes and Phishing attacks and Pharm- ing attacks. Is it possible to design a version of TLS that can successfully defend against human mistakes and Phishing attacks and Pharming attacks? 3. In both HTTP and HTTPS, a server can authenticate a client, with which it is communicating, using a standard password protocol. However, standard password protocols are vulnerable to the mistake of a client that uses the same password with multiple servers and to Phishing and Pharming attacks. Is it possible to design a password protocol that is resilient to client mistakes (of using the same password with multiple servers) and to Phishing and Pharming attacks? 4. Each sensor in a sensor network needs to store n - 1 symmetric keys for secure communication if the sensor network has n sensor nodes. The storage is constrained in the sensor network and the earlier approaches succeeded to reduce the number of keys, but failed to achieve secure communications in the face of eavesdropping, impersonation, and collusion. Is it possible to design a secure keying protocol for sensor networks, which is e fficient in terms of computation and storage? 5. Most authentication protocols, where one user authenticates a second user, are based on the assumption that the second user has an "identity", i.e. has a name that is (1) fi xed for a relatively long time, (2) unique, and (3) ap- proved by a central authority. Unfortunately, the adoption of user identities in a network does create some security holes in that network, most notably anonymity loss, identity theft, and misplaced trust. This situation raises the following question. Is it possible to design an authentication protocol where the protocol users have no identities? / text

This thesis discusses the general use of smart cards in MULTOS in cryptographic applications. At first is described two types of authentication - the authentication by the subject with focusing on authenticators and the authentication by the knowledge. Furthermore there is the description of the anonymous authentication and attribute authentization. This is followed by a description of smart cards with a focus on MULTOS cards. There is also performed analysis of programmable smart cards .NET, JavaCard and MULTOS. Practical part is focused on the implementation of an authentication scheme, which is being developed at FEEC. The communication of authentication protocol is between the MULTOS card and reader connected to a PC. The protocol is composed of cryptographic functions such as random number generation, hash function, modular exponentiation, modular multiplication and difference of large numbers. It was also implemented the measurement of specific applications.

Participatory Sensing Systems (PSS) are a type of Mobile Crowdsensing System where users voluntarily participate in contributing information. Task initiators create tasks, targeting specific data that needs to be gathered by the users’ device sensors. Such systems have been designed with different requirements, such as data trustworthiness, accountability, and incentives, in a secure and private way. However, it is complex to protect user privacy without affecting the performance of the rest of the system. For example, with task assignment, either the user authenticates anonymously, or discloses its sensors for an efficient allocation. If the user identity is hidden from the system, it could receive a task it cannot perform. This thesis aims to design an anonymous authentication model for PSS based on privacy-preserving attribute-based signatures. The proposed solution allows the Participatory Sensing System to enforce sensor requirements for efficient task allocation. In addition to the design, experiments measuring the performance of the operations are included in the thesis, to prove it is suitable for real-world scenarios. / Participatory Sensing Systems (PSS) är en typ av mobilt Crowdsensing-system där användare frivilligt deltar i att bidra med information. Aktivitetsinitiatorer skapar uppgifter, inriktade på specifik data som behöver samlas in av användarnas enhetssensorer. Sådana system har utformats med olika krav, såsom datatillförlitlighet, ansvarighet och incitament, på ett säkert och privat sätt. Det är dock komplicerat att skydda användarnas integritet utan att påverka prestandan för resten av systemet. Till exempel, med uppgiftstilldelning, antingen autentiserar användaren anonymt eller avslöjar sina sensorer för en effektiv tilldelning. Om användaridentiteten är dold från systemet kan den få en uppgift som den inte kan utföra. Denna avhandling syftar till att designa en anonym autentiseringsmodell för PSS baserad på integritetsbevarande attributbaserade signaturer. Den föreslagna lösningen gör det möjligt för Participatory Sensing System att upprätthålla sensorkrav för effektiv uppgiftsallokering. Utöver designen ingår experiment som mäter verksamhetens prestanda i avhandlingen, för att bevisa att den är lämplig för verkliga scenarier.

This thesis discusses the possibility of ensuring the safety, integrity and authenticity of data communication with respect to user privacy. This thesis describes the fundamentals of smart grid networks with capabilities of existing forms of security to communications that have been chosen as a target for application deployment of group signatures to ensure the security, integrity and authenticity of data communications. It describes the concept of a zero-knowledge and cryptography primitives. Further, the basic principles are presented, the history of development, and various schemes are compared based on the construction and performance. The second part is given to the deployment and optimization of group signatures for computationally limited devices. Within the draft report were to be implemented in the Java language chosen scheme HLCCN, DP and BBS. They were then tested under various platforms which were measured and evaluated performance parameters of the schemes. The optimization of the work is focused on the times of signatures, which are critical to a smart grid system. Under the platforms are deployed pre-processed pairing optimization methods and other methods resulting from the deployment platform as JPBWrappera and native libraries to deliver more efficient times of sgnaiture. At the end of the thesis are evaluated achievements of optimization methods and the appropriateness of the deployment of smart grids.