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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

76 篇 会议
2 篇 期刊文献

馆藏范围

78 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

63 篇 工学
- 52 篇 计算机科学与技术...
- 20 篇 信息与通信工程
- 19 篇 软件工程
- 16 篇 电气工程
- 5 篇 电子科学与技术（可...
- 3 篇 控制科学与工程
- 3 篇 网络空间安全
- 2 篇 仪器科学与技术
- 2 篇 生物工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 水利工程
- 1 篇 交通运输工程
- 1 篇 安全科学与工程
6 篇 理学
- 3 篇 物理学
- 2 篇 数学
- 2 篇 生物学
- 1 篇 大气科学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 1 篇 工商管理
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 医学
- 1 篇 临床医学

主题

8 篇 network security
6 篇 security
4 篇 trust
3 篇 intrusion detect...
3 篇 resource managem...
3 篇 cryptography
2 篇 computer science
2 篇 access control
2 篇 mobile ad hoc ne...
2 篇 communication sy...
2 篇 fault tolerance
2 篇 authentication
2 篇 remote attestati...
2 篇 cloud
2 篇 computer system ...
2 篇 network coding
2 篇 wireless sensor ...
2 篇 game theory
2 篇 systems analysis
2 篇 mobile computing

机构

4 篇 chinese acad sci...
2 篇 hp
2 篇 pucrs
2 篇 dalian univ tech...
2 篇 id-imag grenoble
1 篇 sungkyunkwan uni...
1 篇 ibm global solut...
1 篇 univ wisconsin d...
1 篇 univ michigan an...
1 篇 chinese acad sci...
1 篇 department of co...
1 篇 univ aizu div in...
1 篇 electrical engin...
1 篇 department of co...
1 篇 dalian univ tech...
1 篇 politechnic scho...
1 篇 nyu comp sci & e...
1 篇 evergreen state ...
1 篇 univ waikato cyb...
1 篇 hosei univ dept ...

作者

2 篇 bouhoula adel
1 篇 liang fengrui
1 篇 jankowiak i.
1 篇 cherfaoui véroni...
1 篇 li sen
1 篇 giffin jonathon ...
1 篇 o. richard
1 篇 ateniese giusepp...
1 篇 kong huafeng
1 篇 f.i. massetto
1 篇 jacob florian
1 篇 yao wei
1 篇 maillard n.
1 篇 chenyu yan
1 篇 kim hyoungshick
1 篇 li xin
1 篇 coombes peter j
1 篇 yu wang
1 篇 fengrui liang
1 篇 yang bo

语言

77 篇 英文
1 篇 中文

检索条件"任意字段=14th Symposium on Network and Distributed System Security, NDSS 2007"

共 78 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of the symposium on network and distributed system security, ndss 2007

Proceedings of the Symposium on Network and Distributed Syst...

引用

14th symposium on network and distributed system security, ndss 2007

the proceedings contain 17 papers. the topics discussed include: a quantitative study of forum spamming using context-based analysis;army of botnets;attribute-based publishing with hidden credentials and hidden policies;consumable credentials in logic-based access-control systems;cross-site scripting prevention with dynamic data tainting and static analysis;cryptographic methods for storing ballots on a voting machine;FiG: automatic fingerprint generation;file system design with assured delete;a generic application-level protocol analyzer and its language;low-rate TCP-targeted dos attack disrupts Internet routing;and on the computational practicality of private information retrieval.

关键词：

来源：评论

学校读者我要写书评

暂无评论

File system Design with Assured Delete 14

File System Design with Assured Delete

引用

14th symposium on network and distributed system security, ndss 2007

作者： Perlman, Radia Sun Microsystems United States

