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

Perfect concurrent signature protocol

SNPD 2007: 8th ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing

作者： Zhenjie, Huang Rufen, Huang Xuanzhi, Lin Department of Computer Science and Engineering Zhangzhou Normal University Fujian 363000 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)0769529097

The concept of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004 which allows two entities to produce two signatures in such a way that, the signer of each signature is ambiguous from any third party's point of view until the release of a secret, known as the keystone. Once the keystone is released, both signatures become binding to their respective signers concurrently. Later, a stronger notion called perfect concurrent signatures with two concrete schemes was proposed by Susilo, Mu and Zhang. In perfect concurrent signatures, although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party. Unfortunately, Susilo et al.'s schemes are unfair. In this paper, we first show that in their schemes the initial signer can cheat the matching signer by carefully choosing some communication value and then propose fair perfect concurrent signature protocol to fix our attacks. © 2007 IEEE.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Slicing of component behavior specification with respect to their composition

Slicing of component behavior specification with respect to ...

引用

10th International ACM SIGSOFT Symposium on Component-Based software engineering, CBSE 2007

作者： Šerý, Ondřej Plašil, František Charles University in Prague Faculty of Mathematics And Physics Department of Software Engineering Malostranske namesti 25 118 00 Prague 1 Czech Republic Academy of Sciences of the Czech Republic Institute of Computer Science

ISBN: (纸本)9783540735502

Being an important means of reducing development costs, behavior specification of software components facilitates reuse of a component and even reuse of a component's architecture (assembly). However, since typically only a part of the components' functionality is actually used in the new context, a significant part of the behavior specification may be superfluous. As a result, it may be hard to see (and filter out) the actual interplay among the components in their behavior specification. This paper targets the problem in the scope of behavior protocols. It presents a technique for slicing behavior protocols with respect to a given context (composition), designed to remove the unused behavior from a behavior specification. The technique is based on a formal foundation, generic enough to support slicing with respect to a property expressed as a predicate. To demonstrate viability of the proposed approach, a positive experience with behavior specification slicing applied in real-life case study is shared with the reader (along with a short description of a prototype). © Springer-Verlag Berlin Heidelberg 2007.

关键词： software architecture

来源：评论

学校读者我要写书评

暂无评论

Validating a network simulation testbed for army UAVs

Validating a network simulation testbed for army UAVs

引用

Simulation Winter Conference

作者： Stephen Hamilton Timothy Schmoyer J. A. Hamilton Electrical Engineering & Computer Science United States Military Academy West Point NY USA Computer Science & Software Engineering Auburn University AL 36849 USA

Auburn University, through the Army's aviation and missile research, development and engineering center (AMRDEC) has been supporting the unmanned systems initiative (USI) program in three research areas related to unmanned aerial vehicle (UAV). A major element in this work is the development of a high fidelity modeling and simulation testbed to support the USI program. This paper describes the testbed and the verification and validation of the testbed.

关键词： Testing Unmanned aerial vehicles Base stations Power system modeling Computational modeling Cryptography Predictive models Cables computer science Receiving antennas

来源：评论

学校读者我要写书评

暂无评论

Pseudo trust: Zero-knowledge based authentication in anonymous peer-to-peer protocols

Pseudo trust: Zero-knowledge based authentication in anonymo...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Lu, Li Han, Jinsong Hu, Lei Huai, Jinpeng Liu, Yunhao Ni, Lionel M. State Key Lab. of Information Security Graduate School Chinese Academy of Sciences Beijing China Dept. of Computer Science and Engineering Hong Kong University of Science and Technology Kowloon Hong Kong School of Computer Science Beihang University Beijing China State Key Lab. of Software Developing Environment Beihang University Beijing China

