检索结果-内蒙古大学图书馆

2nd International Workshop on Education Technology and computer science, ETCS 2010

作者： Dou, Wanfeng He, Wei School of Computer Science and Technology Jiangsu Research Center of Information Security and Confidential Engineering Nanjing Normal University Nanjing China Department of Mechanical Engineering Nanjing Institute of Industry Technology Nanjing 210046 Jiangsu China

ISBN: (纸本)9780769539874

Distributed pair programming (DPP) supports two programmers to work on the same task from different locations. One programmer acting as the driver controls the keyboard and mouse to actively write code or design document. The other partner as the navigator helps plan as well as identifies and prevents any syntactic or strategic deficiencies in code or design document. This paper first reviews the existing DPP tools and how to increase the compatibility of pair programmers. Then some pilot experiment results are proposed of pair programming with 53 students in Software engineering course. Finally, the paper analyzes the compatibility problems of pair programming such as gender, time management, and active learning outside the classroom, which are resolved by the DPP, and some basic requirements of the DPP system are given. © 2010 IEEE.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Multi-party k-means clustering with privacy consideration

Multi-party k-means clustering with privacy consideration

引用

IEEE International Symposium on Parallel and Distributed Processing With Applications

作者： Yu, Teng-Kai Lee, D.T. Chang, Shih-Ming Zhan, Justin Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan National Center for the Protection of the Financial Infrastructure Dakota State University Madison SD United States Institute of Information Science Academia Sinica Nankang Taipei Taiwan Taiwan Information Security Center Research Center for Information Technology Innovation Academia Sinica Nankang Taipei Taiwan

ISBN: (纸本)9780769541907

The k-means clustering algorithm is a widely used scheme to solve the clustering problem which classifies a given set of n data points in m-dimensional space into k clusters, whose centers are obtained by the centroids of the points in the same cluster. The problem with privacy consideration has been studied, when the data is distributed among different parties and the privacy of the distributed data is to be preserved. In this paper, we apply the concept of parallel computing to solve the privacy-preserving multi-party k-means clustering problem, when the data is vertically partitioned and horizontally partitioned respectively among different parties. We present algorithms for solving the problems for these two data partition models that run in O(nk) time and in O(m(k + log(n/k))) time respectively. The time complexities of the algorithms are much better than others without parallel computing. © 2010 IEEE.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of a certificateless multi-receiver signcryption scheme

Cryptanalysis of a certificateless multi-receiver signcrypti...

引用

International Conference on Multimedia information Networking and security

作者： Miao, Songqin Zhang, Futai Zhang, Lei School of Computer Science and Technology Nanjing Normal University Nanjing China Jiangsu Engineering Research Center on Information Security and Privacy Protection Technology Nanjing China Department of Computer Engineering and Mathematics Universitat Rovira I Virgili Av. Països Catalans 26 E-43007 Tarragona Catalonia Spain

ISBN: (纸本)9780769542584

Certificateless public key cryptography eliminates certificate management in traditional public key infrastructure and solves the key escrow problem in identity-based cryptography. Certificateless signcryption is one of the most important primitives in certificateless public key cryptography which achieves confidentiality and authentication simultaneously. Multi-receiver signcryption signcrypts a message to a large number of receivers. Selvi et al. proposed the first efficient and provably secure certificateless multi-receiver signcryption scheme. Recently, they found the scheme is insecure against the type I adversary and gave an enhanced one. However, we find that their enhanced scheme is still insecure against the type I adversary. In this paper, we present an attack on Selvi et al.'s enhanced scheme. Specifically, we show that a type I adversary can first replace a sender's public key and generate a signcrypted message on behalf of the sender. © 2010 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Ontology-Based Context Representation and Reasoning Using OWL and SWRL

Ontology-Based Context Representation and Reasoning Using OW...

引用

Annual Conference on Communication Networks and Services Research (CNSR)

作者： C.-H. Liu K.-L. Chang Jason J.-Y. Chen S.-C. Hung Department of Computer Science Information Engineering National Central University Jhongli Taiwan Identification and Security Technology Center Hsinchu Taiwan

ISBN: (纸本)9781424462483;9780769540412