this paper describes a system that supports high availability of data, until the data should be expunged, at which time it is impossible to recover the data. this design supports three types of assured delete;expiration time known at file creation, on-demand deletion of individual files, and custom keys for classes of data. the obvious approach, of course, is to encrypt the data on nonvolatile storage, and then destroy keys at the appropriate times. However, managing ephemeral keys;robustly keeping them for some amount of time, and then reliably destroying every copy, is difficult. We partition the problem so that the burden of ephemeral key management can be outsourced to a minimally trusted third party we refer to as an "ephemerizer", with negligible performance overhead, resulting in a file system that is easy and inexpensive to manage. © 2007Proceedings of the symposium on network and distributed system security, ndss 2007. All Rights Reserved.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

On the Computational Practicality of Private Information Retrieval 14

On the Computational Practicality of Private Information Ret...

引用

14th symposium on network and distributed system security, ndss 2007

作者： Sion, Radu Carbunar, Bogdan Network Security and Applied Cryptography Lab Computer Sciences Stony Brook University United States Pervasive Platforms and Architectures Motorola Labs United States

We explore the limits of single-server computational private information retrieval (PIR) for the purpose of preserving client access patterns leakage. We show that deployment of non-trivial single server PIR protocols on real hardware of the recent past would have been orders of magnitude less time-efficient than trivially transferring the entire database. We stress that these results are beyond existing knowledge of mere "impracticality" under unfavorable assumptions. they rather reflect an inherent limitation with respect to modern hardware, likely the result of a communication-cost centric protocol design. We argue that this is likely to hold on non-specialized traditional hardware in the foreseeable future. We validate our reasoning in an experimental setup on modern off-the-shelf hardware. Ultimately, we hope our results will stimulate practical designs. © 2007Proceedings of the symposium on network and distributed system security, ndss 2007. All Rights Reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Playing Devil’s Advocate: Inferring Sensitive Information from Anonymized network Traces 14

Playing Devil’s Advocate: Inferring Sensitive Information f...

引用

14th symposium on network and distributed system security, ndss 2007

作者： Coull, Scott E. Wright, Charles V. Monrose, Fabian Collins, Michael P. Reiter, Michael K. Department of Computer Science Johns Hopkins University BaltimoreMD United States CERT/Network Situational Awareness Software Engineering Institute Carnegie Mellon University United States Electrical & Computer Engineering Department Computer Science Department Carnegie Mellon University PittsburghPA United States

Encouraging the release of network data is central to promoting sound network research practices, though the publication of this data can leak sensitive information about the publishing organization. To address this dilemma, several techniques have been suggested for anonymizing network data by obfuscating sensitive fields. In this paper, we present new techniques for inferring network topology and deanonymizing servers present in anonymized network data, using only the data itself and public information. Via analyses on three different network datasets, we quantify the effectiveness of our techniques, showing that they can uncover significant amounts of sensitive information. We also discuss prospects for preventing these deanonymization attacks. © 2007Proceedings of the symposium on network and distributed system security, ndss 2007. All Rights Reserved.

关键词： network topology

来源：评论

学校读者我要写书评

暂无评论

Secret Handshakes with Dynamic and Fuzzy Matching 14

Secret Handshakes with Dynamic and Fuzzy Matching

引用

14th symposium on network and distributed system security, ndss 2007

作者： Ateniese, Giuseppe Blanton, Marina Kirsch, Jonathan Department of Computer Science The Johns Hopkins University United States Department of Computer Science Purdue University United States

the need for communication privacy over public networks is of growing concern in today’s society. As a result, privacy-preserving authentication and key exchange protocols have become critical primitives in building secure distributed systems. Secret handshakes provide such a service by allowing two members of the same group to secretly and privately authenticate to each other and agree on a shared key for further communication. this paper presents the first efficient secret handshake schemes with unlinkable, reusable credentials that do not rely on random oracles for their security (solving open problems from prior literature). In previous work, secret handshakes were extended with roles, so that a group member A can specify the role another group member B must have in order to successfully complete the protocol with A. We generalize the traditional and role-based secret handshake in two ways. First, we present a secret handshake with dynamic matching, in which each party can specify both the group and the role the other must have in order to complete the handshake. Second, we provide a novel extension of secret handshakes to include attributes, allowing the handshake to be based on approximate (or fuzzy) matching. We demonstrate the practicality and efficiency of our protocols by evaluating a prototype implementation. We integrate our dynamic matching protocol into IPsec, and we detail the performance tradeoffs associated with our fuzzy matching scheme. Our experiments indicate that our solutions offer attractive performance. © 2007Proceedings of the symposium on network and distributed system security, ndss 2007. All Rights Reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Behind the Scenes of Online Attacks: an Analysis of Exploitation Behaviors on the Web 20

