The Evaluation of Social Sharing Nets Users’ Fundamental Principals According to Nickname Usage and Time Spent

This work;It was made to determine the positive and negative usage information, attitudes and behaviors of social networking networks for users. Today, it is well known how the wide social effects of social networking sites are widespread and effective. As far as it can be followed from written and visual media, it causes significant damages for attitudes and behaviors for individuals. Looking at the results of the study, it seems impossible to limit the time and necessity of these networks for people, but it is understood that people force their limits and capacity. It was determined that the general acceptance and rejection areas are mixed and the dominant distinctive effects were weakened. Unable to prevent social dissolution and deterioration was realized by these social networks of networks. However, we cannot only talk about negative effects because their positive effects should be mentioned. Data were obtained in this direction. For example, some segments encourage the users of these sites to have more freedom, to develop democracy and human rights awareness. However, the real problem is when and where to stand. This study;Social networking networks use information, attitudes and behaviors;It was carried out for the purpose of evaluating the use of nicknames and networks for the use of networks. The data of the study were obtained by the application of a questionnaire and the data obtained were analyzed with appropriate statistical analysis methods. In the first part of the study, field study/operational concept scanning is performed and theoretical information is included. In the second part, the purpose of the study, the problem status, the importance of the study, limitations, assumptions, problem question, research method, research universe and sample are specified and informed. In the third section, the data obtained using appropriate statistical methods are analyzed. In the last section, some important suggestions and comments are made in the light of the data obtained.

Proactive Spectrum Monitoring for Suspicious Wireless Powered Communications in Dynamic Spectrum Sharing Networks

This paper studies the proactive spec-trum monitoring with one half-duplex spectrum moni-tor(SM)to cope with the potential suspicious wireless powered communications(SWPC)in dynamic spec-trum sharing networks.The jamming-assisted spec-trum monitoring scheme via spectrum monitoring data(SMD)transmission is proposed to maximize the sum ergodic monitoring rate at SM.In SWPC,the suspi-cious communications of each data block occupy mul-tiple independent blocks,with a block dedicated to the wireless energy transfer by the energy-constrained suspicious nodes with locations in a same cluster(symmetric scene)or randomly distributed(asymmet-ric scene)and the remaining blocks used for the in-formation transmission from suspicious transmitters(STs)to suspicious destination(SD).For the sym-metric scene,with a given number of blocks for SMD transmission,namely the jamming operation,we first reveal that SM should transmit SMD signal(jam the SD)with tolerable maximum power in the given blocks.The perceived suspicious signal power at SM could be maximized,and thus so does the correspond-ing sum ergodic monitoring rate.Then,we further reveal one fundamental trade-off in deciding the op-timal number of given blocks for SMD transmission.For the asymmetric scene,a low-complexity greedy block selection scheme is proposed to guarantee the optimal performance.Simulation results show that the jamming-assisted spectrum monitoring schemes via SMD transmission achieve much better perfor-mance than conventional passive spectrum monitor-ing,since the proposed schemes can obtain more accu-rate and effective spectrum characteristic parameters,which provide basic support for fine-grained spectrum management and a solution for spectrum security in dynamic spectrum sharing network.

Hierarchical Spectrum Sharing Networks

A spectrum heterogeneity analysis in the cognitive radio network is conducted in this paper. Subsequently,a spectrum-heterogeneity-based hierarchical spectrum sharing(HSS) network for cognitive radio is proposed.The corresponding method of classifying available spectrums and communication based on the proposed architecture is also presented. Based on the above network architecture,we propose a reference protocol architecture.Research on these protocol function blocks,such as spectrum sensing,spectrum manager,and so on,is conducted. Numerical results show that HSS can provide a considerable extension to available spectrums so that the spectral utility may be further improved.

Low-Cost Federated Broad Learning for Privacy-Preserved Knowledge Sharing in the RIS-Aided Internet of Vehicles

High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility environment.In order to protect data privacy and improve data learning efficiency in knowledge sharing,we propose an asynchronous federated broad learning(FBL)framework that integrates broad learning(BL)into federated learning(FL).In FBL,we design a broad fully connected model(BFCM)as a local model for training client data.To enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients,we construct a joint resource allocation and reconfigurable intelligent surface(RIS)configuration optimization framework for FBL.The problem is decoupled into two convex subproblems.Aiming to improve the resource scheduling efficiency in FBL,a double Davidon–Fletcher–Powell(DDFP)algorithm is presented to solve the time slot allocation and RIS configuration problem.Based on the results of resource scheduling,we design a reward-allocation algorithm based on federated incentive learning(FIL)in FBL to compensate clients for their costs.The simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency,accuracy,and cost for knowledge sharing in the IoV.

Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks

Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.

