检索结果-南通市图书馆

Hierarchical group signature with verifier-local revocation revisited

在线全文

学校读者我要写书评

暂无评论

Science China(information Sciences) 2022年第8期65卷 282-284页

作者： Lin HOU Dongdai LIN Renzhang LIU State Key Laboratory of information security Institute of Information EngineeringChinese Academy of Sciences School of Cyber security University of Chinese Academy of Sciences Westone Cryptologic Research center Westone Information Industry INC.

Dear editor,Group signature(GS) [1] is a milestone in privacy-oriented cryptography, which provides authentication for messages and keeps signers anonymous. Trolin and Wikstr¨om [2]properly generalized GS into the notion of hierarchical group signature(HGS) and showed its typical usage in building anonymous credit card systems.

关键词：

Real-world traffic analysis and joint caching and scheduling for in-RAN caching networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2017年第6期60卷 176-190页

作者： Zejue WANG Hongjia LI Zhen XU State Key Laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

This paper analyzes the traffic of a current LTE network in China and investigates the joint optimization of content object caching and scheduling for in-radio access network(RAN) caches. Cooperative caching has been well recognized as a way of unleashing the ultimate potential of in-RAN caches, yet its feasibility is still unexplored. Moreover, content object caching and scheduling are two key issues for cache deployment,which are usually jointly considered and resolved. However, they are triggered by different events with different time granularities. Therefore, on the basis of the real-world dataset, the feasibility of in-RAN cooperative caching is proved from aspects of network topology, traffic load difference among small base stations(SBSs)and correlation analysis of content objects requested at different SBSs. Then, it is verified that different time scales should be considered in making content object caching and scheduling decisions. To exploit in-RAN cooperative caching while meeting the time scale requirement in making caching and scheduling decisions, an optimization problem is constructed considering practical transmission constraints in wireless and backhaul. It is proved to be a quadratic assignment problem, and then, a joint caching, and wireless and backhaul scheduling algorithm is proposed based on Lagrangian relaxation and decomposition, and hastening branch and *** performance of the proposed algorithm is evaluated based on the real-world dataset. Results depict the relationship among the cache capacity, the number of SBSs, the connection probability of SBSs and the objective performance, and show that the proposed algorithm can achieve better performance, compared with the existing algorithms.

关键词： 5G mobile edge caching mobile traffic analysis optimization cooperative caching

Image composite authentication using a single shadow observation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2015年第9期58卷 122-134页

作者： CAO XiaoChun ZHAO HanDong WANG Chuan ZHANG Wei State Key Laboratory of information security Institute of Information Engineering Chinese Academy of Sciences

The paper presents a novel method for image composite authentication based on a single shadow in an outdoor image. Existing methods based on the shadow geometry consistency involve more than two shadow observations. We relax the requirement of two shadow observations in the same scene. As a trade-off,we use the information in EXIF(Exchangeable Image File) based on which the ground truth sun elevation is calculated. We also estimate the sun elevation based on geometric constraints the scene provides, whose consistency serves as the cue to authenticate image forgery. It is the first attempt, to our best knowledge, to make use of sun elevation with shadow of one object to authenticate outdoor images. Also, the novel use of GPS(Global Positioning System), and Date and Time data of captured image makes image forensics possible even in one image containing a single shadow. Experimental results on both the synthetic data and visually plausible images demonstrate the performance of the proposed method.

关键词： image forensics solar shadow sun elevation exchangeable image file geometry-based technique

A novel multisignature scheme for a special verifier group against clerk and rogue-key attacks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science C(Computers and Electronics) 2010年第4期11卷 290-295页

作者： Jia-lun TSAI Tzong-chen WU Kuo-yu TSAI Department of information Management National Taiwan University of Science and Technology Taiwan information security center National Taiwan University of Science and Technology

The digital signature is a very important subject for network *** multiple signers and multiple verifiers,Xie and Yu(2004) pointed out that the multisignature scheme of Laih and Yen(1996) is vulnerable to a harmful *** attack can occur when a specified group of verifiers cooperate to forge a multisignature by secret key substitution following the leak of a secret key or by group public key adjustment during the process of renewing *** and Yu proposed an improvement of Laih and Yen's multisignature *** this paper,we show that Xie and Yu's scheme is vulnerable to clerk and rogue-key *** propose an improved multisignature scheme to resist such *** the proposed scheme,multiple signers can generate a multisignature for the message with the signers' secret keys,and the specified group of verifiers can cooperate to verify the validity of the multisignature with the signers' public keys and the verifiers' secret *** proposed scheme for a special verifier group not only has the advantages of Xie and Yu's scheme,but also is secure against clerk and rogue-key attacks.

关键词： Multisignature Clerk attack Rogue-key attack Cryptosystem

Microblog Burst Keywords Detection Based on Social Trust and Dynamics Model

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2014年第4期23卷 695-700页

