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

IEEE Conference on Decision and Control

作者： Neveen Shlayan David Costa Pushkin Kachroo Eric Machorro Aaron Luttman Department of Electrical Engineering State University of New York-Maritime USA Department of Mathematics University of Nevada Las Vegas Department of Electrical and Computer Engineering University of Nevada Las Vegas National Security Technologies Las Vegas NV

ISBN: (纸本)9781467357159

Various aspects of the neutron spectroscopy problem are studied in this research. Theoretically, the neutron emission problem transforms into a limited angle Radon transform problem. In order to solve this ill posed problem, various algorithms are tested spanning two different techniques; algebraic reconstruction as well as Monte-Carlo methods. The developed algorithms are Stochastic Gradient Approximation (SGA) method, Simultaneous Perturbation Stochastic Approximation (SPSA) method, and Time of Flight (TOF) method.

关键词： Neutrons Image reconstruction Detectors Transforms Approximation methods Monte Carlo methods Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

A Secure Communication Approach for Mobile Intelligent Terminal

A Secure Communication Approach for Mobile Intelligent Termi...

引用

International Conference on computer Sciences and Applications (CSA)

作者： Fan Zhang Cong Zhang Mingdi Xu Minghui Yang School of Mathematics & Computer Science Wuhan Polytechnic University Wuhan China System Software Department Wuhan Digital Engineering Institute Wuhan China Third Research Institute of Ministry of Public Security Shanghai China

Currently, various mobile intelligent terminals have penetrated into our daily life. But at the same time, security and privacy issues of mobile intelligent terminals become a serious problem. In this paper, we present an approach to ensure the secure communication between mobile intelligent terminals. Our idea is to restrict that plaintext information can only exist inside mobile intelligent terminals, and any information outside of mobile intelligent terminals must be automatically encrypted. Experimental results show that our approach is efficient, and incur only 2%~3% performance losses.

关键词： Mobile communication Servers Encryption Protocols Mobile handsets

来源：评论

学校读者我要写书评

暂无评论

Abstracts from the 3rd International Genomic Medicine Conference (3rd IGMC 2015) : Jeddah, Kingdom of Saudi Arabia. 30 November - 3 December 2015

引用

BMC genomics 2016年第6期17 Suppl 6卷 487页

