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

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： He, Shiming Zeng, Weini Xie, Kun Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China The 716th Research Institute China Shipbuilding Industry Corporation Lianyungang222061 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook New York United States

ISBN: (纸本)9783319271361

In smart grid, privacy implications to individuals and their family is an important issue, due to the fine-grained usage data collection. Wireless communications are considered by many utility companies to obtain information. network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, network Coding introduces new challenge for privacy preserving due to the encoding of packet in forwarder nodes. We propose a distributed privacy preserving scheme for network coding in smart grid, which considers the converged flows character of smart grid and exploits a homomorphic encryption function to decrease the complex in forwarder node. The message content of packet is encrypted and the tag of packet is encrypted by homomorphic encryption function. Then the forwarder node linear random codes the encrypted message contents and directly processes the tags cryptotext based on the homomorphism feature. It offers message content confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme. © Springer International Publishing Switzerland 2015.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Novel way to research nonlinear feedback shift register

引用

Science China(Information Sciences) 2014年第9期57卷 161-174页

作者： ZHAO DaWei PENG HaiPeng LI LiXiang HUI SiLi YANG YiXian Information Security Center State Key Laboratory of Networking and Switching TechnologyBeijing University of Posts and Telecommunications Zhejiang Provincial Key Lab of Data Storage and Transmission Technology Hangzhou Dianzi University National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Shandong Provincial Key Laboratory of Computer Network Shandong Computer Science Center

In this paper,we regard the nonlinear feedback shift register(NLFSR)as a special Boolean network,and use semi-tensor product of matrices and matrix expression of logic to convert the dynamic equations of NLFSR into an equivalent algebraic *** on them,we propose some novel and generalized techniques to study ***,a general method is presented to solve an open problem of how to obtain the properties(the number of fixed points and the cycles with different lengths)of the state sequences produced by a given NLFSR,i.e.,the analysis of a given *** then show how to construct all 22n-(l-n)/22n-lshortest n-stage feedback shift registers(nFSR)and at least 22n-(l-n)-1/22n-l-1shortest n-stage nonlinear feedback shift registers(nNLFSR)which can output a given nonperiodic/periodic sequence with length ***,we propose two novel cycles joining algorithms for the construction of full-length ***,two algorithms are presented to construct 22n-2-1different full-length nNLFSRs,respectively.

关键词： nonlinear feedback shift register semi-tensor product Boolean network full-length nNLFSR binary sequence

来源：评论

学校读者我要写书评

暂无评论

ReCBuLC: Reproducing Concurrency Bugs Using Local Clocks 15

ReCBuLC: Reproducing Concurrency Bugs Using Local Clocks

引用

International Conference on Software engineering (ICSE)

作者： Xiang Yuan Chenggang Wu Zhenjiang Wang Jianjun Li Pen-Chung Yew Jeff Huang Xiaobing Feng Yanyan Lan Yunji Chen Yong Guan University of Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Architecture Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering University of Minnesota at Twin-Cities Minneapolis USA Department of Computer Science and Engineering Texas A&M University Texas USA CAS Key Laboratory of Network Data Science and Technology Chinese Academy of Sciences Beijing China College of Information Engineering Capital Normal University Beijing China

ISBN: (纸本)9781479919345

Multi-threaded programs play an increasingly important role in current multi-core environments. Exposing concurrency bugs and debugging such multi-threaded programs have become quite challenging due to their inherent non-determinism. In order to eliminate such non-determinism, many approaches such as record-and-replay and other similar bug reproducing systems have been proposed. However, those approaches often suffer significant performance degradation because they require a large amount of recorded information and/or long analysis and replay time. In this paper, we propose an effective approach, ReCBuLC, to take advantage of the hardware clocks available on modern processors. The key idea is to reduce the recording overhead and analyzing events' global order by using time stamps recorded in each thread. Those timestamps are used to determine the global orders of shared accesses. To avoid the large overhead incurred in accessing system-wide global clock, we opt to use local per-core clocks that incur much less access overhead. We then propose techniques to resolve differences among local clocks and obtain an accurate global event order. By using per-core clocks, state-of-the-art bug reproducing systems such as PRES and CLAP can reduce the recording overheads by 1% ~ 85%, and the analysis time by 84.66% ~ 99.99%, respectively.

关键词： Clocks Program processors Computer bugs Hardware Coherence Concurrent computing Debugging

来源：评论

学校读者我要写书评

暂无评论

A UC-secure authenticated contributory group key exchange protocol based on discrete logarithm

A UC-secure authenticated contributory group key exchange pr...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：