The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Message exchange among vehicles is an integral part of communication in smart cities. Messages are exchanged to inform the other vehicles about emergency situations such as-safety alerts, and location privacy. Due to the usage of an insecure wireless medium, malicious activities in vehicles, i.e., illegal use of the false messages, can astray other vehicles. Security in communication among the vehicles...
Wireless Sensor Networks (WSNs), comprising of tiny nodes with limited energy, computational and communication resources, are being widely used in various application areas ranging from pollution and weather monitoring to military. Even though every application may not require data to be exchanged in a secure manner, few WSN applications may have certain security requirements. The data is encrypted...
First, based on the bilinear pairings, a new computing problem, inverse bilinear paring operation problem (IBPOP), is proposed, which is proved to be not easier than the computing diffie-Hellman problem (CDHP) and not harder than discrete logarithm problem (DLP). So, if the symbol ldquolesrdquo denotes the increase of the hardness of computing problem, it can be deduced that CDHPlesIBPOPlesDLP. Then,...
Most of pairing-based schemes need two or more operations of pairings. To find an efficient randomized certificate-based signature from pairings, by constructing a fraction such that a random element of the gap Diffie-Hellman group is included in the numerator and the sum of the master key and the output of the hash function is included in the denominator, a new signature scheme from pairings is proposed,...
The trace equivalence relation is analyzed and proved by the property of cyclic group, and the XTR security decreasing caused by the equivalence relation is discussed. To cope with this problem, an improved algorithm was proposed to eliminate the equivalence relation effectively. The improved algorithm is compatible with the old speedup algorithm. Furthermore, the algorithm is more effective to improve...
The direct anonymous attestation scheme was proposed by Brickell, Jan Camenisch, Liqun Chen and was adopted by the trusted computing group in its specifications for trusted computing platforms. In this paper, We propose a new direct anonymous scheme from the bilinear maps based on the decisional Diffie-Hellman assumption and q-SDH assumption. The length of private keys and signatures in our scheme...
In spite of many advantages the identity-based cryptosystem provides over traditional public key based cryptosystem, the paradigm requires frequently user authentication and secure channel for private key issue, which have handicapped its wide acceptance and restrict its usage to a small and closed groups where a central trusted authority exists and is easily accessible. In this paper we propose a...
Ad hoc anonymous identification scheme is a multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. This paper proposes a new ID-based ad-hoc anonymous identification scheme from pairings. The new scheme is efficient both in computation and communication compared to previous works.
As various applications of SIP-based VoIP networks have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we present a certificate-based two party authentication key agreement protocol for SIP-based VoIP networks and prove its security in the random oracle model. Additionally, our scheme could be used for multiple CAs environment...
A practical publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of B. Schoenmakerspsila PVSS and its secret is not the form of discrete logarithm, thus this PVSS is extremely practical. Moreover, in the schemepsilas distribution of shares phase, only using bilinearity of bilinear pairing, anybody can verify whether the...
A number of applications depend on the protection of security-sensitive hardware, preventing unauthorized users from gaining access to the functionality of the integrated circuits (ICs). Failure to protect such devices can have consequences ranging from the loss of financial revenue to the loss of human lives. The key to providing protection does not lie in the prevention of theft but in a secure...
Achieving both message confidentiality and authenticity at a reasonable computational cost, especially in case of using smart cards with limited processing capabilities, has always been considered a challenging problem. signcryption is one attractive cryptographic solution. An even more challenging problem is that of achieving both goals in multi-cast operations. This paper presents a new tree-based,...
Huge interest and demand on information superhighway have pressed various telecommunications research fronts and lead to a new form of future Internet consisting of wired and wireless segments where resource-constrained devices such as palm pilots and sensors may become integral parts of the Internet rather than access-only platforms. One of the key design problems is the security in such heterogeneous...
In this paper, we propose a new efficient identity based proxy signature scheme. Compared with the previously proposed proxy signature schemes, ours combines the properties of proxy signature and the identity based signature, and has much more advantages than the traditional proxy signature schemes without the identity based characteristic. In addition, we also modify the general scheme into an extensive...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.