3 March 2019 in IEEE Internet of Things Journal
The maturity of cloud computing, the Internet of Things technology, and intelligent transportation system has promoted the rapid development of vehicular ad-hoc networks (VANETs). To keep pace with real-world demands (mobility, low latency, etc.) in a practical VANETs deployment, there have been attempts to integrate fog computing with VANETs. To facilitate secure interaction in fog-based VANETs, we design a new authenticated key agreement protocol without bilinear pairing. This protocol achieves mutual authentication, generates a securely agreed session key for secret communication, and supports privacy protection. We also give a strict formal security proof and demonstrate how the proposed protocol meets the security requirements in the fog-based VANETs. We then evaluate the efficiency of the proposed protocol, and it shows the practicality of the protocol.
12 May 2017 in IEEE Transactions on Industrial Informatics
With the widespread adoption of Internet of Things and cloud computing in different industry sectors, an increasing number of individuals or organizations are outsourcing their Industrial Internet of Things (IIoT) data in the cloud server to achieve cost saving and collaboration (e.g., data sharing). However, in this environment, preserving the privacy of data remains a key challenge and inhibiting factor to an even wider adoption of IIoT in the cloud environment. To mitigate these issues, in this paper, we design a new secure channel-free certificateless searchable public key encryption with multiple keywords scheme for IIoT deployment. We then demonstrate the security of the scheme in the random oracle model against two types of adversaries, where one adversary is given the power to choose a random public key instead of any user's public key and another adversary is allowed to learn the system master key. In the presence of these types of adversaries, we evaluate the performance of the proposed scheme and demonstrate that it achieves (computational) efficiency with low communication cost.
9 November 2017 in IEEE Transactions on Industrial Informatics
Industrial Internet of Things (IIoT) integrates various types of intelligent terminals, mobile devices and communication technologies to enable the upgrade of traditional industries to intelligent industries. IIoT relies on the powerful data processing capabilities of cloud computing to reduce the cost of various on-demand services as per the requirements of users. However, the privacy and confidentiality of the outsourced data should be extremely cared in this environment because the data is typically “handled” by a third party service provider. Encryption is a very promising technique to guarantee the confidentiality of the data. It, however, limits data retrieval due to its innate “all-or-nothing” decryption feature. To explore encryption into privacy-preserving data retrieval, many public key encryption with keyword search systems have been proposed in the literature. Nonetheless, most of the existing schemes are vulnerable to Inside Keyword Guessing Attack (IKGA) which is yielded by small keyword space. To mitigate this problem, we propose a Certificateless Public Key Authenticated Encryption with Keyword Search (CLPAEKS) scheme, which is provably secure against IKGA. The performance analysis demonstrates that the proposed scheme is more secure and effective compared with other certificateless public key encryption with keyword search schemes.
13 April 2021 in IEEE Internet of Things Journal
The Internet of Things (IoT) is gradually stepping out of its infancy into maturity. Its widespread applications cover from tiny wearable devices to large industrial systems. Although many security solutions have been introduced to address data security and privacy problems caused by the unique characteristics of IoT, how to simultaneously achieve data confidentiality, protect the privacy of access control policy, and provide reasonable data source identification has been a challenging problem. Moreover, lacking one of the above properties may result in serious issues (e.g., leakage information and forging identity), and the situation grows steadily worse with the expansion of “things” scale. To address the above issues, we propose a new cryptographic primitive named certificateless matchmaking encryption (CL-ME), which inherits the security properties of certificateless cryptosystem and matchmaking encryption. Meanwhile, we also present two effective concrete constructions with formal security proofs based on the standard hard assumptions. The basic construction is the first instance of CL-ME based on bilinear pairing, and the enhanced construction is a pairing-free lightweight solution. Finally, we implement our proposed schemes using popular cryptography library and compare their performance with existing works. Theoretical analysis and experimental evaluations demonstrate that our proposed schemes are more suitable for IoT environment.
13 March 2023 in IEEE Transactions on Information Forensics and Security
The security of secret keys for blockchain-based applications is increasingly important, partly because the theft of secret keys will render a significant financial loss. To guarantee the security of secret keys, many multi-party signature protocols have been proposed. However, few of them are designed for EdDSA-based blockchain that is developing in growth. The folklore and the NIST document for standardizing threshold schemes believe that a distributed hash evaluation is required to design multi-party EdDSA protocols, which leads to a relatively large overhead. In this paper, we present two practical multi-party EdDSA protocols for semi-honest and malicious settings. Our protocols eliminate the distributed hashing by securely maintaining a global state, which is feasible for EdDSA-based blockchain. Furthermore, we extend the malicious protocol to resist DoS attacks by identifying corrupted parties in case of execution aborts. We implemented our EdDSA protocols for different parties using Alibaba cloud servers with all instances of type ecs.t5-c1m2.large. Our protocol in the malicious setting takes 1.51-15.3 ms between 2 parties and 5 parties, and are two orders of magnitude faster than the recent threshold EdDSA protocol. These properties (efficient, identifiable abort, high compatibility) make the two protocols ideal for threshold wallets for EdDSA-based cryptocurrency.
13 March 2017 in Bulletin of the Australian Mathematical Society
In 1956, Jeśmanowicz conjectured that, for any positive integers $m$ and $n$ with $m>n$ , $\gcd (m,n)=1$ and $2\nmid m+n$ , the Diophantine equation $(m^{2}-n^{2})^{x}+(2mn)^{y}=(m^{2}+n^{2})^{z}$ has only the positive integer solution $(x,y,z)=(2,2,2)$ . In this paper, we prove the conjecture if $4\nmid mn$ and $y\geq 2$ .