检索结果-南通市图书馆

A NEW PRIVACY-PRESERVING EUCLID-DISTANCE PROTOCOL AND ITS APPLICATIONS IN WSNS

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2013年第2期30卷 190-197页

作者： Chen Ping Ji Yimu Wang Ruchuan Huang Haiping Zhang Dan College of Computer Nanjing University of Posts and Telecommunications Jiangsu High Technology Research key laboratory for Wireless Sensor networks key lab of Broadband Wireless Communication and Sensor network Technology of ministry of education Nanjing University of Posts and Telecommunications

Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.

关键词： Secure multi-party computation Privacy-preserving Euclid-distance protocol Wireless Sensor networks (WSNs) Density-Based Clustering Protocol (DBCP)

Load Feedback-Based Resource Scheduling and Dynamic Migration-Based Data Locality for Virtual Hadoop Clusters in OpenStack-Based Clouds

在线全文

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2017年第2期22卷 149-159页

作者： Dan Tao Zhaowen Lin Bingxu Wang School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China Jiangsu High Technology Research key laboratory for Wireless Sensor networks Nanjing 210003China network and Information Center Institute of Network TechnologyScience and Technology on Information Transmission and Dissemination in Communication Networks LaboratoryNational Engineering Laboratory for Mobile Network SecurityBeijing University of Posts and TelecommunicationsBeijing 100876China

With cloud computing technology becoming more mature, it is essential to combine the big data processing tool Hadoop with the Infrastructure as a Service（Iaa S） cloud platform. In this study, we first propose a new Dynamic Hadoop Cluster on Iaa S（DHCI） architecture, which includes four key modules： monitoring,scheduling, Virtual Machine（VM） management, and VM migration modules. The load of both physical hosts and VMs is collected by the monitoring module and can be used to design resource scheduling and data locality solutions. Second, we present a simple load feedback-based resource scheduling scheme. The resource allocation can be avoided on overburdened physical hosts or the strong scalability of virtual cluster can be achieved by fluctuating the number of VMs. To improve the flexibility, we adopt the separated deployment of the computation and storage VMs in the DHCI architecture, which negatively impacts the data locality. Third, we reuse the method of VM migration and propose a dynamic migration-based data locality scheme using parallel computing entropy. We migrate the computation nodes to different host（s） or rack（s） where the corresponding storage nodes are deployed to satisfy the requirement of data locality. We evaluate our solutions in a realistic scenario based on Open *** experimental results demonstrate the effectiveness of our solutions that contribute to balance the workload and performance improvement, even under heavy-loaded cloud system conditions.

关键词： Hadoop resource scheduling data locality Infrastructure as a Service(Iaas) OpenStack

Data-driven Computation of Natural Gas Pipeline network Hydraulics

在线全文

学校读者我要写书评

暂无评论

Data-driven Computation of Natural Gas Pipeline Network Hydr...

Demonstration of Einstein–Podolsky–Rosen Steering with Multiple Observers via Sequential Measurements

第31届中国过程控制会议（CPCC2020）

作者： CUI Gaochen JIA Qing-Shan GUAN Xiaohong LIU Qing Center for intelligent and networked Systems (CFINS) Department of Automation BNRist Tsinghua University ministry of education key lab for intelligent networks and network security Xi’an Jiaotong University Beijing Gas

Hydraulic calculation is a major path to the management of natural gas pipeline network. However, the investigated physical parameters of the pipes are usually obtained from blueprint or factory technical tests, which cause inaccurate hydraulic calculation result. Moreover, an initialization far from the root may cause nonconvergence or more computing cost of Newton’s Iteration for solving the hydraulic equations. In this paper, a data-driven hydraulic calculation method is proposed, where we make three major contributions.(i) A parameter estimation method is provided for adjustment to the parameters in each pipe.(ii) An initialization method using neural network is proposed to make an estimate for the root at a first glance to ensure the convergence.(iii) The numerical results show that the proposed data-driven parameter estimation corrects the parameter of the hydraulic equation and initialization method reduces time cost of the Newton’s Iteration.

关键词： Natural gas static simulation hydraulic calculation data-driven

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Chinese Physics Letters 2022年第11期39卷 1-5页

作者： Jian Li Yang Zhou Qin Wang Institute of Quantum Information and Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China key lab of Broadband Wireless Communication and Sensor network Technology(ministry of education) Nanjing University of Posts and TelecommunicationsNanjing 210003China National Engineering Research Center of Telecommunication and networks Nanjing University of Posts and TelecommunicationsNanjing 210003China

Quantum correlation is a fundamental property that distinguishes quantum systems from classical ones,and is also a fragile resource under projective ***,it has been shown that a subsystem in entangled pairs can share nonlocalities with multiple observers in *** we present a new steering scenario where both subsystems are accessible by multiple *** results show that the two qubits in a singlet state can be simultaneously steered separately by two sequential observers.

关键词： Einstein projective subsystem

SELECTION OF THE LINEAR COMBINING VECTOR G OF THE GENERALIZED SELF-SHRINKING GENERATORS

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2006年第4期23卷 506-509页