Behind the Scenes of Online Attacks: an Analysis of Exploita...

引用

20th Annual network and distributed system security symposium, ndss 2013

作者： Canali, Davide Balzarotti, Davide EURECOM France

Web attacks are nowadays one of the major threats on the Internet, and several studies have analyzed them, providing details on how they are performed and how they spread. However, no study seems to have sufficiently analyzed the typical behavior of an attacker after a website has been compromised. this paper presents the design, implementation, and deployment of a network of 500 fully functional honeypot websites, hosting a range of different services, whose aim is to attract attackers and collect information on what they do during and after their attacks. In 100 days of experiments, our system automatically collected, normalized, and clustered over 85, 000 files that were created during approximately 6, 000 attacks. Labeling the clusters allowed us to draw a general picture of the attack landscape, identifying the behavior behind each action performed both during and after the exploitation of a web application. © ndss *** rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Exposing Congestion Attack on Emerging Connected Vehicle based Traffic Signal Control 25

Exposing Congestion Attack on Emerging Connected Vehicle bas...

引用

25th Annual network and distributed system security symposium (ndss)

作者： Chen, Qi Alfred Yin, Yucheng Feng, Yiheng Mao, Z. Morley Liu, Henry X. Univ Michigan Ann Arbor MI 48109 USA

ISBN: (纸本)1891562495

Connected vehicle (CV) technology will soon transform today's transportation systems by connecting vehicles and the transportation infrastructure through wireless communication. Having demonstrated the potential to greatly improve transportation mobility efficiency, such dramatically increased connectivity also opens a new door for cyber attacks. In this work, we perform the first detailed security analysis of the next-generation CV-based transportation systems. As a first step, we target the USDOT (U.S. Department of Transportation) sponsored CV-based traffic control system, which has been tested and shown high effectiveness in real road intersections. In the analysis, we target a realistic threat, namely CV data spoofing from one single attack vehicle, with the attack goal of creating traffic congestion. We first analyze the system design and identify data spoofing strategies that can potentially influence the traffic control. Based on the strategies, we perform vulnerability analysis by exhaustively trying all the data spoofing options for these strategies to understand the upper bound of the attack effectiveness. For the highly effective cases, we analyze the causes and find that the current signal control algorithm design and implementation choices are highly vulnerable to data spoofing attacks from even a single attack vehicle. these vulnerabilities can be exploited to completely reverse the benefit of the CV-based signal control system by causing the traffic mobility to be 23.4% worse than that without adopting such system. We then construct practical exploits and evaluate them under real-world intersection settings. the evaluation results are consistent with our vulnerability analysis, and we find that the attacks can even cause a blocking effect to jam an entire approach. In the jamming period, 22% of the vehicles need to spend over 7 minutes for an original half-minute trip, which is 14 times higher. We also discuss defense directions leveraging the insigh

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

CODO: Firewall traversal by cooperative on-demand opening

CODO: Firewall traversal by cooperative on-demand opening

引用

14th IEEE International symposium on High Performance distributed Computing

作者： Son, SC Allcock, B Livny, M Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)0780390377

Firewalls and network address translators (NATs) cause significant connectivity problems along with benefits such as network protection and easy address planning. Connectivity problems make nodes separated by a firewall/NAT unable to communicate with each other. Due to the bidirectional and multi-organizational nature of grids, they are particularly susceptible to connectivity problems. these problems make collaboration difficult or impossible and cause resources to be wasted. this paper presents a system, called CODO, which provides applications end-to-end connectivity over firewalls/NATs in a secure way. CODO allows applications authorized through strong security mechanisms to traverse firewalls/NATs, while blocking unauthorized applications. this paper also formalizes the firewall/NAT traversal problem and clarifies how a traversal system fits in the overall security policy enforcement by a firewall/NAT.