ISBN: (纸本)1424409101

Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence, there exists an inherent tradeoff between trust and anonymity. To the best of our knowledge, there is currently no P2P protocol that provides complete mutual anonymity as well as authentication and trust management. We propose a zero-knowledge authentication scheme called Pseudo Trust (PT), where each peer, instead of using its real identity, generates an unforgeable and verifiable pseudonym using a one-way hash function. A novel authentication scheme based on Zero-Knowledge Proof is designed so peers can be authenticated without leaking any sensitive information. With the help of PT, most existing identity-based trust management schemes become applicable in mutual anonymous P2P systems. We analyze the levels of security and anonymity in PT, and evaluate its performance using trace-driven simulations and a prototype implementation. The strengths of Pseudo Trust include the lack of need for a centralized trusted party or CA, high scalability and security, low traffic and cryptography processing overheads, and man-in-middle attack resistance. We aim for the Pseudo Trust design to be included in the P2P trust and anonymity context. © 2007 IEEE.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

Evaluation of SAT-based Bounded Model Checking of ACTL Prope...

引用

Theoretical Aspects of software engineering (TASE)

作者： Yanyan Xu Wei Chen Liang Xu Wenhui Zhang School of Information Science and Engineering Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy and Sciences China

Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD based symbolic model checking of LTL and ACTL properties in recent years. For general LTL and ACTL properties, BMC has traditionally aimed mainly at error detection, taking the advantage that error detection may only need to explore a small portion of the whole state space. Recently bounded model checking aiming at verification has also been proposed. The aim of this paper is to exploit the strength of BMC methods by combining different BMC approaches and compare it with the traditional BDD-based symbolic methods. We consider two bounded model checking methods, which are for error detection and verification of ACTL properties, respectively, and then combine them to a BMC algorithm. Based on this algorithm, we have implemented a tool named BMV (bounded model verifier), and carried out a number of experiments, and we have then compared BMV with Cadence SMV. The experimental results show that for certain types of problems, both for verification and error detection, BMV can perform much better than Cadence SMV in both time and memory consumption, and we believe that this is the first attempt to have an implementation of a method that combines practical error detection and verification of ACTL properties by SAT-based model checking.

关键词： Data structures Boolean functions Laboratories computer science Information science State-space methods Formal verification Automatic logic units Minimization methods Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

B-spline Surfaces of Clustered Point Sets with Normal Maps

B-spline Surfaces of Clustered Point Sets with Normal Maps

引用

10th IEEE International Conference on computer Aided Design and computer Graphics(第十届CAO/Graphics国际会议)

作者： Yanci Zhang Hanqiu Sun Enhua Wu State Key Lab.of Computer Science Institute of SoftwareChinese Academy of Sciences Department of Computer Science and EngineeringThe Chinese University of Hong Kong Faculty of Science and TechnologyUniversity of Macau

In this paper,we propose a novel method that represents the highly-complex point sets by clustering the points to normal-mapped B-spline surfaces (NBSs). The main idea is to construct elaborate normal maps on simple surfaces for the realistic rendering of complex point-set models. Based on this observation,we developed the coarse,normal-mapped B-spline surfaces to approximate the original point datasets with fine surface details. In our algorithm,a genetic clustering algorithm is proposed to automatically segment the point samples into several clusters according to their statistical properties,and a network of B-spline patches with normal maps are constructed according to the clustering results. Our experimental results show that this representation facilitates the modeling and rendering of complex point sets without losing the visual qualities.

关键词： Spline Surface reconstruction Signal processing algorithms Surface fitting Clustering algorithms computer science Sampling methods Frequency Sun Genetics

来源：评论

学校读者我要写书评

暂无评论

The tilt cursor: Enhancing stimulus-response compatibility by providing 3D orientation cue of pen

Conference on Human Factors in Computing Systems - Proceedin...

引用

Conference on Human Factors in Computing Systems - Proceedings 2007年 303-306页

作者： Tian, Feng Ao, Xiang Wang, Hongan Setlur, Vidya Dai, Guozhong Intelligence Engineering Lab. Institute of Software Chinese Academy of Sciences P.O.Box 8718 Beijing China State Key Lab. of Computer Science P.O.Box 8718 Beijing China Nokia Research Palo Alto 975 Page Mill Road Palo Alto CA United States