Recently, quite a few researches upon context-awareness, ubiquitous computing and automatic surveillance have emerged. Their objectives are to appropriately react to current context situation over the web, rather than in a single machine. This requires exchanging the context of extremely dynamic web environment, as well as reasoning about the context to achieve goal. Thus, context representation and context reasoning play significant roles. This paper presents an ontology-based approach to: 1) employing web ontology language (OWL) to describe context knowledge, and 2) using semantic web rule language (SWRL) to represent rule-based inference rules for context reasoning. OWL describes context knowledge in details by defining relationships among knowledge. As an XML-based language, OWL enjoys good interoperability for knowledge sharing and reuse over the web. Further, SWRL represents rule-based first-order logic (FOL) inference rules, which are expressed in terms of predefined OWL taxonomic context knowledge. By doing so, SWRL rules perfectly integrate with OWL, making it easy to develop and maintain application systems. Besides, as SWRL is also XML-based, it is not so dependent upon inference engine. That is, inference engine can be changed without rewriting the rules for engine-specific syntax. This enhances system maintainability.

关键词： Ontologies OWL Engines Knowledge representation Logic Context-aware services Context Ubiquitous computing Surveillance Semantic Web

来源：评论

学校读者我要写书评

暂无评论

On the security of a certificateless signature scheme

On the security of a certificateless signature scheme

引用

2010 2nd International Conference on Signal Processing Systems, ICSPS 2010

作者： Miao, Songqin Zhang, Futai Zhang, Lei School of Computer Science and Technology Nanjing Normal University Nanjing China Jiangsu Engineering Research Center on Information Security and Privacy Protection Technology Nanjing China UNESCO in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Av. Països Catalans 26 E-43007 Tarragona Catalonia Spain

ISBN: (纸本)9781424468911

Certificateless public key cryptography (CLPKC) eliminates certificate management in traditional public key infrastructure and solves the problem of the key escrow in identity-based cryptography. Certificateless signature is one of the most important primitives in CLPKC. Many certificateless signature (CLS) schemes have been proposed these years. For a CLS scheme to be secure, it should be resistant to the attacks of both Type I Adversary and Type II Adversary. In this paper, we give cryptanalysis to a recently proposed certificateless signature scheme. We show it is insecure against a Type II adversary who models a malicious-but-passive key generation center (KGC). An attack is described which reveals that a Type II adversary can successfully forge a certificateless signature of any signer upon obtaining two valid signatures of that signer. © 2010 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Asymmetric encryption and signature method with DNA technology

引用

science China(information sciences) 2010年第3期53卷 506-514页

作者： LAI XueJia1, LU MingXin2, QIN Lei3, HAN JunSong4 & FANG XiWen11department of computer science & engineering, Shanghai Jiao Tong University, Shanghai 200030, China 2School of National information security, Nanjing University, Nanjing 210093, China 3BIOCOMPLEX, 4915 Bathurst St. Unit# 209-366, ON M2R 1X9, Canada 4National engineering center for BioChip at Shanghai, Shanghai 201203, China 1. Department of Computer Science & Engineering Shanghai Jiao Tong University Shanghai 200030 China2. School of National Information Security Nanjing University Nanjing 210093 China3. BIOCOMPLEX 4915 Bathurst St. Unit# 209-366 Toronto ON M2R 1X9 Canada4. National Engineering Center for BioChip at Shanghai Shanghai 201203 China

This paper proposes DNA-PKC, an asymmetric encryption and signature cryptosystem by combining the technologies of genetic engineering and cryptology. It is an exploratory research of biological cryptology. Similar to conventional public-key cryptology, DNA-PKC uses two pairs of keys for encryption and signature, respectively. Using the public encryption key, everyone can send encrypted message to a specified user, only the owner of the private decryption key can decrypt the ciphertext and recover the message; in the signature scheme, the owner of the private signing key can generate a signature that can be verified by other users with the public verification key, but no else can forge the signature. DNA-PKC differs from the conventional cryptology in that the keys and the ciphertexts are all biological molecules. The security of DNA-PKC relies on diffcult biological problems instead of computational problems; thus DNA-PKC is immune from known attacks, especially the quantum computing based attacks.

关键词： cryptology asymmetric encryption digital signature biological cryptology DNA

来源：评论

学校读者我要写书评

暂无评论

A Secure Proxy Blind Signature Scheme Based on DLP

A Secure Proxy Blind Signature Scheme Based on DLP

引用

International Conference on Multimedia information Networking and security (MINES)