作者： DONG Guozhong LI Ruiguang YANG Wu WANG Wei GONG Liangyi SHEN Guowei YU Miao LV Jiguang information security Research center Harbin Engineering University National Computer Network Emergency Response Technical Team/Coordination center

Microblog has emerged as a popular medium for providing new sources of information and rapid communications, particularly during burst topics. Burst keywords detection from real-time microblog streams is important for burst topics detection. The exiting algorithms may detect fake burst keywords without taking into account the trustworthiness of the users and human’s daily timetable. Our work is the first to combine the trustworthiness of the users with burst keywords detection. We propose a novel approach to detect burst keywords based on social trust and dynamics model. We adapt basic notions of dynamics from physics and model keywords bursts as momentum change of the keywords. On the analogy of physical dynamics model, this approach defines mass as the trustworthiness of user and position as the frequency of keywords. We compute each keyword’s burst value by using Moving average convergence/divergence(MACD) and determine whether it is a burst keyword in a given time window. The experimental results on large-scale Sina microblog dataset show that the proposed approach can avoid detecting fake burst keywords.

关键词： Sina microblog Burst keywords detection Social trust Dynamics model

VNF-FG design and VNF placement for 5G mobile networks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(information Sciences) 2017年第4期60卷 17-31页

作者： Jiuyue CAO Yan ZHANG Wei AN Xin CHEN Jiyan SUN Yanni HAN State Key Laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

Network function virtualization(NFV) is envisioned as one of the critical technologies in 5thGeneration(5G) mobile networks. This paper investigates the virtual network function forwarding graph(VNFFG) design and virtual network function(VNF) placement for 5G mobile networks. We first propose a two-step method composed of flow designing and flow combining for generating VNF-FGs according to network service requests. For mapping VNFs in the generated VNF-FG to physical resources, we then modify the hybrid NFV environment with introducing more types of physical nodes and mapping modes for the sake of completeness and practicality, and formulate the VNF placement optimization problem for achieving lower bandwidth consumption and lower maximum link utilization simultaneously. To resolve this problem, four genetic algorithms are proposed on the basis of the frameworks of two existing algorithms(multiple objective genetic algorithm and improved non-dominated sorting genetic algorithm). Simulation results show that Greedy-NSGA-II achieves the best performance among our four algorithms. Compared with three non-genetic algorithms(random, backtracking mapping and service chains deployment with affiliation-aware), Greedy-NSGA-II reduces 97.04%, 87.76% and88.42% of the average total bandwidth consumption, respectively, and achieves only 13.81%, 25.04% and 25.41%of the average maximum link utilization, respectively. Moreover, using our VNF-FG design method and GreedyNSGA-II together can also reduce the total bandwidth consumption remarkably.

关键词： network function virtualization VNF-FG design VNF placement multi-objective optimization genetic algorithm

A MATRIX CONSTRUCTION OF BOOLEAN FUNCTIONS WITH MAXIMUM ALGEBRAIC IMMUNITY

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2012年第4期25卷 792-801页

作者： Yonghong XIE Lei HU State Key Laboratory of information security Institute of Information EngineeringChinese Academy of Sciences

Boolean functions used in a cryptographic system should have high algebraic immunity to resist algebraic attacks. This paper presents a matrix method for constructing balanced Boolean functions achieving maximum algeb... 详细信息

关键词： Algebraic immunity block upper triangular matrix Boolean function.

Generalization of perfect concurrent signatures

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2012年第6期19卷 94-104页

作者： YE Qing ZHENG Shi-hui GUO Hong-fu YANG Yi-xian information security center Beijing University of Posts and Telecommunications School of Aerospace Engineering Beijing Institute of Technology

Recently, Susilo et al.＇s perfect concurrent signature scheme （PCS1） and Wang et al.＇s improved perfect concurrent signature scheme （iPCS1） are proposed, which are considered as good improvements on concurrent signatures, and they adopt the same algorithms. In this paper, we develop generic perfect concurrent signature algorithms of which Susilo et al. and Wang et al.＇s algorithms turn out to be a special instance. We also obtain numerous new, efficient variants from the generic algorithms which have not been proposed before. To display the advantage of these variants, a modified privacy-preserving PCS protocol is given. It shows that the new variants adapt to the protocol well and can form concrete privacy-preserving PCS schemes, while the original algorithms do not. security proofs and efficiency analysis are also given.

关键词： generalization perfect concurrent signature fair exchange variant Schnorr

Two Constructions of Optimal Cartesian Authentication Codes from Unitary Geometry over Finite Fields

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2013年第4期29卷 829-836页

作者： Shang-di CHEN Da-wei ZHAO College of Science Civil Aviation University of China information security center Beijing University of Posts and Telecommunications

Two constructions of cartesian authentication codes from unitary geometry are given in this paper. Their size parameters and their probabilities of successful impersonation attack and successful substitution attack ar... 详细信息

关键词： unitary geometry optimal authentication code finite field