检索结果-南通市图书馆

Precise sensitivity recognizing,privacy preserving,knowledge graph-based method for trajectory data publication

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of computer Science 2022年第4期16卷 219-221页

作者： Xianxian Li Bing Cai Li-e Wang Lei Lei Guangxi Key Lab of Multi-source Information Mining and security Guangxi Normal UniversityGuilin541004China college of computer Science and Information Engineering Guangxi Normal UniversityGuilin541004China Nanning Tiancheng Zhiyuan Intellectual Property service co.ltd. Nanning530000China

1Introduction The existing privacy protection methods of trajectory data publication have two ***,existing methods[1-3]cannot resist attribute link attacks *** practical scenarios,it is necessary to integrate data from a variety of fields for data analysis,such as cross-domain *** usually need to obtain the user attributes outside of the trajectory data as background knowledge.

关键词： knowledge outside preserving

Lattice-based certificateless encryption scheme

在线全文

学校读者我要写书评

暂无评论

Frontiers of computer Science 2014年第5期8卷 828-836页

作者： Mingming JIANG Yupu HU Hao LEI Baocang WANG Qiqi LAI State Key Laboratory of Integrated service Networks Xidian University Xi'an 710071 China security and Privacy Lab CRDU Huawei Technologies Co. LTD. Beijing 100095 China

Certificateless public key cryptography （CL- PKC） can solve the problems of certificate management in a public key infrastructure （PKI） and of key escrows in identity-based public key cryptography （ID-PKC）. In CL- PKC, the key generation center （KGC） does not know the private keys of all users, and their public keys need not be cer- tificated by certification authority （CA）. At present, however, most certificateless encryption schemes are based on large in- teger factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate- less encryption scheme based on lattices, more precisely, us- ing the hardness of the learning with errors （LWE） problem. compared with schemes based on large integer factoriza- tion and discrete logarithms, the most operations are matrix- vector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks （IND-CPA） secure in the random oracle model.

关键词： lattice-based cryptography LWE identity-based encryption (IBE) post-quantum cryptography certifi-cateless encryption

Design of an Information security service for Medical Artificial Intelligence

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & continua 2022年第1期70卷 679-694页

作者： Yanghoon Kim Jawon Kim Hangbae Chang Department of Cyber Drone Bot Military Engineering Shinhan UniversityUijeongbu-si11644Gyeonggi-doKorea Department of security convergence Graduate SchoolChung-Ang UniversityDongjack-gu06974SeoulKorea Department of Industrial security Chung-Ang UniversityDongjak-gu06974SeoulKorea

The medical convergence industry has gradually adopted ICT devices,which has led to legacy security problems related to ICT ***,it has been difficult to solve these problems due to data resource *** problems can cause a lack of reliability in medical artificial intelligence services that utilize medical ***,to provide reliable services focused on security internalization,it is necessary to establish a medical convergence environment-oriented security management *** study proposes the use of system identification and countermeasures to secure systemreliabilitywhen using medical convergence environment information in medical artificial *** checked the life cycle of medical information and the flow and location of information,analyzed the security threats that may arise during the life cycle,and proposed technical countermeasures to overcome such *** verified the proposed countermeasures through a survey of *** requirements were defined based on the information life cycle in the medical convergence *** also designed technical countermeasures for use in the security management systems of hospitals of diverse sizes.

关键词： Medical artificial intelligence medical information security convergence environment

Secure and privacy-preserving DRM scheme using homomorphic encryption in cloud computing

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2013年第6期20卷 88-95页

作者： HUANG Qin-long MA Zhao-feng YANG Yi-xian FU Jing-yi NIU Xin-xin Information security Center Beijing University of Posts and Telecommunications National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing National security Science and Technology co. ltd

Cloud computing provides a convenient way of content trading and sharing. In this paper, we propose a secure and privacy-preserving digital rights management （DRM） scheme using homomorphic encryption in cloud computing. We present an efficient digital rights management framework in cloud computing, which allows content provider to outsource encrypted contents to centralized content server and allows user to consume contents with the license issued by license server. Further, we provide a secure content key distribution scheme based on additive homomorphic probabilistic public key encryption and proxy re-encryption. The provided scheme prevents malicious employees of license server from issuing the license to unauthorized user. In addition, we achieve privacy preserving by allowing users to stay anonymous towards the key server and service provider. The analysis and comparison results indicate that the proposed scheme has high efficiency and security.

关键词： digital rights management homomorphic encryption proxy re-encryption privacy preserving cloud computing

Encrypted data sharing with multi-owner based on digital rights management in online social networks

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2014年第1期21卷 86-93页

作者： HUANG Qin-long FU Jing-yi MA Zhao-feng YANG Yi-xian NIU Xin-xin Information security Center Beijing University of Posts and Telecommunications National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing National security Science and Technology co. Ltd

