现代汉语网络流行语‘云+X’浅析

孙志鑫 ( Sun Zhixin ),韩容洙 ( Han Rongzhu ) 충남대학교 인문과학연구소 2021 인문학연구 Vol.60 No.2

단어는 사회문화를 반영하는 거울이다. 그래서 새로운 단어들은 그 시대 변화와 새로운 개념의 제시를 함으로써 새로운 현상으로 인한 발생이 모두 단어에 반영된다. 특히, 요즘과 같은 5G 시대에는 하루하루가 빠른 발전과 IT의 영향으로 '云计算'같은 단어가 점차 사람들의 일상에 등장하게 되고, 자주 사용됨으로써 하나의 단어가 되었다. '云'이라는 단어도 발전하는 시기를 거쳤는데, '云'은 공중에 떠다니는 것만을 의미하는 것이 아니고, 기본 의미에서는 「클라우드 인터넷(云端互联网)」의 뜻으로 원래 의미에서 어느 정도 벗어났음을 알 수 있다. ‘互联网’의 의미에서 '云'이 다른 단어와 결합하여, 컴퓨터 분야에 처음 등장한 다음, 점차 사람들의 일상 언어로 발전하는 새로운 단어가 됐음을 알 수 있다. 코로나19로 오프라인 활동이 불가능해진 사람들이 정상적인 소통을 위해 5G 인터넷과 빅데이터 기술에 의존해 온라인 활동을 시작했고, 다양한 온라인 생중계 활동이 일상생활을 풍요롭게 하고, ZOOM과 같은 다양한 커뮤니케이션 플랫폼이 사람들의 생활 문제를 해결하고 있다. 현재의 시대에 변화에 따라 '云健身, 云直播, 云会议, 云外交'등과 같은 새로운 단어들이 생겨났고, '云'은 「+线上直播, +实时互动」등과 같이 결합하여 하나 의미에만 머무르지 않고 파생되어 감을 알 수 있다. 또한 '云+X' 전체 의미 범위도 확대되고 어휘 의미에 따라서 다시 분류했다. Vocabulary is a mirror that reflects social culture. The emergence of new words is to grasp the pulse of the times. New concepts and occurrences of new phenomena will be reflected in the vocabulary as soon as possible. With the rise of Internet technology, the term ‘cloud computing’ has appeared in people's field of vision. ‘云' no longer just means an object floating in the air condensed from ice crystals, but summarizes the meaning of “+cloud internet” in its basic meaning. New words combined with other words first appeared in the computer field and then gradually Develop into people's daily life. Under the condition of the new crown epidemic that began in 2019, people cannot carry out offline activities. In order to communicate normally, people rely on 5G Internet and big data technology to open online activities. Various online live broadcast activities enrich people's daily life, and various interactive communication platforms Solve people's life problems. ‘云健身, 云直播, 云会议, 云外交' and other terms are born for operation. “云" extends the meaning of “+online live broadcast, +real-time interaction”. The words of the ‘云' family have also ushered in a climax of development.

Synthesis of BiVO₄@C Core-Shell Structure on Reduced Graphene Oxide with Enhanced Visible-Light Photocatalytic Activity

Sun, Zhihua,Li, Chenzhe,Zhu, Shenmin,Cho, Maenghyo,Chen, Zhixin,Cho, Kyeongjae,Liao, Yongliang,Yin, Chao,Zhang, Di Wiley (John WileySons) 2015 CHEM SUS CHEM Vol.8 No.16

Compression Method for IPSec over 6LoWPAN

( Huqing Wang ),( Zhixin Sun ) 한국인터넷정보학회 2018 KSII Transactions on Internet and Information Syst Vol.12 No.4

This paper focuses on a header compression method for the Authentication Header (AH) and Encapsulation Security Payload (ESP) for application to 6LoWPAN. Based on the context, an extendible compression method is developed by analysing each field of the AH and ESP. The method is carried out by resetting the AH and ESP header compression formats, adding a MOD field, and setting different working modes. Authentication, encryption, and a mixture of certification and encryption are provided as flexible options. In addition, the value of the original IPv6 extensible header ID (EID) field can be retained, while the number of occupied NHC_ID values can be decreased for future extendibility. The experimental results show the feasibility and validity of the current compression method. By comparison with other solutions, the new mechanism is demonstrated to be advantageous in terms of compression ratio, flexibility and extendibility.

A key-insulated CP-ABE with key exposure accountability for secure data sharing in the cloud

