In the era of rapid artificial intelligence development, human–agent collaboration holds the potential to significantly enhance work efficiency. While existing studies have explored various collaboration strategies and resource methods, there remains a notable lack of in-depth research on how to economically allocate a limited budget to acquire both human and agent computing capacities. To address this gap, we first construct a developer model based on theories from psychology and economics, providing a quantitative description of human working time and efficiency. Building upon this, we further investigate the impact of dynamic budget allocation strategies on consumer decision-making. Specifically, a novel budget recycling mechanism is introduced to redistribute unused resources, thereby enhancing system responsiveness. Experimental results demonstrate a 56% improvement in resource utilization and a 32% increase in task completion. This confirms the effectiveness of our proposed method in optimizing collaboration and supporting sustainable project execution.

Personalized federated learning (PFL) combines client needs and data characteristics to train personalized models for local clients. However, the most of previous PFL schemes encountered challenges such as low model prediction accuracy and privacy leakage when applied to practical datasets. Besides, the existing privacy protection methods fail to achieve satisfactory results in terms of model prediction accuracy and security simultaneously. In this paper, we propose a Privacy-preserving Personalized Federated Learning under Secure Multi-party Computation (SMC-PPFL), which can preserve privacy while obtaining a local personalized model with high prediction accuracy. In SMC-PPFL, noise perturbation is utilized to protect similarity computation, and secure multi-party computation is employed for model sub-aggregations. This combination ensures that clients' privacy is preserved, and the computed values remain unbiased without compromising security. Then, we propose a weighted sub-aggregation strategy based on the similarity of clients and introduce a regularization term in the local training to improve prediction accuracy. Finally, we evaluate the performance of SMC-PPFL on three common datasets. The experimental results show that SMC-PPFL achieves 2% ∼ 15% higher prediction accuracy compared to the previous PFL schemes. Besides, the security analysis also verifies that SMC-PPFL can resist model inversion attacks and membership inference attacks

High-performance traffic flow prediction models provide reliable future road information and optimize traffic navigation systems. However, the traffic data used for model learning contains lots of private information, and the existing privacy-preserving strategies always reduce the accuracy of prediction models. Besides, an effective traffic flow prediction model needs to be continuously and rapidly updated to adapt to dynamic changes in the traffic environment. Thus, we propose a Secure and Efficient Continuous Learning Model (SE-CLM) based on broad learning, spatial correlation, and adaptive sampling processing techniques to realize accurate and efficient traffic flow prediction under strong privacy protection. Specifically, SE-CLM is constructed on the broad network architecture to enable fast and continuous model training. This model is trained on a cloud server by combining the spatial correlation of traffic flows, to achieve accurate traffic flow prediction. Besides, an adaptive sampling strategy is designed to further improve the prediction accuracy of the model under the protection with differential privacy (DP), where the budget allocation for DP is optimized by adaptively sampling traffic flows with different timestamps for noise perturbation processing. Furthermore, the experimental simulations are conducted in real vehicular mobility datasets. The experimental results show that the designed spatial-based SE-CLM achieve more accurate and efficient traffic flow prediction than those of the other existing schemes. The adaptive sampling strategy not only significantly reduces the DP-noise added in traffic flows but also a 20% reduction in communication volume compared to other strategies. Finally, the security analysis also verifies that SE-CLM satisfies w-event ε-DP.

Data trading is an effective way for commercial companies to obtain massive personal data to develop their data-driven businesses. However, when data owners may want to sell their data without revealing privacy, data consumers also face the dilemma of high purchase costs due to purchasing too much invalid data. Therefore, there is an urgent need for a data trading scheme that can protect personal privacy and save expenses simultaneously. In this paper, we design a privACy-preserving and praCtical aggrEgateStatiStic trading scheme (named as ACCESS). Technically, we focus on the group-level pricing strategy to make ACCESS easier to implement. The differential privacy technique is applied to protect the data owners' privacy, and the sampling algorithm is adopted to reduce the data consumers' costs. Specifically, to provide a maximum tolerant privacy loss guarantee for the data owners, we design a decision algorithm to detect whether a conflict occurs between the consumer-specified accuracy level and the maximum tolerable privacy loss budget. Besides, to minimize the purchase cost for the data brokers, we develop a sampling-based aggregation method consisting of two sampling algorithms (called as BUSA and BKSA, respectively). BUSA enables reducing purchase costs with no additional background knowledge. Once the data broker knows the data boundary, BKSA can significantly reduce the amount of data that needs to be purchased, thereby the purchase cost is reduced. Rigorous theoretical analysis and extensive experiments (over four real-world and public datasets) further demonstrate the practicability of ACCESS.

The real-time data generated from various smart devices will be released and shared for public to obtain numerous benefits. However, it will lead to individual privacy leakage because of data mining or analysis. Currently, many existing privacy protection models either fail to be directly applied in real-time data release or are unsatisfactory in terms of data utility and privacy protection. Toward this end, based on m-signature and fuzzy processing, an anonymous privacy protection model, named PMF, is proposed in this paper. Specifically, for the proposed model there are five advantages: 1) PMF defines m-signature for making each bucket with at least m different sensitive values instead of generating any counterfeit tuples, which can not only resist h-difference attack but also improve practical value; 2) the buckets satisfying m-signature are variable over time, and this flexibility of m-signature can improve the efficiency of dynamic update; 3) PMF can effectively insert, delete, and modify real-time data for release; 4) PMF applies fuzzy processing to handle the tuples in the candidate list, which strikes a good balance between the utility of released data and privacy protection; and 5) PMF adopts greedy heuristic algorithm to process update operations, which greatly reduces the information loss of released data. Furthermore, PMF is obviously more secure than the existing models in the real-time data release. Finally, the results of the comparison experiments on real-world and synthetic datasets illustrate that PMF is superior to the existing models in terms of data utility and efficiency.