Blockchain-Enabled Federated Learning for Privacy-Preserving Non-IID Data Sharing in Industrial Internet

Sharing data while protecting privacy in the industrial Internet is a significant challenge.Traditional machine learning methods require a combination of all data for training;however,this approach can be limited by data availability and privacy concerns.Federated learning(FL)has gained considerable attention because it allows for decentralized training on multiple local datasets.However,the training data collected by data providers are often non-independent and identically distributed(non-IID),resulting in poor FL performance.This paper proposes a privacy-preserving approach for sharing non-IID data in the industrial Internet using an FL approach based on blockchain technology.To overcome the problem of non-IID data leading to poor training accuracy,we propose dynamically updating the local model based on the divergence of the global and local models.This approach can significantly improve the accuracy of FL training when there is relatively large dispersion.In addition,we design a dynamic gradient clipping algorithm to alleviate the influence of noise on the model accuracy to reduce potential privacy leakage caused by sharing model parameters.Finally,we evaluate the performance of the proposed scheme using commonly used open-source image datasets.The simulation results demonstrate that our method can significantly enhance the accuracy while protecting privacy and maintaining efficiency,thereby providing a new solution to data-sharing and privacy-protection challenges in the industrial Internet.

Impact of Sharing Marketing on Marketing Willingness of Employees in Internet Decoration Industry

With the development of information technology,sharing marketing,as an innovative marketing method,plays an important role in promoting the marketing willingness and enthusiasm of employees in the Internet decoration industry.Based on the data obtained from the ques-tionnaire survey,this paper makes an empirical analysis of the impact of the economic value,social value,perceived ease of use,perceived convenience,enabling conditions and subjective norms of sharing marketing on the marketing willingness of employees in the Internet decoration industry.The results showed that the questionnaire had good internal consistency and construct validity.Through empirical analysis,it can be found that the economic value,social value,perceived ease of use,perceived convenience,enabling conditions and subjective norms of sharing marketing have a significant positive impact on employees'marketing willingness.

Research on Data Tampering Prevention Method for ATC Network Based on Zero Trust

The traditional air traffic control information sharing data has weak security characteristics of personal privacy data and poor effect,which is easy to leads to the problem that the data is usurped.Starting from the application of the ATC(automatic train control)network,this paper focuses on the zero trust and zero trust access strategy and the tamper-proof method of information-sharing network data.Through the improvement of ATC’s zero trust physical layer authentication and network data distributed feature differentiation calculation,this paper reconstructs the personal privacy scope authentication structure and designs a tamper-proof method of ATC’s information sharing on the Internet.From the single management authority to the unified management of data units,the systematic algorithm improvement of shared network data tamper prevention method is realized,and RDTP(Reliable Data Transfer Protocol)is selected in the network data of information sharing resources to realize the effectiveness of tamper prevention of air traffic control data during transmission.The results show that this method can reasonably avoid the tampering of information sharing on the Internet,maintain the security factors of air traffic control information sharing on the Internet,and the Central Processing Unit(CPU)utilization rate is only 4.64%,which effectively increases the performance of air traffic control data comprehensive security protection system.

Federated Learning with Blockchain for Privacy-Preserving Data Sharing in Internet of Vehicles

Data sharing technology in Internet of Vehicles(Io V)has attracted great research interest with the goal of realizing intelligent transportation and traffic management.Meanwhile,the main concerns have been raised about the security and privacy of vehicle data.The mobility and real-time characteristics of vehicle data make data sharing more difficult in Io V.The emergence of blockchain and federated learning brings new directions.In this paper,a data-sharing model that combines blockchain and federated learning is proposed to solve the security and privacy problems of data sharing in Io V.First,we use federated learning to share data instead of exposing actual data and propose an adaptive differential privacy scheme to further balance the privacy and availability of data.Then,we integrate the verification scheme into the consensus process,so that the consensus computation can filter out low-quality models.Experimental data shows that our data-sharing model can better balance the relationship between data availability and privacy,and also has enhanced security.

