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

Annual Conference on Privacy, security and Trust, PST

作者： Alireza Toroghi Haghighat Mohammad Sadeq Dousti Rasool Jalili Data and Network Security Laboratory Department of Computer Engineering Sharif University of Technology Tehran Iran

ISBN: (纸本)9781467358378

We present an efficient and provably-secure e-voting protocol, which is a variant of the JCJ e-voting protocol (Juels et al., 2010). It decreases the total number of JCJ's operations from O(n 2 ) to O(n), where n is the number of votes or voters (whichever is the maximum). Note that since the operations under consideration are time-consuming (e.g., public-key encryption), the improvement is quite substantial. As a rough comparison, consider a nation-wide election with around ten million voters/votes. Assuming each operation takes one microsecond, and no parallelization is used, one can see a huge difference: our protocol tallies the votes in 10 seconds, while the JCJ protocol requires over 3 years to tally the votes. In order to achieve this level of efficiency, we change the ballot format and the tallying phase of the JCJ protocol. Moreover, we provide a complexity analysis and a detailed proof for coercion-resistance of our protocol.

关键词： Protocols Cryptography Electronic voting Nominations and elections Positron emission tomography Resistance

来源：评论

学校读者我要写书评

暂无评论

Accountable authority identity-based encryption with public traceability 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Lai, Junzuo Deng, Robert H. Zhao, Yunlei Weng, Jian School of Information Systems Singapore Management University Singapore Singapore Software School Fudan University China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

At Crypto'07, Goyal introduced the notion of accountable authority identity-based encryption (A-IBE) in order to mitigate the inherent key escrow problem in identity-based encryption, and proposed two concrete constructions. In an A-IBE system, if the private key generator (PKG) distributes a decryption key or produces an unauthorized decryption box for a user maliciously, it runs the risk of being caught and sued in the court of law with the help of a tracing algorithm. Subsequent efforts focused on constructions of A-IBE schemes with enhanced security. In these A-IBE constructions, the tracing algorithm needs to take a user's decryption key as input. If the user lost his key or is deliberately uncooperative in court, then we cannot implicate the PKG or the user. An interesting open problem left by Goyal et al. at CCS'08 is to consider the possibility of tracing a decryption box using only a public tracing key, or with the assistance of a tracing authority. In this paper, we address this problem positively. We first extend the original model of A-IBE to accommodate public traceability, and then propose an A-IBE scheme in the new model. To the best of our knowledge, the proposed scheme is the first A-IBE with public traceability. © 2013 Springer-Verlag.

关键词： Accountable Authority Identity Based Encryption Public Traceability

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Energy-aware and self-adaptive anomaly detection scheme based on network tomography in mobile ad hoc networks

Energy-aware and self-adaptive anomaly detection scheme base...

引用

作者： Wang, Wei Wang, Huiran Wang, Beizhan Wang, Yaping Wang, Jiajun School of Computer Science Xi'An Polytechnic University Xi'an 710048 China Key Laboratory for Intelligent Network and Network Security Xi'An Jiaotong University Ministry of Education Xi'an 710049 China School of Software Xiamen University Xiamen 361005 China Department of Industrial and Systems Engineering Texas AandM University TX 77843 United States

Anomaly detection is indispensable for satisfying security services in mobile ad hoc network (MANET) applications. Often, however, a highly secure mechanism consumes a large amount of network resources, resulting in network performance degradation. To shift intrusion detection from existing security-centric design approaches to network performance centric design schemes, this paper presents a framework for designing an energy-aware and self-adaptive anomaly detection scheme for resource constrained MANETs. The scheme uses network tomography, a new technique for studying internal link performance based solely on end-to-end measurements. With the support of a module comprising a novel spatial-time model to identify the MANET topology, an energy-aware algorithm to sponsor system service, a method based on the expectation maximum to infer delay distribution, and a Self-organizing Map (SOM) neural network solution to profile link activity, the proposed system is capable of detecting link anomalies and localizing malicious nodes. Consequently, the proposed scheme offers a trade-off between overall network security and network performance, without causing any heavy network overload. Moreover, it provides an additional approach to monitor the spatial-time behavior of MANETs, including network topology, link performance and network security. The effectiveness of the proposed schemes is verified through extensive experiments. © 2012 Elsevier Inc. All rights reserved.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Probabilistic Marking Approach with Multi-Tag for Tracing ICMP-Based DoS Attacks

引用

Wuhan University Journal of Natural Sciences 2013年第6期18卷 484-488页

作者： CHEN Xiuzhen MA Jin LI Shenghong CHEN Ken SERHROUCHNI Ahmed State Key Laboratory for Manufacturing Systems Engineering Xi'an Jiaotong University School of Information Security Engineering Shanghai Jiao Tong University Les Laboratoires de l'Institut Galilée Université Paris 13Paris 93430 France Network and Computer Science Department Telecom ParisTech Paris 75634 France

This paper presents a dynamic probabilistic marking algorithm with multiple routing address tags, which allows the vic- tim to traceback the origin of ICMP （Internet Control Message Pro- tocol）-based direct and reflective DoS attacks. The proposed ap- proach makes full use of scalable data space of ICMP packet to achieve multiple information tags. The difference between this pro- posal and previous proposals lies in two points. First, the number of packets needed by the victim to reconstruct the attack path is greatly reduced because of three key mechanisms： multi-tag, uniform left- over probability, and tag location choice based on the module of accommodated tag numbers within a packet. Second, the true origin of both direct and reflective ICMP-based DoS attacks can be traced.

关键词： network security denial of service IP traceback dynamic probabilistic marking multi-tag

来源：评论

学校读者我要写书评

暂无评论

Direct construction of signcryption tag-KEM from standard assumptions in the standard model

