Traceable Scheme Research Articles

Blockchain-based secure optimized traceable scheme for smart and sustainable food supply chain

A large number of nodes, and significant system overhead are among the challenges. To tackle these problems, a new PBFT technique known as trace-PBFT (t-PBFT) is being contemplated for adoption in the food supply chain. The PBFT algorithm, short for Practical Byzantine Fault Tolerance, serves as the fundamental algorithm. The linkages throughout the supply chain may be categorized into three primary groups. As a response to the continuing discussion over the amount of data, the status of each node is continuously updated in real time. This metric is utilized to evaluate the dependability of the principal node and to analyze the overall performance of the nodes. To minimize the amount of data transmitted between nodes, we optimized the consensus process of the first algorithm. The distinct attributes of offering collaborative food technology were considered throughout this procedure. Experimental evidence indicates that the t-PBFT approach outperforms the PBFT algorithm in terms of throughput, request delay, and information overhead. An architectural paradigm is proposed by integrating the t-PBFT algorithm with a federated network. This model was developed in response to the distinct demands of the food supply chain. This model effectively captures data at each stage of the food supply chain to ensure information tracking while preserving the safety of the food technology flow process.

Retracted: Blockchain-Based Secure Traceable Scheme for Food Supply Chain

Retracted: Blockchain-Based Secure Traceable Scheme for Food Supply Chain

Blockchain-Based Secure Traceable Scheme for Food Supply Chain

The typical food traceability system’s data layer is made up of relational databases managed by core businesses, which cannot ensure data security. It is inefficient and requires a lot of upkeep. The food supply chain has numerous actors, making it difficult for consumers to safeguard their rights when purchasing food with quality issues. Due to the numerous organizations involved in the food supply chain, food safety monitoring and traceability have become challenging. The supply chain’s major organizations have control and administrative authority over the data under the current food traceability system, which is overly centralized for traceability information. The safety and dependability of food may be ensured by using the food traceability system to track food information. We can witness a series of detailed insights into food from the manufacturing source to the consumption terminal. A blockchain-based food tracking system is created as a solution to these issues. On the Ethereum platform, the system was created. It was also employed in the blockchain system, in addition to its features of decentralization, tamper-proof, and traceability. To implement the data update service and the food recall function, introduce the Food and Drug Administration node. Consumers have the option to not only enquire about food traceability throughout the manufacturing process but also to file complaints regarding the traceability system’s rights protection.

A Traceable and Anonymous Data Aggregation Scheme with Fog Computing Devices for Smart Grid

As an extension of the Internet of Things (IoT), smart city is a new aim for applications used in different industrial aspects. Intelligent IoT devices are used everywhere in smart cities to implement the functions such as monitoring and managing. Smart grid is one of the critical parts. Obtaining the quantity and cost of electricity usage is the most critical task of the smart grid. But such data in plaintext may leak the user privacy. So, it is an emergent aim to protect the private information of the user. Thus, we present a secure scheme for the smart grid, which not only protects the user’s information including identity and power consumption in the communications but also tracks the correct electricity cost for each user. Also, electricity consumption data from users could be aggregated in fog devices and then analyzed by the utility provider. The formal proof shows that the message transmission reaches the security level of the chosen plaintext attack (CPA). Also, the security properties of the scheme express the robustness. Finally, the performance study demonstrates that the proposed protocol is acceptable in practice.

Anonymous Traceability Protocol Based on Group Signature for Blockchain

In blockchain technology, data are stored on decentralized nodes and public to each node in the blockchain network. Hence, the focus of privacy protection in the blockchain guarantees the anonymity of transactions such that attackers cannot attain the users’ personal information through data analysis. Among the existing privacy protection technologies, the scheme based on group signature has good anonymity, but the existing scheme exists a large number of operations that are difficult to apply to wireless terminals. In this paper, using the powerful offloading capability of edge computing, we propose a blockchain node traceable identity privacy technology scheme based on threshold group signature, and the scheme greatly reduces the computing burden of nodes while achieving node privacy protection.

Traceable Scheme of Public Key Encryption with Equality Test.

Public key encryption supporting equality test (PKEwET) schemes, because of their special function, have good applications in many fields, such as in cloud computing services, blockchain, and the Internet of Things. The original PKEwET has no authorization function. Subsequently, many PKEwET schemes have been proposed with the ability to perform authorization against various application scenarios. However, these schemes are incapable of traceability to the ciphertexts. In this paper, the ability of tracing to the ciphertexts is introduced into a PKEwET scheme. For the ciphertexts, the presented scheme supports not only the equality test, but also has the function of traceability. Meanwhile, the security of the proposed scheme is revealed by a game between an adversary and a simulator, and it achieves a desirable level of security. Depending on the attacker’s privileges, it can resist OW-CCA security against an adversary with a trapdoor, and can resist IND-CCA security against an adversary without a trapdoor. Finally, the performance of the presented scheme is discussed.