关键词： Computer system firewalls

来源：评论

学校读者我要写书评

暂无评论

Get a Model! Model Hijacking Attack Against Machine Learning Models 29

Get a Model! Model Hijacking Attack Against Machine Learning...

引用

29th Annual network and distributed system security symposium, ndss 2022

作者： Salem, Ahmed Backes, Michael Zhang, Yang CISPA Helmholtz Center for Information Security Germany

ISBN: (纸本)1891562746

Machine learning (ML) has established itself as a cornerstone for various critical applications ranging from autonomous driving to authentication systems. However, with this increasing adoption rate of machine learning models, multiple attacks have emerged. One class of such attacks is training time attack, whereby an adversary executes their attack before or during the machine learning model training. In this work, we propose a new training time attack against computer vision based machine learning models, namely model hijacking attack. the adversary aims to hijack a target model to execute a different task than its original one without the model owner noticing. Model hijacking can cause accountability and security risks since a hijacked model owner can be framed for having their model offering illegal or unethical services. Model hijacking attacks are launched in the same way as existing data poisoning attacks. However, one requirement of the model hijacking attack is to be stealthy, i.e., the data samples used to hijack the target model should look similar to the model's original training dataset. To this end, we propose two different model hijacking attacks, namely Chameleon and Adverse Chameleon, based on a novel encoder-decoder style ML model, namely the Camouflager. Our evaluation shows that both of our model hijacking attacks achieve a high attack success rate, with a negligible drop in model utility. © 2022 29th Annual network and distributed system security symposium, ndss 2022. All Rights Reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

No Grammar, No Problem: Towards Fuzzing the Linux Kernel without system-Call Descriptions 30

No Grammar, No Problem: Towards Fuzzing the Linux Kernel wit...

引用

30th Annual network and distributed system security symposium, ndss 2023

作者： Bulekov, Alexander Das, Bandan Hajnoczi, Stefan Egele, Manuel Boston University United States Red Hat

ISBN: (纸本)1891562835

the integrity of the entire computing ecosystem depends on the security of our operating systems (OSes). Unfortunately, due to the scale and complexity of OS code, hundreds of security issues are found in OSes, every year [32]. As such, operating systems have constantly been prime use-cases for applying security-analysis tools. In recent years, fuzz-testing has appeared as the dominant technique for automatically finding security issues in software. As such, fuzzing has been adapted to find thousands of bugs in kernels [14]. However, modern OS fuzzers, such as Syzkaller, rely on precise, extensive, manually-created harnesses and grammars for each interface fuzzed within the kernel. Due to this reliance on grammars, current OS fuzzers are faced with scaling-issues. In this paper, we present FUZZNG, our generic approach to fuzzing system-calls on OSes. Unlike Syzkaller, FUZZNG does not require intricate descriptions of system-call interfaces in order to function. Instead FUZZNG leverages fundamental kernel design features in order to reshape and simplify the fuzzer’s input-space. As such FUZZNG only requires a small config, for each new target: essentially a list of files and system-call numbers the fuzzer should explore. We implemented FUZZNG for the Linux kernel. Testing FUZZNG over 10 Linux components with extensive descriptions in Syzkaller showed that, on average, FUZZNG achieves 102.5% of Syzkaller’s coverage. FUZZNG found 9 new bugs (5 in components that Syzkaller had already fuzzed extensively, for years). Additionally, FUZZNG’s lightweight configs are less than 1.7% the size of Syzkaller’s manually-written grammars. Crucially, FUZZNG achieves this without initial seed-inputs, or expert guidance. © 2023 30th Annual network and distributed system security symposium, ndss 2023. All Rights Reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共8页 << < 1 2 3 4 5 6 7 8 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：