作者： Jerry W. Shay Noriko Homma Ruyun Zhou Muhammad Imran Naseer Adeel G. Chaudhary Mohammed Al-Qahtani Nobutaka Hirokawa Maryam Goudarzi Albert J. Fornace Saleh Baeesa Deema Hussain Mohammed Bangash Fahad Alghamdi Hans-Juergen Schulten Angel Carracedo Ishaq Khan Hanadi Qashqari Nawal Madkhali Mohamad Saka Kulvinder S. Saini Awatif Jamal Jaudah Al-Maghrabi Adel Abuzenadah Adeel Chaudhary Mohammed Al Qahtani Ghazi Damanhouri Heba Alkhatabi Anne Goodeve Laura Crookes Nikolas Niksic Nicholas Beauchamp Adel M. Abuzenadah Jim Vaught Bruce Budowle Mourad Assidi Abdelbaset Buhmeida Leena Merdad Sudhir Kumar Sayaka Miura Karen Gomez Mahmood Rasool Ahmed Rebai Sajjad Karim Hend F. Nour Eldin Heba Abusamra Elham M. Alhathli Nada Salem Mohammed H. Al-Qahtani Hossam Faheem Ashok Agarwa Eberhard Nieschlag Joachim Wistuba Oliver S. Damm Mohd A. Beg Taha A. Abdel-Meguid Hisham A. Mosli Osama S. Bajouh Serdar Coskun Muhammad Abu-Elmagd Ashraf Dallol Sahar Hakamy Wejdan Al-Qahtani Asia Al-Harbi Shireen Hussain Burak Ozkosem Rick DuBois Safia S. Messaoudi Maryam T. Dandana Touhami Mahjoub Wassim Y. Almawi S. Abdalla M. Nabil Al-Aama Asmaa Elzawahry Tsuyoshi Takahashi Sachiyo Mimaki Eisaku Furukawa Rie Nakatsuka Isao Kurosaka Takahiko Nishigaki Hiromi Nakamura Satoshi Serada Tetsuji Naka Seiichi Hirota Tatsuhiro Shibata Katsuya Tsuchihara Toshirou Nishida Mamoru Kato Sajid Mehmood Naeem Mahmood Ashraf Awais Asif Muhammad Bilal Malik Siddique Mehmood Aadil Hussain Qazi Mohammad Sajid Jamal Mughees Uddin Siddiqui Mohammad A. Alzohairy Mohammad A. Al Karaawi Taoufik Nedjadi Heba Al-Khattabi Adel Al-Ammari Ahmed Al-Sayyad Hédia Zitouni Nozha Raguema Marwa Ben Ali Wided Malah Raja Lfalah Wassim Almawi Mohammed Elanbari Andrey Ptitsyn Sana Mahjoub Rabeb El Ghali Bechir Achour Nidhal Ben Amor Brahim N’siri Hamid Morjani Esam Azhar Vera Chayeb Maryam Dendena Hedia Zitouni Khedija Zouari-Limayem Bassem Refaat Ahmed M. Ashshi Sarah A. Batwa Hazem Ramadan Amal Awad Ahmed Ateya Adel Galal Ahmed El-Shemi Ahmad Ashshi Mohammed Basalamah Youjin Na Cha University of Texas Southwestern Medical Center Dallas USA Department of Cell Biology and Anatomy Graduate School of Medicine the University of Tokyo Tokyo Japan Center of Excellence in Genomic Medicine Research King Abdulaziz University Jeddah Saudi Arabia Department of Biochemistry and Molecular & Cellular Biology Lombardi Comprehensive Cancer Center Georgetown University Washington USA Department of Oncology Lombardi Comprehensive Cancer Center Georgetown University Washington USA Department of Radiation Medicine Lombardi Comprehensive Cancer Center Georgetown University Washington USA Center of Excellence in Genomic Medicine Research (CEGMR) King Abdulaziz University Jeddah Kingdom of Saudi Arabia King Fahd Medical Research Centre King Abdulaziz University Jeddah Saudi Arabia Centre of Excellence in Genomic Medicine Research King Abdulaziz University Jeddah Saudi Arabia Sheffield Diagnostic Genetic Service Sheffield Children’s NHS Foundation Trust Western Bank Sheffield UK Center of Innovations in Personalized Medicine King Abdulaziz University Jeddah Saudi Arabia President ISBER Editor-in-Chief Biopreservation & Biobanking ᅟ USA Institute of Applied Genetics Department of Molecular and Medical Genetics University of North Texas Health Science Center Fort Worth USA Department of Dental Public Health Faculty of Dentistry King Abdulaziz University Jeddah Saudi Arabia Institute for Genomics and Evolutionary Medicine Temple University Philadelphia USA Center of Excellence in Genomic Medicine King Abdulaziz University Jeddah Kingdom of Saudi Arabia Laboratory of Molecular and Cellular Screening Processes (Bioinformatics Group) Centre of Biotechnology of Sfax Sfax Tunisia Fujitsu Technology Solutions International ᅟ ᅟ Case Western Reserve University School of Medicine and Lerner College of Medicine Cleveland Clinic Foundation Cleveland USA American Center for Reproductive Medicine Andrology Center Cleveland USA Center for Reproductive Medicine and

O1 Regulation of genes by telomere length over long distances Jerry W. Shay O2 The microtubule destabilizer KIF2A regulates the postnatal establishment of neuronal circuits in addition to prenatal cell survival, cell migration, and axon elongation, and its loss leading to malformation of cortical development and severe epilepsy Noriko Homma, Ruyun Zhou, Muhammad Imran Naseer, Adeel G. Chaudhary, Mohammed Al-Qahtani, Nobutaka Hirokawa O3 Integration of metagenomics and metabolomics in gut microbiome research Maryam Goudarzi, Albert J. Fornace Jr. O4 A unique integrated system to discern pathogenesis of central nervous system tumors Saleh Baeesa, Deema Hussain, Mohammed Bangash, Fahad Alghamdi, Hans-Juergen Schulten, Angel Carracedo, Ishaq Khan, Hanadi Qashqari, Nawal Madkhali, Mohamad Saka, Kulvinder S. Saini, Awatif Jamal, Jaudah Al-Maghrabi, Adel Abuzenadah, Adeel Chaudhary, Mohammed Al Qahtani, Ghazi Damanhouri O5 RPL27A is a target of miR-595 and deficiency contributes to ribosomal dysgenesis Heba Alkhatabi O6 Next generation DNA sequencing panels for haemostatic and platelet disorders and for Fanconi anaemia in routine diagnostic service Anne Goodeve, Laura Crookes, Nikolas Niksic, Nicholas Beauchamp O7 Targeted sequencing panels and their utilization in personalized medicine Adel M. Abuzenadah O8 International biobanking in the era of precision medicine Jim Vaught O9 Biobank and biodata for clinical and forensic applications Bruce Budowle, Mourad Assidi, Abdelbaset Buhmeida O10 Tissue microarray technique: a powerful adjunct tool for molecular profiling of solid tumors Jaudah Al-Maghrabi O11 The CEGMR biobanking unit: achievements, challenges and future plans Abdelbaset Buhmeida, Mourad Assidi, Leena Merdad O12 Phylomedicine of tumors Sudhir Kumar, Sayaka Miura, Karen Gomez O13 Clinical implementation of pharmacogenomics for colorectal cancer treatment Angel Carracedo, Mahmood Rasool O14 From association to causality: translation of GWAS findings for genomic me

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction of Proxy Signatures from Certificateless Signatures