The online social networks（OSNs） offer attractive means for social interactions and data sharing, as well as raise a number of security and privacy issues. Although current solutions propose to encrypt data before sharing, the access control of encrypted data has become a challenging task. Moreover, multiple owners may enforce different access policy to the same data because of their different privacy concerns. A digital rights management（DRM） scheme is proposed for encrypted data in OSNs. In order to protect users＇ sensitive data, the scheme allows users outsource encrypted data to the OSNs service provider for sharing and customize the access policy of their data based on ciphertext-policy attribute-based encryption. Furthermore, the scheme presents a multiparty access control model based on identity-based broadcast encryption and ciphertext-policy attribute-based proxy re-encryption, which enables multiple owners, such as tagged users who appear in a single data, customize the access policy collaboratively, and also allows the disseminators update the access policy if their attributes satisfy the existing access policy. security analysis and comparison indicate that the proposed scheme is secure and efficient.

关键词： digital rights management online social networks multi-owner attribute-based encryption broadcast encryption

construction of 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Good Nonlinearity

在线全文

学校读者我要写书评

暂无评论

Journal of computer Science & Technology 2011年第2期26卷 269-275页

作者：潘森杉傅晓彤张卫国 State Key Laboratory of Integrated service Networks Xidian University State Key Laboratory of Information security Institute of SoftwareChinese Academy of Sciences

This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler＇s upper bound of algebraic degree. Also a class of l-resilient functions on any number n 〉 2 of variables with at least sub-optimal algebraic immunity is provided.

关键词： stream ciphers Boolean functions 1-resilient algebraic immunity algebraic degree

Lightweight Mutual Authentication Scheme for Protecting Identity in Insecure Environment

在线全文

学校读者我要写书评

暂无评论

China communications 2018年第6期15卷 158-168页

作者： Xu Wu Jin Xu Binxing Fang School of Cyberspace security Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed computing and service (BUPT) Ministry of Education

Many improved authentication solutions were put forward, on purpose of authenticating more quickly and ***, neither the overuse of hash function,or additional symmetric encryption, can truly increase the overall security. Instead,extra computation cost degraded the *** were still vulnerable to a variety of threats, such as smart card loss attack and impersonation attack, due to hidden loopholes and flaws. Even worse, user's identity can be parsed in insecure environment, even became traceable. Aiming to protect identity, a lightweight mutual authentication scheme is proposed. Redundant operations are removed,which make the verification process more explicit. It gains better performance with average cost compared to other similar *** shows the proposed scheme can resist common attacks and achieve user *** security is further verified by using the widely accepted Automated Validation of Internet security Protocols and Applications(AVISPA) tool.

关键词： identify authentication light-weight authentication session key agreement user anonymity

Reconstruction methodology for rational secret sharing based on mechanism design

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第8期60卷 240-242页

作者： Hai LIU Xinghua LI Jianfeng MA Mengfan XU Jingjing GUO State Key Laboratory of Integrated service Networks Xidian University Shaanxi Key Laboratory of Network and System security Xidian University School of Cyber Engineering Xidian University

Rational secret sharing[1]is the intersection of game theory[2]and traditional secret sharing[3].In rational secret sharing,the players are selfish and always behave in accordance with profit *** this implies,primarily,is that rational players prefer obtaining the secret rather than not obtaining it and,secondarily,that players prefer as few other players as possible obtaining the *** by selfishness,rational players either keep silent or send incorrect shares during the reconstruction phase,thereby the fairness

关键词： GRS in is Reconstruction methodology for rational secret sharing based on mechanism design for Pi that of on

WARX: efficient white-box block cipher based on ARX primitives and random MDS matrix

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第3期65卷 196-210页

作者： Jun LIU Vincent RIJMEN Yupu HU Jie CHEN Baocang WANG State Key Laboratory of Integrated service Networks Xidian University Interuniversity Microelectronics Centre & computer security and Industrial Cryptography Group Department of Informatics University of Bergen

White-box cryptography aims to provide secure cryptographic primitives and implementations for the white-box attack model, which assumes that an adversary has full access to the implementation of the cryptographic algorithms. Real-world applications require highly efficient and secure white-box schemes,whereas the existing proposals cannot meet this demand. In this paper, we design a new white-box block cipher based on addition/rotation/XOR(ARX) primitives and random maximal distance separable(MDS)matrix, white-box ARX(WARX), aiming for efficient implementations in both black-and white-box *** implementation of WARX in the black-box model is nine times faster than SPNbox-16 from ASIACRYPT’16, and the implementation in the white-box model is more efficient than SPNbox-16 and WEM from CT-RSA’17. Moreover, the security of WARX in both black-and white-box models is analyzed, which ensures its practical applicability. The design of WARX shows that ARX primitives and random linear layer can improve the efficiency of a white-box block cipher. This article may inspire more provably secure and efficient white-box block ciphers and help to narrow the gap between provably secure white-box schemes from academia and highly applicable schemes in great demand from industry.

关键词： white-box cryptography block cipher design addition/rotation/XOR efficiency improvement