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

9th International Conference on Information Systems Security, ICISS 2013

作者： Sobhdel, Yasser Jalili, Rasool Data and Network Security Laboratory Department of Computer Engineering Sharif University of Technology Tehran Iran

ISBN: (纸本)9783642452031

Authenticated key exchange protocols allow parties to establish a common session key which in turn is fundamental to building secure channels. Authenticated group key exchange protocols allow parties to interact with each other and establish a common group session key and avoid peer to peer key exchange;in other words they pave the way to build a broadcast channel. We construct an authenticated group key exchange protocol over UC framework which has the contributiveness property;i.e., the output is not biased by inputs of any party. Our protocol uses CRS model and discrete logarithm. Other protocols over UC framework either are defined over RO model [19] or benefit from a non-standard hardness assumption [16]. © 2013 Springer-Verlag.

关键词： Uranium compounds

来源：评论

学校读者我要写书评

暂无评论

An efficient and provably-secure coercion-resistant e-voting protocol

An efficient and provably-secure coercion-resistant e-voting...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of 2-layer nonlinear piece in hand method

Cryptanalysis of 2-layer nonlinear piece in hand method

引用

CD-ARES 2013 Workshops: 2nd International Workshop on Modern Cryptography and Security engineering, MoCrySEn 2013 and 3rd International Workshop on Security and Cognitive Informatics for Homeland Defense, SeCIHD 2013

作者： Nie, Xuyun Petzoldt, Albrecht Buchmann, Johannes School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Technische Universität Darmstadt Department of Computer Science Hochschulstraße 10 64289 Darmstadt Germany State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Network and Data Security Key Laboratory of Sichuan Province China

ISBN: (纸本)9783642405877

Piece in Hand method is a security enhancement method for Multivariate Public Key Cryptosystems (MPKCs). Since 2004, many types of this method have been proposed. In this paper, we consider the 2-layer nonlinear Piece in Hand method as proposed by Tsuji et al. in 2009. The key point of this method is to introduce an invertible quadratic polynomial map on the plaintext variables to construct perturbation of the original MPKC. Through our analysis, we find that the security of the enhanced scheme is mainly relying on the quadratic polynomials of this auxiliary map. The two examples proposed by Tsuji et al. for this map can not resist the Linearization Equation attack. Given a valid ciphertext, we can easily get a public key which is equivalent to the original MPKC. If there is an algorithm that can recover the plaintext corresponding to a valid ciphertext of the original MPKC, we can construct an algorithm that can recover the plaintext corresponding to a valid ciphertext of the enhanced MPKC. © IFIP International Federation for Information Processing 2013.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

Efficient and random oracle-free conditionally anonymous ring signature

Efficient and random oracle-free conditionally anonymous rin...

引用

6th International Conference on Provable Security, ProvSec 2012

作者： Zeng, Shengke Qin, Zhiguang Lu, Qing Li, Qinyi School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Network and Data Security Key Laboratory of Sichuan Province China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security China

ISBN: (纸本)9783642332715

Compared to conventional ring signature schemes, conditionally anonymous ring signatures allow to revoke the anonymity of actual signer without the group manager's help if necessary. When the actual signer intends to confirm his role, it can be proved by a confirmation algorithm. In addition, any user, who is in a ring but not signer, can claim this through a disavowal algorithm. There were several proposals which were proved secure in random oracles. In other words, the security of such schemes depends on the randomness of hash functions. Recently, Zeng et al. proposed a generic construction of conditionally anonymous ring signature scheme without random oracles. Their scheme relies on NIZKs and pseudorandom functions, which render it to be inefficient. This paper proposes a practical ring signature scheme with traceability without random oracles in the common reference string model. © 2012 Springer-Verlag.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Sequence data and association statistics from 12,940 type 2 diabetes cases and controls

引用

Scientific data 2017年第1期4卷 170179页

