Trusted third party

About: Trusted third party is a research topic. Over the lifetime, 2919 publications have been published within this topic receiving 60935 citations.

Method and system for identifying anonymous entity

Abstract: An anonymous entity authentication method includes the steps of: an entity B sending RB and IGB; an entity A sending RB, R'A, IGA and IGB to a trusted third party TP, the trusted third party TP checking a group GA and a group GB against IGA and IGB for legality; the trusted third party TP returning ResGA, ResGB and a token TokenTA or returning ResGA, ResGB, TokenTA1 and TokenTA2 to the entity A; the entity A sending TokenAB and IGA to the entity B for authentication by the entity B; and the entity B sending TokenBA to the entity A for authentication by the entity A. In this solution, anonymous entity authentication can be performed without passing identity information of the authenticated entity itself to the opposite entity. Furthermore this solution further relates to an anonymous entity authentication apparatus and a trusted third party.

RSU authentication by aggregation in VANET using an interaction zone

Abstract: Vehicular ad-hoc network (VANET) is an innovation that will change our vision of road traffic, it will improve the safety and the efficiently of transport. VANET represent a target for attacks that can cause human and material losses. This, highlights the need for a robust security system, who must secure effectively communications between vehicles and the different network's entities, but also, it must guarantee availability and fluidity in the transmission. Specifically, in transmission of messages from Road Side Unit (RSU) to vehicle (R2V), our security aims to ensure identification, authentication, non-repudiation and integrity for the RSU. An aggregation of identification will be achieved by multiples RSU and without asking for the intervention of a trusted third party. In this paper, we proposed a security schema to firstly ensure identification for RSU by an Elliptic Curve Diffie-Hellman (ECDH) algorithm where the vehicle confirms that the two neighbours RSU have the same shared secret, then secondly the vehicle authenticates the message beforehand signing, using Elliptic Curve Digital Signature Algorithm (ECDSA). To simulate the vehicle scenario, we used the OMNET++, SUMO and VEINS combined environment, and we integrated on it the Crypto++ library to achieve the security requirement. Our proposed model ensures stronger security.

SEPIM: Secure and Efficient Private Image Matching

Abstract: Matching a particular image within extensive datasets has become increasingly pressing in many practical fields. Hence, a number of matching methods have been developed when confidential images are used in image matching between a pair of security agencies, but they are limited by either search cost or search precision. In this paper, we propose a privacy-preserving private image matching scheme between two parties where images are confidential, namely secure and efficient private image matching (SEPIM). The descriptor set of the queried party needs to be generated and encrypted properly with the use of a secret key at the queried party side before being transferred to the other party. We present the development and validation of a secure scheme to measure the cosine similarity between two descriptor sets. To hasten the search process, we construct a tree-based index structure by utilizing the k-means clustering algorithm. The method can work without using any image encryption, sharing, and trusted third party. SEPIM is relatively efficient when set against other methods of searching images over plaintexts, and shows a higher search cost of just 14% and reduction in search precision of just 2%. We conducted several empirical analyses on real image collections to demonstrate the performance of our work.

Fair Transaction Protocols Based on Electronic Cash

Abstract: In this paper, we will propose a novel fair transaction protocol based on electronic cash. With the extension of untraceable electronic cash, we have designed a fair transaction protocol to satisfy both the anonymity and the fairness properties simultaneously. Under the existence of an off-line trusted third party (TTP), the protocol is efficient and practical. Furthermore, the payment information of each customer is not revealed to anyone else including the TTP, and thus, the anonymity or privacy of the customer is protected completely in our protocol. Especially, the proposed method is independent of the underlying electronic cash (e-cash) scheme such that it can be realized by any e-cash system based on the concept of blind signatures.