Direct construction of signcryption tag-KEM from standard as...

引用

15th International Conference on Information and Communications security, ICICS 2013

作者： Li, Xiangxue Qian, Haifeng Yu, Yu Weng, Jian Zhou, Yuan Department of Computer Science and Technology East China Normal University China National Engineering Laboratory for Wireless Security Xi'an University of Posts and Telecommunications China Institute for Interdisciplinary Information Sciences Tsinghua University China Department of Computer Science Jinan University China Network Emergency Response Technical Team/Coordination Center China

ISBN: (纸本)9783319027258

The paper presents a direct construction of signcryption tag- KEM under the standard DBDH and CDH assumptions in the standard model, without using strongly unforgeable signature schemes as building blocks. We prove its confidentiality and unforgeability with respect to adversarially-chosen keys where the adversary is given more advantageous attack environment than existing models in the literature. The performance of our construction is comparable to existing signcryption tag-KEM schemes. © Springer International Publishing 2013.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A regression test case generation method guided with branch probability

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) 2013年第SUPPL.2期44卷 317-322页

作者： Yu, Lechen Wang, Haijun Zheng, Qinghua Liu, Ting Huang, Xiaolong Yang, Zijiang Wei, Wei MOE Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an 710049 China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049 China School of Computer Science and Engineering Xi'an University of Technology Xi'an 710049 China

A novel method was proposed to generate regression test cases guided by the branch possibility (GBP). The symbolic execution was applied to search the paths of the program and generate control dependence graph of the program. The branch possibility was proposed to measure the possibility of that the new test case can cover the target code, which is generated by reserving the branch. The branch possibility of each branch in the test case was calculated to find the highest one which will be reserved to generate a new case, until the target code was run in the test case. 20 versions of two programs were selected to compare our method with two existing algorithms such as eXpress and dynamic symbolic execution. The results show that the GBP can generate the test case effectively, and the search time is 45.6% and 61.1% lower than that of eXpress and dynamic symbolic execution (DSE).

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Software survivability evaluation method based on software calling structure

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) 2013年第SUPPL.1期44卷 443-448页

作者： Hou, Yuqiao Qu, Yu Liu, Linfeng Zheng, Qinghua Liu, Ting Zheng, Chao Yang, Zijiang Key Laboratory for Intelligent Networks and Network Security Ministry of Education Xi'an Jiaotong University Xi'an 710049 China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049 China School of Computer Science and Engineering Xi'an University of Technology Xi'an 710048 China

A new method was proposed to evaluate the survivability of the software system based on the calling structure of the software. Firstly, the interactions among the components of the software were obtained using the static lexical analysis technology and dynamic monitoring of the AOP (Aspect ORIENTED PROGRAmming). The calling network was constructed to model the calling structure of the software. Secondly, a component failure simulation method was proposed by removing the nodes and edges corresponding to the selected components from the calling network. The residual calling network was considered as the software calling structure when the components are disabled. Then, the survivability coefficient was presented to measure the survivability of the software system, the proportion of the biggest connected subgraph of the residual network compared to the original call network diagram. In the experiments, nine open source software projects were selected to compare their survivability, and 20 versions of Struts (J2EE framework) were chosen to investigate the changes of the software survivability during their updating. Our evaluation concurs with the intuition that minor upgrades, aimed at fixing bugs and adding minor functionality quickly, reduce software survivability, whereas major upgrades, which normally clean up messy code and re-construct the software, improve software quality.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Optimized relay-route assignment for anonymity in wireless networks

Optimized relay-route assignment for anonymity in wireless n...

引用

IEEE International Symposium on Information Theory

作者： Chouchang Yang Basel Alomair Radha Poovendran Network Security Laboratory Department of Electrical Engineering University of Washington Seattle WA USA Computer Research Institute King Abdulaziz City for Science and Technology Riyadh Saudi Arabia

Anonymous wireless networks use covert relays to prevent unauthorized entities from determining communicating parties through traffic timing analysis. In a multipath anonymous network, the choice of which relay nodes should be covert, as well as the route selection by the network nodes, affect both the anonymity and network performance. Although assigning relays as covert and selecting routes composed of covert relays can provide higher anonymity, the selection of these two parameters will increase the packet dropping rate of the network. In this paper, we introduce an analytical framework for joint relay assignment and route selection in multi-path anonymous wireless networks. The main contributions of this work are two-fold. First, we show that joint relay assignment and route selection can be formulated as a convex optimization problem which guarantees global optimum solution. Second, as special cases of our formulation, we derive solutions for the problem of route selection to maximize anonymity when the relay configuration is given, as well as the problem of relay configuration for a given route selection.

关键词： Decision support systems Information theory Silicon Zinc

来源：评论

学校读者我要写书评

暂无评论

Improvement on Ahn et al.'s RSA P-homomorphic signature scheme

Improvement on Ahn et al.'s RSA P-homomorphic signature sche...

引用

8th International ICST Conference on security and Privacy in Communication networks, SecureComm 2012

作者： Wang, Zhiwei College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100190 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642368820

P-homomorphic signature is a general framework for computing on authenticated data, which is recently proposed by Ahn et al. With P-homomorphic signature, any third party can derive a signature on the object message m′ from a signature of m, if m′ and m satisfy P(m,m′) = 1 for some predicate P which denotes the authenticatable relationship between m′ and m. Ahn et al. proposed a RSA P-homomorphic signature scheme by using a RSA accumulator, which is very efficient in space. However, the computational cost of verification and derivation is very heavy. We present an improved P-homomorphic signature scheme based on factoring problem. In our construction, the time efficiency of both verification and derivation are much better than Ahn's scheme. © 2013 ICST Institute for computer Science, Social Informatics and Telecommunications engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：