作者： Dong Lihua Zeng Yong Hu Yupu The key lab of Computer networks and lnformation security the Ministry of Education Xidian University Xi＇an 710071 China

Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking （GSS） sequence is the selection of the linear combining vector G. Based on the calculation of the minimal polynomial ofL GSS sequences and the comparison of their degrees, an algorithm for selecting the linear combining vector G is presented, which is simple to understand, to implement and to prove. By using this method, much more than 2^L-l linear combining vectors G of the desired properties will be resulted. Thus in the practical application the linear combining vector G can be chosen with great arbitrariness. Additionally, this algorithm can be extended to any finite field easily.

关键词： Cryptography Stream cipher m-sequence Generalized Self-Shrinking (GSS) sequences

Analysis and improvement of a provable secure fuzzy identity-based signature scheme

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2014年第9期57卷 156-160页

作者： XIONG Hu CHEN YaNan ZHU GuoBin QIN ZhiGuang School of Computer Science and Engineering University of Electronic Science and Technology of China Chongqing key lab of Computer network and Communication Technology key lab of network security and Cryptology Fujian Normal University School of Traffic and Transportation Beijing Jiaotong University

To enjoy the property of error tolerance in the biometric identities extraction,the fuzzy identitybased signature has been initialized to issue a signature on behalf of a descriptive attributes setωinstead of a single *** attributes setω′can be used to verify the validity of the signature in case the distance betweenωandω′is less than a pre-defined ***,Wang re-formalized the notion of fuzzy identitybased signature and proposed a concrete pairing-based construction along with the efficiency analysis and formal security ***,by giving concrete attack,we indicate that Wang’s scheme is not secure against forgery *** also present an improved scheme to prevent this attack.

关键词： identity-based cryptosystem fuzzy identity-based signature forgery attack cryptanalysis bilinear pairings

Koblitz Elliptic Curves Generating Based on Evolutionary Cryptography Theory and Verifying Parameters Recommended by NIST

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2011年第4期8卷 41-49页

作者：王潮张焕国刘礼黎 key lab of Specialty Fiber Optics and Optical Access network Ministry of Education Shanghai University key laboratory of Aerospace Information security and Trusted Computing Ministry of Education Computer School Wuhan University Huawei Technologies Co. Ltd

Elliptic curve cryptography is one of the most important public-key *** Koblitz Curve is a special kind of elliptic curve in ECC and its security mainly depends on the base *** on Evolutionary Cryptography theory,which becomes a principal concept for cryptography design and cryptanalysis,we propose a new algorithm for secure EC generation based on Ant Colony Optimization(ACO)to accelerate the search process of safe base *** preliminarily deal with secure Koblitz curve selecting over the field F(2800).Experiments show that the base field and base point of secure curves generated by ant colony algorithm have gone beyond the parameter range of Koblitz curves recommended by *** can present many new secure Koblitz curves,including base field and base point,which are not recommended by *** maximum size of our secure Koblitz curve has gone beyond *** algorithm in this paper follows the same cryptography criteria recommended by the ***,it can resist current *** analysis and experimental results prove that the new algorithm is effective and successful,and it is the first successful practice of Evolutionary Cryptography theory in public cryptography research.

关键词： evolutionary cryptography ECC secure curves ACO

A NEW APPROACH TO DVC COMBINED WITH ROI EXTRACTION AND RESIDUAL VIDEO CODING FOR MULTIMEDIA SENSOR networks

在线全文

学校读者我要写书评

暂无评论

Journal of Electronics(China) 2013年第1期30卷 17-24页

作者： Lin Zhaoxiao Sun Lijuan Xiao Fu Wang Ruchuan College of Computer Nanjing University of Posts and Telecommunications Jiangsu High Technology Research key laboratory for Wireless Sensor networks key lab of Broadband Wireless Communication and Sensor network Technology (Nanjing University of Posts and Telecommunications) Ministry of Education Jiangsu Province

The Wyner-Ziv distributed video coding scheme is characterized for its intraframe encoder and interframe decoder which can also approach the efficiency of an interframe encoder-decoder system. In Wyner-Ziv residual coding of video, the residual of a frame with respect to a reference frame is Wyner-Ziv encoded, which can reduces the input entropy and leads to a higher coding efficiency than directly encoding the original frame. In this paper, we propose a new approach of residual coding combined with Region Of Interest (ROI) extraction. Experimental results show that, the proposed scheme achieves better rate-distortion performance compared to conventional Wyner-Ziv coding scheme.

关键词： Distributed Video Coding (DVC) Residual video coding Region Of Interest (ROI)

Trusted Routing Based on Identity-Based Threshold Signature for Opportunistic networks

在线全文

学校读者我要写书评

暂无评论

China Communications 2011年第4期8卷 132-140页

作者：陈曦田有亮李兴华马建峰 key laboratory of Computer networks and Information security Ministry of EducationXidian University networking and Information Processing laboratory Rochester Institute of Technology

In opportunistic networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes *** solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized *** joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial *** nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing *** results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.

关键词： opportunistic networks social context-based routing identity-based signature threshold cryptography