Enabling efficient traceable and revocable time-based data sharing in smart city

With the assistance of emerging techniques, such as cloud computing, fog computing and Internet of Things (IoT), smart city is developing rapidly into a novel and well-accepted service pattern these days. The trend also facilitates numerous relevant applications, e.g., smart health care, smart office, smart campus, etc., and drives the urgent demand for data sharing. However, this brings many concerns on data security as there is more private and sensitive information contained in the data of smart city applications. It may incur disastrous consequences if the shared data are illegally accessed, which necessitates an efficient data access control scheme for data sharing in smart city applications with resource-poor user terminals. To this end, we proposes an efficient traceable and revocable time-based CP-ABE (TR-TABE) scheme which can achieve time-based and fine-grained data access control over large attribute universe for data sharing in large-scale smart city applications. To trace and punish the malicious users that intentionally leak their keys to pursue illicit profits, we design an efficient user tracing and revocation mechanism with forward and backward security. For efficiency improvement, we integrate outsourced decryption and verify the correctness of its result. The proposed scheme is proved secure with formal security proof and is demonstrated to be practical for data sharing in smart city applications with extensive performance evaluation.

Dynamic and Traceable Data Integrity Verification Scheme for a Smart Home System

Dynamic and Traceable Data Integrity Verification Scheme for a Smart Home System

Efficient access control with traceability and user revocation in IoT

With the universality and availability of Internet of Things (IoT), data privacy protection in IoT has become a hot issue. As a branch of attribute-based encryption (ABE), ciphertext policy attribute-based encryption (CP-ABE) is widely used in IoT to offer flexible one-to-many encryption. However, in IoT, different mobile devices share messages collected, transmission of large amounts of data brings huge burdens to mobile devices. Efficiency is a bottleneck which restricts the wide application and adoption of CP-ABE in Internet of things. Besides, the decryption key in CP-ABE is shared by multiple users with the same attribute, once the key disclosure occurs, it is non-trivial for the system to tell who maliciously leaked the key. Moreover, if the malicious mobile device is not revoked in time, more security threats will be brought to the system. These problems hinder the application of CP-ABE in IoT. Motivated by the actual need, a scheme called traceable and revocable ciphertext policy attribute-based encryption scheme with constant-size ciphertext and key is proposed in this paper. Compared with the existing schemes, our proposed scheme has the following advantages: (1) Malicious users can be traced; (2) Users exiting the system and misbehaving users are revoked in time, so that they no longer have access to the encrypted data stored in the cloud server; (3) Constant-size ciphertext and key not only improve the efficiency of transmission, but also greatly reduce the time spent on decryption operation; (4) The storage overhead for traceability is constant. Finally, the formal security proof and experiment has been conducted to demonstrate the feasibility of our scheme.

A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access

Multiauthority ciphertext-policy attribute-based encryption (MA-CP-ABE) is a promising technique for secure data sharing in cloud storage. As multiple users with same attributes have same decryption privilege in MA-CP-ABE, the identity of the decryption key owner cannot be accurately traced by the exposed decryption key. This will lead to the key abuse problem, for example, the malicious users may sell their decryption keys to others. In this paper, we first present a traceable MA-CP-ABE scheme supporting fast access and malicious users’ accountability. Then, we prove that the proposed scheme is adaptively secure under the symmetric external Diffie–Hellman assumption and fully traceable under the q -Strong Diffie–Hellman assumption. Finally, we design a traceable and revocable MA-CP-ABE system for secure and efficient cloud storage from the proposed scheme. When a malicious user leaks his decryption key, our proposed system can not only confirm his identity but also revoke his decryption privilege. Extensive efficiency analysis results indicate that our system requires only constant number of pairing operations for ciphertext data access.

Compulsory traceable ciphertext-policy attribute-based encryption against privilege abuse in fog computing

Due to the structure of fog systems, ciphertext-policy attribute-based encryption (CP-ABE) is regarded as a promising technique to address certain security problems present in the fog. Unfortunately, in most traditional CP-ABE systems, a user can deliberately leak his attribute keys to others or use his private key to build a decryption device and provide a decryption service with little risk of being caught (untraceable). We refer to this behavior as privilege abuse. The privilege abuse problem will seriously hinder the adoption of CP-ABE. To address the problem, we propose a novel black-box traceable CP-ABE scheme that is much simpler than the existing white-box traceable schemes. A malicioususer who builds a decryption black-box can be tracked and exposed by our scheme. Due to its scalability and relatively high efficiency, the scheme could be practical for fog systems. Furthermore, we point out that, if the adversary can distinguish the tracing ciphertext from the normal ciphertext, he can frustrate tracking by outputting incorrect decryption results. Thus, the traceability must be compulsory, so as to ensure that the adversary cannot distinguish between the tracing ciphertext and the normal ciphertext. Therefore, we present a formal definition of compulsory traceability with a new security game, and our scheme is proved to be secure and compulsory traceable under the generic group model.