A Generic Construction of Proxy Signatures from Certificatel...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Lei Zhang Qianhong Wu Bo Qin Josep Domingo-Ferrer Peng Zeng Jianwei Liu Ruiying Du Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Tarragona Spain Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University China Department of Maths School of Science Xi'an University of Technology China School of Electronic and Information Engineering Beijing University of Aeronautics and Astronautics China

The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificate less public key cryptography eliminates the complicated certificates in traditional public key cryptosystems without suffering from the key escrow problem in identity-based public key cryptography. In this paper, we reveal the relationship between the two important primitives of proxy signatures and certificate less signatures and present a generic conversion from the latter to the former. Following the generic transformation, we propose an efficient proxy signature scheme with a recent certificate less signature scheme.

关键词： Artificial intelligence Bismuth Games Public key cryptography Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Efficient escrow-free identity-based signature

Efficient escrow-free identity-based signature

引用

6th International Conference on Provable security, ProvSec 2012

作者： Zhang, Yunmei Liu, Joseph K. Huang, Xinyi Au, Man Ho Susilo, Willy School of Computer Science and Software Engineering University of Wollongong Australia Cryptography and Security Department Institute for Infocomm Research Singapore School of Mathematics and Computer Science Fujian Normal University Fuzhou Fujian China

ISBN: (纸本)9783642332715

The notion of identity-based signature scheme (IBS) has been proven useful in some scenarios where relying on the validity of the certificates is impractical. Nevertheless, one remaining inherent problem that hinders the adoption of this cryptographic primitive in practice is due to the key escrow problem, where the private key generator (PKG) can always impersonate the user in the system. In 2010, Yuen et al. proposed the notion of IBS that does not suffer from the key escrow problem. Nevertheless, their approach relies on the judge who will later blame the malicious PKG when such a dispute occurs, assuming that the PKG is willing to collaborate. Although the approach is attractive, but unfortunately it is impractical since the malicious PKG may just refuse to collaborate when such an incident happens. In this paper, we propose a new escrow-free IBS, which enjoys three main advantages, namely key escrow free, practical and very efficient. We present a generic intuition as well as an efficient instantiation. In our approach, there is no judge involvement required, as the public can determine the malicious behaviour of PKG when such an incident happens. Further, the signature size of our instantiation is only two group elements, which outperforms the existing constructions in the literature. © 2012 Springer-Verlag.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

A novel security architecture for a space-data DTN

A novel security architecture for a space-data DTN

引用

10th International Conference on Wired / Wireless Internet Communications, WWIC 2012

作者： Clarke, Nathan L. Katos, Vasilis Menesidou, Sofia-Anna Ghita, Bogdan Furnell, Steven School of Computing and Mathematics Plymouth University Plymouth United Kingdom School of Computing and Security Edith Cowan University WA Australia Department of Electrical and Computer Engineering Democritus University of Thrace Greece

ISBN: (纸本)9783642306297

In this paper we reflect upon the challenges and constraints of a DTN infrastructure handling space data and propose a suitable security architecture for offering security services. The security requirements are expressed in terms of architecture components and supporting security processes. The architecture is provided as a point of reference for validating and evaluating future security controls and processes suitable for space data DTN environments. © 2012 Springer-Verlag.

关键词： Architecture

来源：评论

学校读者我要写书评

暂无评论

Unconditionally secure multi-secret sharing scheme

Unconditionally secure multi-secret sharing scheme

引用

2012 IEEE International Conference on computer Science and Automation engineering, CSAE 2012

作者： Lin, Changlu Harn, Lein School of Mathematics and Computer Science Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou 350007 China Department of Computer Science Electrical Engineering University of Missouri Kansas City MO 64110-2499 United States

ISBN: (纸本)9781467300865

In Shamir's (t, n) secret sharing (SS) scheme, a master secrets is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this master secret;but fewer than t shares cannot obtain any information about the master secret s. Although Shamir's scheme is unconditionally secure, it unfortunately requires a large data expansion (i.e., t shares are needed to reclaim one secret). Therefore, Shamir's scheme is inefficient as a conveyor of information. Multi-secret sharing (MSS) scheme, which allows multiple master secrets to be shared among shareholders, has been proposed to improve the efficiency of Shamir's scheme. However, all existing MSS schemes are computationally secure. In this paper, we propose an unconditionally secure MSS scheme based on Shamir's scheme. Our proposed MSS scheme allows each shareholder to keep only one private share and uses it to share t master secrets. © 2012 IEEE.