( Hanshu Hong ),( Zhixin Sun ),( Ximeng Liu ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.5

ABE has become an effective tool for data protection in cloud computing. However, since users possessing the same attributes share the same private keys, there exist some malicious users exposing their private keys deliberately for illegal data sharing without being detected, which will threaten the security of the cloud system. Such issues remain in many current ABE schemes since the private keys are rarely associated with any user specific identifiers. In order to achieve user accountability as well as provide key exposure protection, in this paper, we propose a key-insulated ciphertext policy attribute based encryption with key exposure accountability (KI-CPABE-KEA). In our scheme, data receiver can decrypt the ciphertext if the attributes he owns match with the self-centric policy which is set by the data owner. Besides, a unique identifier is embedded into each user`s private key. If a malicious user exposes his private key for illegal data sharing, his identity can be exactly pinpointed by system manager. The key-insulation mechanism guarantees forward and backward security when key exposure happens as well as provides efficient key updating for users in the cloud system. The higher efficiency with proved security make our KI-CPABE-KEA more appropriate for secure data sharing in cloud computing.

Image Deduplication Based on Hashing and Clustering in Cloud Storage

( Lu Chen ),( Feng Xiang ),( Zhixin Sun ) 한국인터넷정보학회 2021 KSII Transactions on Internet and Information Syst Vol.15 No.4

With the continuous development of cloud storage, plenty of redundant data exists in cloud storage, especially multimedia data such as images and videos. Data deduplication is a data reduction technology that significantly reduces storage requirements and increases bandwidth efficiency. To ensure data security, users typically encrypt data before uploading it. However, there is a contradiction between data encryption and deduplication. Existing deduplication methods for regular files cannot be applied to image deduplication because images need to be detected based on visual content. In this paper, we propose a secure image deduplication scheme based on hashing and clustering, which combines a novel perceptual hash algorithm based on Local Binary Pattern. In this scheme, the hash value of the image is used as the fingerprint to perform deduplication, and the image is transmitted in an encrypted form. Images are clustered to reduce the time complexity of deduplication. The proposed scheme can ensure the security of images and improve deduplication accuracy. The comparison with other image deduplication schemes demonstrates that our scheme has somewhat better performance.

Scalable Blockchain Storage Model Based on DHT and IPFS

Lu Chen,Xin Zhang,Zhixin Sun 한국인터넷정보학회 2022 KSII Transactions on Internet and Information Syst Vol.16 No.7

Blockchain is a distributed ledger that combines technologies such as cryptography, consensus mechanism, peer-to-peer transmission, and time stamping. The rapid development of blockchain has attracted attention from all walks of life, but storage scalability issues have hindered the application of blockchain. In this paper, a scalable blockchain storage model based on Distributed Hash Table (DHT) and the InterPlanetary File System (IPFS) was proposed. This paper introduces the current research status of the scalable blockchain storage model, as well as the basic principles of DHT and the InterPlanetary File System. The model construction and workflow are explained in detail. At the same time, the DHT network construction mechanism, block heat identification mechanism, new node initialization mechanism, and block data read and write mechanism in the model are described in detail. Experimental results show that this model can reduce the storage burden of nodes, and at the same time, the blockchain network can accommodate more local blocks under the same block height.

Provably secure attribute based signcryption with delegated computation and efficient key updating

( Hanshu Hong ),( Yunhao Xia ),( Zhixin Sun ),( Ximeng Liu ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.5

Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be given full consideration in attribute based cryptosystem. In this paper, we present a key-policy attribute based signcryption scheme (KP-ABSC) with delegated computation and efficient key updating. In our scheme, an access structure is embedded into user`s private key, while ciphertexts corresponds a target attribute set. Only the two are matched can a user decrypt and verify the ciphertexts. When the access privileges have to be altered or key exposure happens, the system will evolve into the next time slice to preserve the forward security. What`s more, data receivers can delegate most of the de-signcryption task to data server, which can reduce the calculation on client`s side. By performance analysis, our scheme is shown to be secure and more efficient, which makes it a promising method for data protection in data outsourcing systems.

Data Sorting-based Adaptive Spatial Compression in Wireless Sensor Networks

( Siguang Chen ),( Jincheng Liu ),( Kun Wang ),( Zhixin Sun ),( Xuejian Zhao ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.8

Wireless sensor networks (WSNs) provide a promising approach to monitor the physical environments, to prolong the network lifetime by exploiting the mutual correlation among sensor readings has become a research focus. In this paper, we design a hierarchical network framework which guarantees layered-compression. Meanwhile, a data sorting-based adaptive spatial compression scheme (DS-ASCS) is proposed to explore the spatial correlation among signals. The proposed scheme reduces the amount of data transmissions and alleviates the network congestion. It also obtains high compression performance by sorting original sensor readings and selectively discarding the small coefficients in transformed matrix. Moreover, the compression ratio of this scheme varies according to the correlation among signals and the value of adaptive threshold, so the proposed scheme is adaptive to various deploying environments. Finally, the simulation results show that the energy of sorted data is more concentrated than the unsorted data, and the proposed scheme achieves higher reconstruction precision and compression ratio as compared with other spatial compression schemes.

A Symmetric Lookup-based Secure P2P Routing Algorithm

( Bingqing Luo ),( Yiai Jin ),( Shengmei Luo ),( Zhixin Sun ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.5

To prevent structured peer to peer (P2P) overlay networksfrom being attacked by malicious nodes, a symmetric lookup-based routing algorithm referred to as Symmetric-Chord is proposed in this paper. The proposed algorithm determines the precision of routing lookup by constructing multiple paths to the destination. The selective routing algorithm is used to acquire information on the neighbors of the root. Authenticity of the root is validated via consistency shown between the information ascertained from the neighbors and information from the yet-to-be-verified root, resulting in greater efficiency of resource lookup. Simulation results demonstrate that Symmetric-Chordhas the capability of detecting malicious nodes both accurately and efficiently, so as to identify which root holds the correct key, and provides an effective approach to the routing security for the P2P overlay network.

A Secure and Efficient Cloud Resource Allocation Scheme with Trust Evaluation Mechanism Based on Combinatorial Double Auction

( Yunhao Xia ),( Hanshu Hong ),( Guofeng Lin ),( Zhixin Sun ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.9

Cloud computing is a new service to provide dynamic, scalable virtual resource services via the Internet. Cloud market is available to multiple cloud computing resource providers and users communicate with each other and participate in market transactions. However, since cloud computing is facing with more and more security issues, how to complete the allocation process effectively and securely become a problem urgently to be solved. In this paper, we firstly analyze the cloud resource allocation problem and propose a mathematic model based on combinatorial double auction. Secondly, we introduce a trust evaluation mechanism into our model and combine genetic algorithm with simulated annealing algorithm to increase the efficiency and security of cloud service. Finally, by doing the overall simulation, we prove that our model is highly effective in the allocation of cloud resources.