作者： Jason Flannick Christian Fuchsberger Anubha Mahajan Tanya M Teslovich Vineeta Agarwala Kyle J Gaulton Lizz Caulkins Ryan Koesterer Clement Ma Loukas Moutsianas Davis J McCarthy Manuel A Rivas John R B Perry Xueling Sim Thomas W Blackwell Neil R Robertson N William Rayner Pablo Cingolani Adam E Locke Juan Fernandez Tajes Heather M Highland Josee Dupuis Peter S Chines Cecilia M Lindgren Christopher Hartl Anne U Jackson Han Chen Jeroen R Huyghe Martijn van de Bunt Richard D Pearson Ashish Kumar Martina Müller-Nurasyid Niels Grarup Heather M Stringham Eric R Gamazon Jaehoon Lee Yuhui Chen Robert A Scott Jennifer E Below Peng Chen Jinyan Huang Min Jin Go Michael L Stitzel Dorota Pasko Stephen C J Parker Tibor V Varga Todd Green Nicola L Beer Aaron G Day-Williams Teresa Ferreira Tasha Fingerlin Momoko Horikoshi Cheng Hu Iksoo Huh Mohammad Kamran Ikram Bong-Jo Kim Yongkang Kim Young Jin Kim Min-Seok Kwon Juyoung Lee Selyeong Lee Keng-Han Lin Taylor J Maxwell Yoshihiko Nagai Xu Wang Ryan P Welch Joon Yoon Weihua Zhang Nir Barzilai Benjamin F Voight Bok-Ghee Han Christopher P Jenkinson Teemu Kuulasmaa Johanna Kuusisto Alisa Manning Maggie C Y Ng Nicholette D Palmer Beverley Balkau Alena Stančáková Hanna E Abboud Heiner Boeing Vilmantas Giedraitis Dorairaj Prabhakaran Omri Gottesman James Scott Jason Carey Phoenix Kwan George Grant Joshua D Smith Benjamin M Neale Shaun Purcell Adam S Butterworth Joanna M M Howson Heung Man Lee Yingchang Lu Soo-Heon Kwak Wei Zhao John Danesh Vincent K L Lam Kyong Soo Park Danish Saleheen Wing Yee So Claudia H T Tam Uzma Afzal David Aguilar Rector Arya Tin Aung Edmund Chan Carmen Navarro Ching-Yu Cheng Domenico Palli Adolfo Correa Joanne E Curran Dennis Rybin Vidya S Farook Sharon P Fowler Barry I Freedman Michael Griswold Daniel Esten Hale Pamela J Hicks Chiea-Chuen Khor Satish Kumar Benjamin Lehne Dorothée Thuillier Wei Yen Lim Jianjun Liu Marie Loh Solomon K Musani Sobha Puppala William R Scott Loïc Yengo Sian-Tsung Tan Herman A Taylor Farook Thameem Gregory Wilson Tien Yin Wong Pål Rasmu Department of Molecular Biology Massachusetts General Hospital Boston Massachusetts USA. Program in Medical and Population Genetics Broad Institute Cambridge Massachusetts USA. Department of Biostatistics and Center for Statistical Genetics University of Michigan Ann Arbor Michigan USA. Wellcome Trust Centre for Human Genetics Nuffield Department of Medicine University of Oxford Oxford UK. Harvard-MIT Division of Health Sciences and Technology Massachusetts Institute of Technology Cambridge Massachusetts USA. Department of Statistics University of Oxford Oxford UK. Genetics of Complex Traits University of Exeter Medical School University of Exeter Exeter UK. MRC Epidemiology Unit Institute of Metabolic Science University of Cambridge Cambridge UK. Department of Twin Research and Genetic Epidemiology King's College London London UK. Oxford Centre for Diabetes Endocrinology and Metabolism Radcliffe Department of Medicine University of Oxford Oxford UK. Department of Human Genetics Wellcome Trust Sanger Institute Hinxton Cambridgeshire UK. School of Computer Science McGill University Montreal Quebec Canada. McGill University and Génome Québec Innovation Centre Montreal Quebec Canada. Human Genetics Center The University of Texas Graduate School of Biomedical Sciences at Houston The University of Texas Health Science Center at Houston Houston Texas USA. Department of Biostatistics Boston University School of Public Health Boston Massachusetts USA. National Heart Lung and Blood Institute's Framingham Heart Study Framingham Massachusetts USA. Medical Genomics and Metabolic Genetics Branch National Human Genome Research Institute National Institutes of Health Bethesda Maryland USA. Department of Biostatistics Harvard School of Public Health Boston Massachusetts USA. Chronic Disease Epidemiology Swiss Tropical and Public Health Institute University of Basel Basel Switzerland. Institute of Genetic Epidemiology Helmholtz Zentrum München German R