A dynamic and resource sharing virtual network mapping algorithm

Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.

Decentralized content sharing in mobile ad-hoc networks:A survey

The evolution of smart mobile devices has significantly impacted the way we generate and share contents and introduced a huge volume of Internet traffic.To address this issue and take advantage of the short-range communication capabilities of smart mobile devices,the decentralized content sharing approach has emerged as a suitable and promising alternative.Decentralized content sharing uses a peer-to-peer network among colocated smart mobile device users to fulfil content requests.Several articles have been published to date to address its different aspects including group management,interest extraction,message forwarding,participation incentive,and content replication.This survey paper summarizes and critically analyzes recent advancements in decentralized content sharing and highlights potential research issues that need further consideration.

A New Double Layer Multi-Secret Sharing Scheme

Cryptography is deemed to be the optimum strategy to secure the data privacy in which the data is encoded ahead of time before sharing it.Visual Secret Sharing(VSS)is an encryption method in which the secret message is split into at least two trivial images called’shares’to cover it.However,such message are always targeted by hackers or dishonest members who attempt to decrypt the message.This can be avoided by not uncovering the secret message without the universal share when it is presented and is typically taken care of,by the trusted party.Hence,in this paper,an optimal and secure double-layered secret image sharing scheme is proposed.The proposed share creation process contains two layers such as threshold-based secret sharing in the first layer and universal share based secret sharing in the second layer.In first layer,Genetic Algorithm(GA)is applied to find the optimal threshold value based on the randomness of the created shares.Then,in the second layer,a novel design of universal share-based secret share creation method is proposed.Finally,Opposition Whale Optimization Algorithm(OWOA)-based optimal key was generated for rectange block cipher to secure each share.This helped in producing high quality reconstruction images.The researcher achieved average experimental outcomes in terms of PSNR and MSE values equal to 55.154225 and 0.79365625 respectively.The average PSNRwas less(49.134475)and average MSE was high(1)in case of existing methods.

Blockchain-Based MCS Detection Framework of Abnormal Spectrum Usage for Satellite Spectrum Sharing Scenario

In this paper, the problem of abnormal spectrum usage between satellite spectrum sharing systems is investigated to support multi-satellite spectrum coexistence. Given the cost of monitoring, the mobility of low-orbit satellites, and the directional nature of their signals, traditional monitoring methods are no longer suitable, especially in the case of multiple power level. Mobile crowdsensing(MCS), as a new technology, can make full use of idle resources to complete a variety of perceptual tasks. However, traditional MCS heavily relies on a centralized server and is vulnerable to single point of failure attacks. Therefore, we replace the original centralized server with a blockchain-based distributed service provider to enable its security. Therefore, in this work, we propose a blockchain-based MCS framework, in which we explain in detail how this framework can achieve abnormal frequency behavior monitoring in an inter-satellite spectrum sharing system. Then, under certain false alarm probability, we propose an abnormal spectrum detection algorithm based on mixed hypothesis test to maximize detection probability in single power level and multiple power level scenarios, respectively. Finally, a Bad out of Good(BooG) detector is proposed to ease the computational pressure on the blockchain nodes. Simulation results show the effectiveness of the proposed framework.

FADSF:A Data Sharing Model for Intelligent Connected Vehicles Based on Blockchain Technology

With the development of technology,the connected vehicle has been upgraded from a traditional transport vehicle to an information terminal and energy storage terminal.The data of ICV(intelligent connected vehicles)is the key to organically maximizing their efficiency.However,in the context of increasingly strict global data security supervision and compliance,numerous problems,including complex types of connected vehicle data,poor data collaboration between the IT(information technology)domain and OT(operation technology)domain,different data format standards,lack of shared trust sources,difficulty in ensuring the quality of shared data,lack of data control rights,as well as difficulty in defining data ownership,make vehicle data sharing face a lot of problems,and data islands are widespread.This study proposes FADSF(Fuzzy Anonymous Data Share Frame),an automobile data sharing scheme based on blockchain.The data holder publishes the shared data information and forms the corresponding label storage on the blockchain.The data demander browses the data directory information to select and purchase data assets and verify them.The data demander selects and purchases data assets and verifies them by browsing the data directory information.Meanwhile,this paper designs a data structure Data Discrimination Bloom Filter(DDBF),making complaints about illegal data.When the number of data complaints reaches the threshold,the audit traceability contract is triggered to punish the illegal data publisher,aiming to improve the data quality and maintain a good data sharing ecology.In this paper,based on Ethereum,the above scheme is tested to demonstrate its feasibility,efficiency and security.