关键词： Shareholders

来源：评论

学校读者我要写书评

暂无评论

Hardware Performance Evaluation of SHA-3 Candidate Algorithms

引用

Journal of Information security 2012年第2期3卷 69-76页

作者： Yaser Jararweh Lo’ai Tawalbeh Hala Tawalbeh Abidalrahman Moh’d Computer Science Department Jordan University of Science and Technology(CHiS) Irbid Jordan Director of Cryptographic Hardware and Information Security Lab (CHiS) Computer Engineering DepartmentJordan University of Science and Technology Irbid Jordan Engineering Mathematics & Internetworking Dalhousie University Halifax Canada

Secure Hashing Algorithms (SHA) showed a significant importance in today’s information security applications. The National Institute of Standards and Technology (NIST), held a competition of three rounds to replace SHA1 and SHA2 with the new SHA-3, to ensure long term robustness of hash functions. In this paper, we present a comprehensive hardware evaluation for the final round SHA-3 candidates. The main goal of providing the hardware evaluation is to: find the best algorithm among them that will satisfy the new hashing algorithm standards defined by the NIST. This is based on a comparison made between each of the finalists in terms of security level, throughput, clock frequancey, area, power consumption, and the cost. We expect that the achived results of the comparisons will contribute in choosing the next hashing algorithm (SHA-3) that will support the security requirements of applications in todays ubiquitous and pervasive information infrastructure.

关键词： Information security Secure Hash Algorithm (SHA) Hardware Performance FPGA

来源：评论

学校读者我要写书评

暂无评论

引用

作者： Kim, Jongsung Hong, Seokhie Preneel, Bart Biham, Eli Dunkelman, Orr Keller, Nathan Division of E-Business Kyungnam University Kyungnam 630-701 Korea Republic of Center for Information Security and Technologies Korea University Seoul 136-701 Korea Republic of Department of Electrical Engineering Katholieke Universiteit Leuven B-3001 Leuven-Heverlee Belgium Department of Computer Science Technion Haifa 32000 Israel Department of Computer Science University of Haifa 31905 Haifa Israel Department of Mathematics Bar Ilan University Ramat-Gan 52900 Israel

In 2004, we introduced the related-key boomerang/rectangle attacks, which allow us to enjoy the benefits of the boomerang attack and the related-key technique, simultaneously. The new attacks were used since then to attack numerous block ciphers. While the claimed applications are significant, most of them have a major drawback. Their validity cannot be verified experimentally due to their high complexity. Together with the lack of rigorous justification of the probabilistic assumptions underlying the technique, this lead Murphy to claim that attacks using the related-key boomerang/rectangle technique are not legitimate. This paper contains two contributions. The first is a rigorous analysis of the related-key boomerang/rectangle attacks, including devising provably optimal distinguishers and computing their success rate, and discussing the underlying independence assumptions. The second contribution is an extensive experimental verification of the related-key boomerang attack against the GSM block cipher, KASUMI. Our experiments reveal that the success probability of the distinguisher, when averaged over different choices of the keys, is close to the theoretical prediction. However, the exact probability depends on the key, such that for some portion of the keys, the distinguisher holds with a higher probability than expected, while for the rest of the keys, the distinguisher fails completely. © 2012 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Unconditionally secure multi-secret sharing scheme

Unconditionally secure multi-secret sharing scheme

引用

IEEE International Conference on computer Science and Automation engineering (CSAE)

作者： Changlu Lin Lein Harn School of Mathematics and Computer Science Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China Department of Computer Science Electrical Engineering University of Missouri Kansas City MO USA

In Shamir's (t, n) secret sharing (SS) scheme, a master secrets is divided into n shares by a dealer and is shared among n shareholders in such a way that any t or more than t shares can reconstruct this master secret; but fewer than t shares cannot obtain any information about the master secret s. Although Shamir's scheme is unconditionally secure, it unfortunately requires a large data expansion (i.e., t shares are needed to reclaim one secret). Therefore, Shamir's scheme is inefficient as a conveyor of information. Multi-secret sharing (MSS) scheme, which allows multiple master secrets to be shared among shareholders, has been proposed to improve the efficiency of Shamir's scheme. However, all existing MSS schemes are computationally secure. In this paper, we propose an unconditionally secure MSS scheme based on Shamir's scheme. Our proposed MSS scheme allows each shareholder to keep only one private share and uses it to share t master secrets.

关键词： Cryptography Polynomials Interpolation Protocols Additives computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：