A Traceable and Anonymous Authentication Scheme Based on Elliptic Curve for Wireless Sensor Network

A Traceable and Anonymous Authentication Scheme Based on Elliptic Curve for Wireless Sensor Network

BSEA: A Blind Sealed-Bid E-Auction Scheme for E-Commerce Applications

Due to an increase in the number of internet users, electronic commerce has grown significantly during the last decade. Electronic auction (e-auction) is one of the famous e-commerce applications. Even so, security and robustness of e-auction schemes still remain a challenge. Requirements like anonymity and privacy of the b i d value are under threat from the attackers. Any auction protocol must not leak the anonymity and the privacy of the b i d value of an honest Bidder. Keeping these requirements in mind, we have firstly proposed a controlled traceable blind signature scheme (CTBSS) because e-auction schemes should be able to trace the Bidders. Using CTBSS, a blind sealed-bid electronic auction scheme is proposed (BSEA). We have incorporated the notion of blind signature to e-auction schemes. Moreover, both the schemes are based upon elliptic curve cryptography (ECC), which provides a similar level of security with a comparatively smaller key size than the discrete logarithm problem (DLP) based e-auction protocols. The analysis shows that BSEA fulfills all the requirements of e-auction protocol, and the total computation overhead is lower than the existing schemes.

An efficient traceable data-sharing scheme in cloud computing for mobile devices

Owing to the convenience of mobile devices and the advantages of cloud computing, it is a fashion to efficiently share data by mobile devices in cloud computing. However, it might be insecure to upload the plaintext directly to the remote cloud server. In order to solve the problem, the data should be encrypted by a secure encryption scheme. Most existing data sharing schemes in cloud computing are either insecure against collusion attack or suffer from a large computational overhead. In this paper, an efficient data sharing scheme in cloud computing for mobile devices is proposed based on convergent encryption and polynomial reconstruction techniques. Moreover, predecryption is used to further reduce the computation overhead of mobile devices. Finally, we utilise traitor tracing technology to track the users who have leaked private keys for their own benefit. Experimental results indicate that the proposed scheme is extremely suitable for mobile devices.

The role of residence time in diagnostic models of global carbon storage capacity: model decomposition based on a traceable scheme.

As a key factor that determines carbon storage capacity, residence time (τE) is not well constrained in terrestrial biosphere models. This factor is recognized as an important source of model uncertainty. In this study, to understand how τE influences terrestrial carbon storage prediction in diagnostic models, we introduced a model decomposition scheme in the Boreal Ecosystem Productivity Simulator (BEPS) and then compared it with a prognostic model. The result showed that τE ranged from 32.7 to 158.2 years. The baseline residence time (τ′E) was stable for each biome, ranging from 12 to 53.7 years for forest biomes and 4.2 to 5.3 years for non-forest biomes. The spatiotemporal variations in τE were mainly determined by the environmental scalar (ξ). By comparing models, we found that the BEPS uses a more detailed pool construction but rougher parameterization for carbon allocation and decomposition. With respect to ξ comparison, the global difference in the temperature scalar (ξt) averaged 0.045, whereas the moisture scalar (ξw) had a much larger variation, with an average of 0.312. We propose that further evaluations and improvements in τ′E and ξw predictions are essential to reduce the uncertainties in predicting carbon storage by the BEPS and similar diagnostic models.

Cheat Immune and Traceable Visual Cryptography Scheme

Cheat Immune and Traceable Visual Cryptography Scheme

Identity Traceable Attribute-Based Signature Scheme

In an attribute-based signature(ABS) scheme,the signer's identity keeps anonymous.To prevent the signer from abusing this property,Escala,Herranz,and Morillo proposed an identity traceable attribute-based signature scheme(EHM-ABS).Their scheme used an automorphic signature,and applied the non-interactive witness indistinguishable(NIWI) proofs many times.Inspired by Boyen,and Waters' identity-based compact group signature scheme,the study presents an identity traceable ABS scheme in the standard model.When issuing the attribute private key,the signer's identity is embedded.By using the NIWI proof of encrypting each bit of identity,this scheme achieves the traceability.To compare with EHM-ABS,this scheme reduces the number of applying the NIWI proofs when the order of the claimed attributes set is bigger than the quarter of the bit length of identity,and do not need to use automorphic signature.The security of this proposed scheme is based on the subgroup dicision and the computational diffie-Hellman assumptions.

On the Proxy-Protected Property of Chen et al.'s Proxy Multisignature Schemes

Recently, Chen, Chung, and Huang proposed a traceable proxy multisignature scheme based on the elliptic curve cryptosystem. However, this paper shows that the original signers can produce a valid s...