Verifiable quantum secret sharing scheme based on orthogonal product states

In the domain of quantum cryptography,the implementation of quantum secret sharing stands as a pivotal element.In this paper,we propose a novel verifiable quantum secret sharing protocol using the d-dimensional product state and Lagrange interpolation techniques.This protocol is initiated by the dealer Alice,who initially prepares a quantum product state,selected from a predefined set of orthogonal product states within the C~d■C~d framework.Subsequently,the participants execute unitary operations on this product state to recover the underlying secret.Furthermore,we subject the protocol to a rigorous security analysis,considering both eavesdropping attacks and potential dishonesty from the participants.Finally,we conduct a comparative analysis of our protocol against existing schemes.Our scheme exhibits economies of scale by exclusively employing quantum product states,thereby realizing significant cost-efficiency advantages.In terms of access structure,we adopt a(t, n)-threshold architecture,a strategic choice that augments the protocol's practicality and suitability for diverse applications.Furthermore,our protocol includes a rigorous integrity verification mechanism to ensure the honesty and reliability of the participants throughout the execution of the protocol.

Cryptanalysis of efficient semi-quantum secret sharing protocol using single particles

In paper[Chin.Phys.B 32070308(2023)],Xing et al.proposed a semi-quantum secret sharing protocol by using single particles.We study the security of the proposed protocol and find that it is not secure,that is,the three dishonest agents,Bob,Charlie and Emily can collude to obtain Alice's secret without the help of David.

A General Framework for Intelligent IoT Data Acquisition and Sharing in an Untrusted Environment Based on Blockchain

Traditional Io T systems suffer from high equipment management costs and difficulty in trustworthy data sharing caused by centralization.Blockchain provides a feasible research direction to solve these problems. The main challenge at this stage is to integrate the blockchain from the resourceconstrained Io T devices and ensure the data of Io T system is credible. We provide a general framework for intelligent Io T data acquisition and sharing in an untrusted environment based on the blockchain, where gateways become Oracles. A distributed Oracle network based on Byzantine Fault Tolerant algorithm is used to provide trusted data for the blockchain to make intelligent Io T data trustworthy. An aggregation contract is deployed to collect data from various Oracle and share the credible data to all on-chain users. We also propose a gateway data aggregation scheme based on the REST API event publishing/subscribing mechanism which uses SQL to achieve flexible data aggregation. The experimental results show that the proposed scheme can alleviate the problem of limited performance of Io T equipment, make data reliable, and meet the diverse data needs on the chain.

A Blind Batch Encryption and Public Ledger-Based Protocol for Sharing Sensitive Data

For the goals of security and privacy preservation,we propose a blind batch encryption-and public ledger-based data sharing protocol that allows the integrity of sensitive data to be audited by a public ledger and allows privacy information to be preserved.Data owners can tightly manage their data with efficient revocation and only grant one-time adaptive access for the fulfillment of the requester.We prove that our protocol is semanticallly secure,blind,and secure against oblivious requesters and malicious file keepers.We also provide security analysis in the context of four typical attacks.

A verifiable essential secret image sharing scheme based on HLRs(VESIS-(t,s,k,n))

In traditional secret image sharing schemes,a secret image is shared among shareholders who have the same position.But if the shareholders have two different positions,essential and non‐essential,it is necessary to use essential secret image sharing schemes.In this article,a verifiable essential secret image sharing scheme based on HLRs is proposed.Shareholder's share consists of two parts.The first part is produced by the shareholders,which prevents the fraud of dealers.The second part is a shadow image that is produced by using HLRs and the first part of share.The verification of the first part of the shares is done for the first time by using multilinear and bilinear maps.Also,for verifying shadow images,Bloom Filters are used for the first time.The proposed scheme is more efficient than similar schemes,and for the first part of the shares,has formal security.

Blockchain-Based Key Management Scheme Using Rational Secret Sharing

Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of failure.Therefore,decentralized threshold key management schemes have become a research focus for blockchain private key protection.The security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset security.The threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public blockchains.We design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public blockchain.The proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart contracts.Compared to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.