ISBN: (纸本)1595935932;9781595935939

In order to improve stimulus-response compatibility of touchpad in pen-based user interface, we present the tilt cursor, i.e. a cursor dynamically reshapes itself to providing the 3D orientation cue of pen. We also present two experiments that evaluate the tilt cursor?s performance in circular menu selection and specific marking menu selection tasks. Results show that in a specific marking menu selection task, the tilt cursor significantly outperforms the shape-fixed arrow cursor and the live cursor [4]. In addition, results show that by using the tilt cursor, the response latencies for adjusting drawing directions are smaller than that by using the other two kinds of cursors. © Copyright 2007 ACM.

关键词： Human computer interaction Sensory perception Three dimensional computer graphics Ubiquitous computing Menu selection task Stimulus response compatibility

来源：评论

学校读者我要写书评

暂无评论

Moving Schemes for Mobile Sinks in Wireless Sensor Networks

Moving Schemes for Mobile Sinks in Wireless Sensor Networks

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Yanzhong Bi Jianwei Niu Limin Sun Wei Huangfu Yi Sun Institute of Software Chinese Academy and Sciences Beijing China School of Computer Science and Engineering Beihang University Beijing China College of Information Sciences and Engineering Graduate University of Academy of Sciences Beijing China

In a wireless sensor network for data-gathering applications, if all network data congregate to a stationary sink node hop by hop, the sensor nodes near the sink have to consume more energy on forwarding data for other nodes, which probably causes the early function loss of the sensor network. Employing a mobile sink can alleviate the hotspot problem and balance the energy consumption among the sensor nodes. In this paper, we propose two autonomous moving schemes for the mobile sink. In our schemes, the sink makes moving decisions without complete knowledge of network topology and the energy distribution of all sensor nodes. We evaluated the performance of our moving schemes by simulation and the results show that both the two schemes can extend the network lifetime prominently.

关键词： Wireless sensor networks Energy consumption Sun Research and development Relays Energy efficiency Bismuth computer science Educational institutions Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Perfect Concurrent Signature Protocol

Perfect Concurrent Signature Protocol

引用

ACIS International Conference on software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Zhenjie Huang Rufen Huang Xuanzhi Lin Department of Computer Science and Engineering Zhangzhou Normal University Fujian China State Key Laboratory of Information Security Institute of Software Chinese Academy and Sciences Beijing China

关键词： Protocols Concrete software engineering Artificial intelligence Distributed computing computer science Laboratories Information security Certification

来源：评论

学校读者我要写书评

暂无评论

An Combination Approach to Tackling Semantic Conflicts Based on RDF Model

An Combination Approach to Tackling Semantic Conflicts Based...

引用

2007年第三届语义和知识网格国际会议(Third International Conference on Semantics,Knowledge,and Grid)(SKG 2007)

作者： Yinglong Ma Beihong Jin School of Computer Science and Technology North China Electric Power University Beijing 102206 P.R. Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences P.O.Box

Within Semantic Web environments, ontologies have been adopted as their conceptual backbone. An important task for Web information integration and sharing is to resolve semantic conflicts because of semantic heterogeneity and information incompleteness. But it is rather difficult for ontology engineers to integrate Web information including semantic heterogeneity and conflicts. In this paper, a combined approach is proposed for detecting and handling semantic conflicts from ontology information. Using rule reasoning based on RDF model theory, we can automatically check where semantic conflicts probably exist, and further locate so called conflict points of ontology information. Then based on Bayesian network method, semantic conflicts can be controlled and avoided by computing semantic overlap and its posterior probabilities of concept nodes from conflict points. Users can issue semantic based query by interaction interface and achieve information sharing with conflicts and uncertainty.

关键词： Semantic Web Ontology Semantic conflicts Semantic based query

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：