Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.最新文献_第2页

Adaptive random testing with CG constraint 具有CG约束的自适应随机测试

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342685

F. Chan, K. P. Chan, T. Chen, S. Yiu

引用次数: 16

Computing curriculum - software engineering: its impacts on professional software engineering education 计算机课程-软件工程:对软件工程专业教育的影响

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342824

T. H. Tse

引用次数: 4

An efficient distributed intrusion detection scheme 一种高效的分布式入侵检测方案

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342666

Thomas Holz

引用次数: 10

A secure and fully private borda voting protocol with universal verifiability 具有普遍可验证性的安全且完全私有的边界投票协议

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342832

Changjie Wang, Ho-fung Leung

{"title":"A secure and fully private borda voting protocol with universal verifiability","authors":"Changjie Wang, Ho-fung Leung","doi":"10.1109/CMPSAC.2004.1342832","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342832","url":null,"abstract":"Extensive studies have been made on electronic voting in the last twenty years, and many schemes have been proposed, in which both security and effectiveness have been improved. However, most available secure vote schemes mainly focused on the simple \"one man, one vote\" plurality protocol. In this paper, we address the security issues of the Borda voting protocol, another important social decision protocol, in which a voter can rank the candidates by assigning them different points. In this paper, we propose a secure Borda voting scheme that guarantees full privacy protection of the voters as well as universal verifiability and weak robustness. Instead of assuming existence of trusted or semi-trusted authorities as in other secure voting schemes, we employ homomorphic ElGamal encryption in our scheme and distribute the private key among all voters to achieve full privacy protection of voters. In such a way, all voters jointly compute the outcome of the election without revealing any further information of voters' individual preferences. An analysis of the protocol against the security requirements shows that the new protocol achieves full privacy protection, public verifiability, weak robustness, in addition to others addressed by other protocols reported in the literature","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130994060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

A view-based control flow metric 基于视图的控制流度量

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342661

S. Gossens, M. D. Cin

引用次数: 1

Estimation of software defects fix effort using neural networks 用神经网络估计软件缺陷修复的工作量

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342658

Hui Zeng, D. Rine

引用次数: 48

A new e-shopping system using high performance custom computers 使用高性能定制计算机的新型电子购物系统

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342673

Yuk Ying Chung, Yong Sun, Penghao Wang, Xiaoming Chen

引用次数: 1

Real-time strategy and practice in service grid 服务网格的实时策略与实践

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342821

Hai Jin, Hanhua Chen, Jing Chen, Ping Kuang, Li Qi, Deqing Zou

引用次数: 16

Services-oriented dynamic reconfiguration framework for dependable distributed computing 面向服务的可靠分布式计算动态重构框架

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342894

W. Tsai, Weiwei Song, R. Paul, Z. Cao, H. Huang

引用次数: 58

Software reliability growth models incorporating fault dependency with various debugging time lags 包含故障依赖和各种调试滞后时间的软件可靠性增长模型

Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004. Pub Date : 2004-09-28 DOI: 10.1109/CMPSAC.2004.1342826

Chin-Yu Huang, Chu-Ti Lin, S. Kuo, Michael R. Lyu, C. Sue

{"title":"Software reliability growth models incorporating fault dependency with various debugging time lags","authors":"Chin-Yu Huang, Chu-Ti Lin, S. Kuo, Michael R. Lyu, C. Sue","doi":"10.1109/CMPSAC.2004.1342826","DOIUrl":"https://doi.org/10.1109/CMPSAC.2004.1342826","url":null,"abstract":"Software reliability is defined as the probability of failure-free software operation for a specified period of time in a specified environment. Over the past 30 years, many software reliability growth models (SRGMs) have been proposed and most SRGMs assume that detected faults are immediately corrected. Actually, this assumption may not be realistic in practice. In this paper we first give a review of fault detection and correction processes in software reliability modeling. Furthermore, we show how several existing SRGMs based on NHPP models can be derived by applying the time-dependent delay function. On the other hand, it is generally observed that mutually independent software faults are on different program paths. Sometimes mutually dependent faults can be removed if and only if the leading faults were removed. Therefore, here we incorporate the ideas of fault dependency and time-dependent delay function into software reliability growth modeling. Some new SRGMs are proposed and several numerical examples are included to illustrate the results. Experimental results show that the proposed framework to incorporate both fault dependency and time-dependent delay function for SRGMs has a fairly accurate prediction capability","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130875848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 22