作者： Binayak Kar Pritam Prava Sahoo Ashok Kumar Das Department of Computer Science and Engineering International Institute of Information Technology Bhubaneswar India Center for Security Theory and Algorithmic Research International Institute of Information Technology Hyderabad India

In this paper, we aim to improve the recently proposed Yang et al.'s proxy blind signature scheme in order to withstand the security flaw in their scheme. The security of the improved scheme is enhanced in the signing phase and based on difficulty of solving the discrete logarithm problem (DLP). The analysis shows that the proposed scheme resolves security problem in Yang et al.'s scheme and also meets the aspects of security features needed by a proxy blind signature.

关键词： Equations Receivers Public key Computational efficiency Book reviews

来源：评论

学校读者我要写书评

暂无评论

On Achieving Maximum Secure Throughput Using Network Coding Against Wiretap Attack

On Achieving Maximum Secure Throughput Using Network Coding ...

引用

IEEE International Conference on Distributed Computing Systems

作者： Xiangmao Chang Jin Wang Jianping Wang Victor Lee Kejie Lu Yixian Yang Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Department of Computer Science University of Science and Technology of China Department of Computer Science City University of Hong Kong Department of Electrical and Computer Engineering University of Puerto Rico at Mayaguez

ISBN: (纸本)9781424472611;9780769540597

In recent years network coding has attracted significant attention in telecommunication. The benefits of network coding to a communication network include the increased throughput as well as secure data transmission. The purpose of this work is to design secure linear network coding against wiretap attack. The problem is to maximize the transmission data rate of multiple unicast streams between a pair of source and destination nodes, under the condition of satisfying the weakly secure requirements. Different from most existing research on network coding that designs the network coding scheme based on a given network topology, we will consider the integrated network topology design and network coding design. Such an integrated approach has not been reported by other researchers. In this paper, we formally introduce the problem, prove the problem is computational intractable, and then develop efficient heuristic algorithms. We first try to find the transmission topology that is suitable for network coding. Based on the topology, we design linear network coding scheme that is weakly secure. We conduct simulations to show that the proposed algorithms can achieve good performance.

关键词： Network coding Network topology Data transfer rates Secure networks(communications) topology labeling scheme Heuristic algorithms Linear networks Hierarchical Network coding(HNC) data transmission

来源：评论

学校读者我要写书评

暂无评论

A Preliminary Design of Distributed Pair Programming System

A Preliminary Design of Distributed Pair Programming System

引用

International Workshop on Education Technology and computer science, ETCS

作者： Wanfeng Dou Wei He School of Computer Science and Technology Jiangsu research center of Information Security & Confidential Engineering Nanjing Normal University Nanjing China Department of Mechanical Engineering Nanjing Institute of Industry Technology Nanjing Jiangsu China

ISBN: (纸本)9781424463886;9780769539874

Distributed Pair Programming (DPP) system is a programming system in which two programmers, the driver and the navigator, work on the same task such as analysis, design and programming of the same program from different locations. This paper first reviews the existing DPP systems and presents some basic requirements of such systems. Then, a design framework of the DPP system is presented including collaborative editing subsystem, conversation negotiation subsystem, and peer evaluation subsystem. The functions of each subsystem are deeply analyzed. Finally, the system class structure and implementation of the system are further discussed.

关键词： Programming profession Collaboration computer science Collaborative work Educational technology Navigation computer industry Problem-solving Switches computer science education

来源：评论

学校读者我要写书评

暂无评论

A conversation model of collaborative pair programming based on language/action theory

A conversation model of collaborative pair programming based...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Wanfeng Dou Kui Hong Wei He School of Computer Science and Technology Jiangsu research center of Information Security & Confidential Engineering Nanjing Normal University Nanjing China Department of Mechanical Engineering Nanjing Institute of Industry Technology Nanjing Jiangsu China

Pair programming is a programming practice in which two programmers use one computer to work together on the same analysis, design, and programming of the same software. Collaborative Pair Programming (CPP) supports two programmers to work on the same task from different locations. This paper first reviews the existing CPP tools. Then a conversation model during CPP process is presented based on language/action perspective. Some basic requirements of CPP tool are given in terms of the conversation model. Finally, a framework of CPP tool is presented. The framework allows not only to use the same editor between the pairs, but also to support different editors or developing environments between them.

关键词： Programming profession Collaborative work Collaborative software computer science Navigation Problem-solving Switches Education International collaboration information security

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：