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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,026 篇 会议
990 篇 期刊文献
7 册 图书

馆藏范围

2,023 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,295 篇 工学
- 836 篇 计算机科学与技术...
- 646 篇 软件工程
- 330 篇 信息与通信工程
- 156 篇 电气工程
- 136 篇 电子科学与技术（可...
- 127 篇 控制科学与工程
- 95 篇 生物工程
- 82 篇 机械工程
- 82 篇 核科学与技术
- 72 篇 光学工程
- 63 篇 生物医学工程（可授...
- 61 篇 网络空间安全
- 57 篇 动力工程及工程热...
- 56 篇 仪器科学与技术
- 51 篇 化学工程与技术
- 46 篇 交通运输工程
- 40 篇 安全科学与工程
705 篇 理学
- 301 篇 物理学
- 288 篇 数学
- 115 篇 生物学
- 87 篇 统计学（可授理学、...
- 51 篇 化学
- 44 篇 系统科学
338 篇 管理学
- 207 篇 管理科学与工程(可...
- 142 篇 图书情报与档案管...
- 74 篇 工商管理
76 篇 医学
- 57 篇 临床医学
- 44 篇 基础医学(可授医学...
52 篇 法学
- 29 篇 社会学
28 篇 经济学
- 28 篇 应用经济学
16 篇 军事学
13 篇 农学
12 篇 教育学
4 篇 文学
3 篇 艺术学

主题

106 篇 hadron colliders
69 篇 computer network...
56 篇 semantics
48 篇 feature extracti...
43 篇 accuracy
38 篇 computational mo...
35 篇 federated learni...
34 篇 robustness
32 篇 protocols
32 篇 training
28 篇 computer science
28 篇 w & z bosons
27 篇 deep learning
27 篇 bandwidth
27 篇 security
25 篇 internet
24 篇 wireless communi...
24 篇 higgs bosons
24 篇 wireless sensor ...
22 篇 data mining

机构

148 篇 centro brasileir...
148 篇 istanbul technic...
147 篇 national and kap...
147 篇 yerevan physics ...
146 篇 university of sp...
145 篇 universidad iber...
144 篇 brunel universit...
144 篇 academy of scien...
143 篇 indian institute...
143 篇 charles universi...
141 篇 department of ph...
140 篇 university of de...
138 篇 imperial college...
138 篇 rwth aachen univ...
137 篇 università di to...
137 篇 indian institute...
134 篇 infn sezione di ...
132 篇 institute for nu...
130 篇 zhejiang univers...
130 篇 centro de invest...

作者

112 篇 g. tonelli
112 篇 d. barney
112 篇 l. valencia palo...
112 篇 t. liu
112 篇 c. hensel
112 篇 a. garcia-bellid...
112 篇 a. steen
112 篇 n. cartiglia
112 篇 n. colino
112 篇 f. moortgat
112 篇 b. clerbaux
112 篇 g. sultanov
112 篇 m. a. ciocci
112 篇 k. lamichhane
112 篇 s. maselli
112 篇 e. migliore
111 篇 a. babaev
111 篇 v. karjavine
111 篇 p. avery
111 篇 l. silvestris

语言

1,821 篇 英文
164 篇 其他
40 篇 中文

检索条件"机构=Computer Network Engineering Technology Center"

共 2023 条记录，以下是1791-1800 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

How to construct forward secure single-server, multi-server and threshold-server assisted signature schemes using Bellare-Miner scheme

How to construct forward secure single-server, multi-server ...

引用

作者： Yu, Jia Kong, Fanyu Hao, Rong Zhang, Dexiang Li, Guowen College of Information Engineering Qingdao University Qingdao China Institute of Network Security Shandong University Jinan China Network Center Qingdao University Qingdao China School of Computer Science and Technology Shandong Jianzhu University Jinan China

Server-assisted signature plays an important role in all kinds of applications in electronic commerce. It can be applied to the settings where a user employs public network servers to help her execute digital signature operations. In this paper, we discuss a problem of how to construct forward secure single-server, multi-server and threshold-server assisted signature schemes using Bellare-Miner Scheme and propose three signature schemes. In the single-server assisted signature scheme, the user (signer) can employ a server to help her produce a signature. In the multi-server assisted scheme, the number of employed servers is increased to n, therefore, it is infeasible for an attacker to forge a valid signature if she can't corrupt all servers and the signer. In the threshold-server assisted signature scheme, the generation of a valid signature needs the cooperation of the user and a quorum of servers. The scheme is more robust because the system can still get the correct signature as soon as no more than threshold servers are corrupted. These three schemes maintain the forward secure property, that is, even if the current secret key is exposed, an adaptive chosen-message adversary can't forge any signature pertaining to previous time period. Finally, we prove the proposed schemes are correct and forward secure. © 2008 Academy Publisher.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Publicly verifiable secret sharing member-join protocol for threshold signatures

Publicly verifiable secret sharing member-join protocol for ...

引用

作者： Yu, Jia Kong, Fanyu Hao, Rong Li, Xuliang Li, Guowen College of Information Engineering Qingdao University Qingdao China Institute of Network Security Shandong University Jinan China Network Center Qingdao University Qingdao China School of Computer Science and Technology Shandong Jianzhu University Jinan China

Publicly verifiable secret sharing (PVSS) allows not only shareholders themselves but also everyone verify the shares of a secret distributed by a dealer. It has a lot of electronic applications. In this paper, we propose a publicly verifiable member-join protocol for threshold signatures. In our proposal, a new member can join a PVSS scheme to share the secret only with the help of old shareholders. What's more, everyone besides the new member can verify the validity of the new member's share, while only the new member knows his share. Different from previous protocols, our protocol can tolerate a mobile adversary. This proposal adapts to many electronic applications. Finally, we analyze the security of our scheme. © 2008 Academy Publisher.

关键词： Shareholders

来源：评论

学校读者我要写书评

暂无评论

A Logic for Multi-domain Authorization Considering Administrators

A Logic for Multi-domain Authorization Considering Administr...

引用

International Workshop on Policies for Distributed Systems and networks

作者： Zeinab Iranmanesh Morteza Amini Rasool Jalili Network Security Center Department of Computer Engineering Sharif University of Technology Tehran Iran

ISBN: (纸本)9780769531335

In multi-domain environments, authorization policies for each administrative domain are determined by either one administrator or through cooperation of multiple administrators. Proposed logic-based models for multi-domain environments' authorization neither consider an administrator as the legislator of a policy in policies' representation nor specify the domain of a policy explicitly. Considering legislators in policy specification provides the possibility of presenting composite administration and utilizing administrators' characteristics in policy analysis such as conflict resolution. In this paper, we propose the syntax, proof theory, and semantics of a logic in which administrators are considered in authorization policies' specification, composite administration is presented, and each authorization policy is explicitly associated with some administrative domains. We also claim that the logic is sound. The presented logic is based on modal logic and utilizes two calculi named the calculus of administrators and the calculus of administrative domains. A case study of the logic usage is presented.

关键词： Logic Authorization Calculus Access control Conferences computer security computer networks Distributed computing Interference Robust control

来源：评论

学校读者我要写书评

暂无评论

A history based semantic aware access control model using logical time

A history based semantic aware access control model using lo...

引用

International Conference on computer and Information technology (ICCIT)

作者： Ali Noorollahi Ravari Morteza Amini Rasool Jalili Jafar Haadi Jafarian Network Security Center Computer Engineering Department Sharif University of Technology Tehran Iran

With the advent of semantic technology, access control cannot be done in a safe way unless the access decision takes into account the semantic relationships among the entities in a semantic-aware environment. The SBAC model (semantic based access control model) considers this issue in its decision making process. However, time plays a crucial role in new computing environments, which is not supported in SBAC. In this paper, we propose the temporal semantic based access control (TSBAC) model, as an extension of SBAC, which enhances the specification of user-defined authorization rules by constraining time interval and temporal expression over users' history of accesses. TSBAC uses logical time, rather than to real time, in its authorization rules. A formal semantics for temporal authorizations is provided and conflicting situations (due to the semantic relations of the SBAC model and a sub-interval relation between authorizations) are investigated and resolved in our proposed model. An architecture for the access control system based on TSBAC is presented.

关键词： History Access control Authorization Permission Distributed computing Protection Control systems IP networks computer security computer networks

来源：评论

学校读者我要写书评

暂无评论

A Semantic aware Access Control model with real time constraints on history of accesses

A Semantic aware Access Control model with real time constra...

引用

International Multiconference on computer Science and Information technology, IMCSIT

作者： Ali Noorollahi Ravari Morteza Amini Rasool Jalili Network Security Center Computer Engineering Department Sharif University of Technology Tehran Iran

With the advent of semantic technology, access control cannot be done in a safe way unless the access decision takes into account the semantic relationships among the entities in a semantic-aware environment. SBAC model considers this issue in its decision making process. However, time plays a crucial role in new computing environments which is not supported in the model. In this paper we introduce the Temporal Semantic Based Access Control model (TSBAC), as an extension of SBAC, which enhances the specification of user-defined authorization rules by constraining time interval and temporal expression over userspsila history of accesses. A formal semantics for temporal authorizations is provided and conflicting situations (due to the semantic relations of the SBAC model and a sub-interval relation between authorizations) are investigated and resolved in our proposed model. An architecture for the access control system based on the proposed model is presented, and finally, we discuss and evaluate TSBAC.

关键词： Access control History computer security computer networks

来源：评论

学校读者我要写书评

暂无评论

A Strategy Selection Model for network Survivability Based on Fuzzy Matrix Game

A Strategy Selection Model for Network Survivability Based o...

引用

International Conference on Web-Age Information Management Workshops (WAIM)

作者： Guosheng Zhao Huiqiang Wang Jian Wang Center of Computer Network and Information Harbin Normal University China School of Computer Science and Technology Harbin Engineering of Technology China

ISBN: (纸本)9781424432004;9780769531854

Survivability has emerged as a new phase for the development of network security technique, and how to improve the system survivability using effective strategy is an important problem. In this paper, by analyzing the fuzzy matrix game (FMG) theory and network survivability mechanism, a novel strategy selection model for network survivability based on FMG theory and its dynamic analysis method are presented from the macroscopically view. The result of instance analysis and validation show that the proposed method can provide guarantee conditions for network survivability effectively.

关键词： Games computer hacking Analytical models Security Mathematical model Decision making Game theory

来源：评论

学校读者我要写书评

暂无评论

FLMAP: A fast lightweight mutual authentication protocol for RFID systems

FLMAP: A fast lightweight mutual authentication protocol for...

引用

IEEE International Conference on networks

作者： Alireza Sadighian Rasool Jalili Network Security Center Department of Computer Engineering Sharif University of Technology Tehran Iran Department of Computer Engineering Sharif University of Technology Tehran Iran

Numerous authentication protocols for RFID systems were proposed as attempt to prevent unauthorized tracking and monitoring, impersonation or cloning, and information leakage. Many of such attempts cannot establish essential requirements that one robust authentication protocol must guarantee. In this paper, we propose a rapid mutual authentication protocol, called FLMAP, that overcomes all the drawbacks of previously proposed protocols. Our protocol has three passes and it does not use any cryptographic primitives such as hash functions and encryption algorithms; it is very fast and efficient. Significant characteristics of the protocol are forward security, tag anonymity, location privacy, resistance to disclosure attack, low complexity on the back-end server, and scalability. To the best of our knowledge, our protocol offers the most enhanced security features in RFID mutual authentication protocols with respect to user privacy. In analyzing the protocol, we show how remarkable properties such as forward security and tag anonymity are guaranteed.

关键词： Authentication Radiofrequency identification Cryptographic protocols Cryptography Privacy Data security Scalability RFID tags Costs computer security

来源：评论

学校读者我要写书评

暂无评论

Content and Overlay-Aware Transmission Scheduling in Peer-to-Peer Streaming

Content and Overlay-Aware Transmission Scheduling in Peer-to...

引用

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

作者： Jiaming Li Chai Kiat Yeo Bu Sung Lee Center for Multimedia and Network Technology (CeMNet) School of Computer Engineering Nanyang Technological University Singapore

A critical problem for P2P streaming applications is to construct and maintain the overlay such that it continues to efficiently distribute data stream even in dynamic network environment. A common solution to this problem is to constantly adapt the overlay structure to the changing network conditions. However, in this paper, we propose an algorithm to schedule the sending order of queued data at each peer by taking into account both the data content as well as the overlay conditions. The data packets which are important to most users on the entire P2P system are sent out earlier. Simulation results show that the scheduling algorithm improves the overall streaming quality of the P2P system with little overhead added to the network traffic. Moreover, the improvement in overall streaming quality is also achieved regardless of the video streaming formats.

关键词： Peer to peer computing Streaming media Scheduling algorithm Delay Dynamic scheduling Traffic control Processor scheduling computer networks Distributed computing Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

Storage requirements for key distribution in sensor networks

Storage requirements for key distribution in sensor networks

引用

2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008

作者： Liu, Zhihong Jianfeng, Ma Huang, Qiping Moon, SangJae Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University China School of Communication Engineering Xidian University China Mobile Network Security Technology Research Center Kyungpook National University Korea Republic of

ISBN: (纸本)9780769533308

Sensor networks are resource-constrained, which makes developing efficient key distribution scheme a challenging problem. In general, many key distribution techniques are designed to address the trade-off between limited resources and security, no key distribution technique is ideal to all the scenarios where sensor networks are used. In this paper, we primarily focus on storage requirements of several key distribution schemes in sensor networks, and obtain their lower bounds on the amount of information each user has to keep secret by modeling the key distribution schemes with an information theoretic framework. © 2008 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Assessment Method for network Survivability

A Comprehensive Assessment Method for Network Survivability

引用

International Conference on Internet Computing in Science and engineering (ICICSE)

作者： Huiqiang Wang Jian Wang Guosheng Zhao School of Computer Science and Technology Harbin Engineering of Technology Harbin China Center of Computer Network and Information Harbin Normal University Harbin China

Quantifying survivability for network system helps to give more accurate evaluation and compare different system or monitor the change of system survivability. This paper puts forward a new method that combines uncertain AHP with fuzzy comprehensive assessment technology to build an assessment model for network survivability. Using uncertain AHP acquire the weight value of each factor, and then the comment scores are fuzzed through membership function of fuzzy theory and construct fuzzy matrix, finally we will obtain the quantities evaluating result by adopting fuzzy comprehensive assessment technology. An instance is given to prove the validity and feasibility of using the method for network survivability assessment.

关键词： Uncertainty computer network reliability IP networks computer networks computer science Reliability engineering Electronic mail Information security Information systems Accidents

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共203页 << < 176 177 178 179 180 181 182 183 184 185 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：