To investigate the genetic basis of type 2 diabetes (T2D) to high resolution, the GoT2D and T2D-GENES consortia catalogued variation from whole-genome sequencing of 2,657 European individuals and exome sequencing of 12,940 individuals of multiple ancestries. Over 27M SNPs, indels, and structural variants were identified, including 99% of low-frequency (minor allele frequency [MAF] 0.1-5%) non-coding variants in the whole-genome sequenced individuals and 99.7% of low-frequency coding variants in the whole-exome sequenced individuals. Each variant was tested for association with T2D in the sequenced individuals, and, to increase power, most were tested in larger numbers of individuals (>80% of low-frequency coding variants in ~82 K Europeans via the exome chip, and ~90% of low-frequency non-coding variants in ~44 K Europeans via genotype imputation). The variants, genotypes, and association statistics from these analyses provide the largest reference to date of human genetic information relevant to T2D, for use in activities such as T2D-focused genotype imputation, functional characterization of variants or genes, and other novel analyses to detect associations between sequence variation and T2D.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Authenticated Group Key Management Protocol for Mobile Peer-to-Peer network

引用

China Communications 2012年第10期9卷 68-77页

作者： Zhang Guoyin Fu Xiaojing Ma Chunguang College of Computer Science and Technology Harbin Engineering University Harbin 150001 P. R. China Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Chengdu 611731 P. R. China

The authentication and privacy of a group member is important in multicast communication. This paper proposes a privacy-preserving authenticated group-key management protocol for the Mobile Peer-to-Peer network （ MP2PN ）. The MP2PN contains some super peers and each super peer controls a subgroup composed of regular peers. An efficient attribute-based signature based on Cipertext-Policy Attribute-Based Encryption （CP-ABE） is proposed and used in this group-key rmnagement protocol to authenticate a peer＇s at- tributes and identity. A peer can be described by a set of attributes or one unique special identity at- tribute. Peers that have some attributes in common can form a group and conmmnicate with each other anonymously and securely. Any super peer can initiate a group and act as a group controller. The group controller can authenticate a peer＇s attributes and identity as well as remove malicious peers. Any peer with attributes that rmtches the access structure can join the group and provide its input to form the group key. The proposed protocol pro- vides backward and forward secrecy. The sinmlation results show that this protocol is applicable for mobile devices and can meet the MP2PN requirements of group communication.

关键词： MP2PN group key tmnagement attribute-based signature anonymous conmmnica tion

来源：评论

学校读者我要写书评

暂无评论

Distributed redundancy strategy in P2P environment

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2012年第3期6卷 148-157页

作者： Yang, Lei Qin, Zhi-Guang Wang, Can Yang, Hao School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Network and Data Security Key Laboratory of Sichuan Province Chengdu 611731 China

P2P storage architecture plays an important role in distributed storage systems. For P2P dynamic environment, the sufficient redundant data must be maintained to ensure the data availability. System will pay various costs to maintain redundant data. In this paper, the costs of the bandwidth that are respectively caused by the methods of replication and erasure coding are qualitatively analyzed based on Markov chain model. Combined the advantage of replication and erasure coding, a new hybrid redundancy strategy is proposed. Just as replication, the downloaded files automatically are viewed as shared files for next downloading. Like erasure coding, when the availability of one file needs to be repaired, anyone of peers which store the fully copy of this file is assigned to generate and distribute new fragments. The analysis result shows that the hybrid redundancy strategy can maintain the appropriate level of redundancy and save more bandwidth than the traditional redundancy strategy in a variety of network environment.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

QoS-aware joint policies in cognitive radio networks

QoS-aware joint policies in cognitive radio networks

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Saber Salehkaleybar Seyyed Arash Majd Mohammad Reza Pakravan Data Network Research Laboratory Advanced Communications Research Institute Faculty of Electrical Engineering Sharif University of Technology Tehran Iran

One of the most challenging problems in Opportunistic Spectrum Access (OSA) is to design channel sensing-based protocol in multi secondary users (SUs) network. Quality of Service (QoS) requirements for SUs have significant implications on this protocol design. In this paper, we propose a new method to find joint policies for SUs which not only tries to guarantee QoS requirements but also maximize network throughput. We use Decentralized Partially Observable Markov Decision Process (Dec-POMDP) to formulate interactions between SUs. Meanwhile, a tractable approach for Dec-POMDP is utilized to extract sub-optimum joint policies for large horizons. Among these policies, the QoS-aware joint policy is selected as the joint sensing strategy for SUs. To show the efficiency of the proposed method, we consider two SUs trying to access two-channel primary users (PUs) network modeled by discrete Markov chains. Simulations demonstrate two interesting findings: 1- Optimum joint policies for large horizons can be obtained using the proposed method. 2- Our method outperforms other related works in terms of network throughput.

关键词： Joints Markov processes Sensors Throughput Quality of service Heuristic algorithms Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

3-2 data mining over network streams

引用

Journal of the National Institute of Information and Communications technology 2011年第3-4期58卷 89-98页

作者： Ban, Tao Kadobayashi, Youki Cybersecurity Laboratory Network Security Research Institute Cybersecurity Data Mining Japan Network Security Research Institute Japan Graduate School of Information Science Nara Institute of Science and Technology Cybersecurity Internet Engineering Japan

network monitoring and analyzing systems (NMASes) have been playing an active roll for preventing cyber attacks and providing practical and proactive defense against emerging threads over the Internet. This paper provides an overview of the TraceBack network ANalyzer (TBNAN), which uses a suite of data mining algorithms to address different aspects of cyber security and facilitate network management. The various components of TBNAN such as the statisitical classification engines, anomaly detectors, and data clustering modules, could help to illustrate the status of the monitored network as well as detect different types of attacks and intrusions against the network. Our analysis shows that the functionalities implemented by TBNAN are complementary to those of traditional signature based systems, implying that both of them can be combined to enlarge the toolbox of a network administrator for efficient cyber threat and network incident countermeasure.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Improved deduplication method based on variable-size sliding window

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content technology and its Applications 2011年第9期5卷 80-87页

作者： Wang, Can Qin, Zhiguang Yang, Lei Nie, Peng School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Network and Data Security Key Laboratory of Sichuan Province Chengdu 611731 China

To improve the deduplication performance while keep a reasonable metadata cost and time cost at the same time, a state deduplication method based on variable-size sliding window and a universal model of performance-analyzing for the deduplication methods are proposed. According to this method, the data object is divided into non-overlapped mini chunks based on its content firstly, and then a variable-size sliding window, which uses the mini chunks as its basic unit of movement, is used to identify the duplicate data blocks. Further more, different chunking strategies are used on the data changing regions and the non-changing regions respectively. The theoretical analyzing indicates that this method can achieve satisfying deduplication performance even with a relatively larger expected chunk size, because it can reduce the metadata cost effectively and identify smaller duplicate data blocks. The experimental results on real data show that the average compression ratio of the method can be increased 13.02% than SWC, which has the optimal deduplication performance among the current deduplication methods. Moreover, the average time cost of this method is reduced 97.45% than SWC. This method is suitable for the applications of mass data backup in network environment, which have more rigorous requirements on the deduplication performance and the time cost.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：