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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

558 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

433 篇 工学
- 421 篇 计算机科学与技术...
- 140 篇 软件工程
- 105 篇 信息与通信工程
- 28 篇 网络空间安全
- 21 篇 电气工程
- 12 篇 控制科学与工程
- 9 篇 安全科学与工程
- 5 篇 建筑学
- 4 篇 生物工程
- 3 篇 动力工程及工程热...
- 3 篇 生物医学工程（可授...
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 交通运输工程
115 篇 理学
- 106 篇 数学
- 8 篇 统计学（可授理学、...
- 5 篇 生物学
- 5 篇 系统科学
- 2 篇 物理学
33 篇 管理学
- 21 篇 图书情报与档案管...
- 15 篇 管理科学与工程(可...
- 8 篇 工商管理
8 篇 法学
- 7 篇 社会学
- 1 篇 法学
3 篇 经济学
- 3 篇 应用经济学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 公共卫生与预防医...
1 篇 教育学
1 篇 军事学

主题

60 篇 privacy
44 篇 security
25 篇 data privacy
21 篇 differential pri...
21 篇 machine learning
20 篇 access control
14 篇 sensitive data
11 篇 iot
11 篇 android
11 篇 mobile security
10 篇 internet of thin...
10 篇 deep learning
9 篇 static analysis
9 篇 blockchain
8 篇 federated learni...
7 篇 homomorphic encr...
7 篇 web security
7 篇 network security
7 篇 cloud security
7 篇 cloud computing

机构

8 篇 purdue univ w la...
6 篇 north carolina s...
6 篇 rhein westfal th...
6 篇 carnegie mellon ...
5 篇 univ texas dalla...
4 篇 stevens inst tec...
4 篇 fraunhofer aisec...
4 篇 purdue universit...
4 篇 carnegie mellon ...
4 篇 concordia univ m...
3 篇 singapore inst t...
3 篇 ericsson secur r...
3 篇 purdue universit...
3 篇 ecole polytech f...
3 篇 umass boston bos...
3 篇 univ illinois ur...
3 篇 tech univ darmst...
3 篇 king's college l...
3 篇 university of pi...
3 篇 university of te...

作者

13 篇 bertino elisa
11 篇 sandhu ravi
7 篇 enck william
6 篇 ghinita gabriel
6 篇 meyer ulrike
6 篇 kantarcioglu mur...
5 篇 gupta maanak
5 篇 wang lingyu
4 篇 lee adam j.
4 篇 conti mauro
4 篇 murat kantarciog...
4 篇 elisa bertino
4 篇 liu fang
4 篇 mittal sudip
4 篇 gabriel ghinita
4 篇 gunter carl a.
4 篇 pourzandi makan
4 篇 pretschner alexa...
4 篇 wetzel susanne
4 篇 majumdar suryadi...

语言

554 篇 英文
4 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the Eleventh ACM Conference on Data and Application Security and Privacy"

共 559 条记录，以下是481-490 订阅

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

详细简洁

排序：

Measuring query privacy in location-based services 12

Measuring query privacy in location-based services

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Chen, Xihui Pang, Jun Interdisciplinary Centre for Security Reliability and Trust University of Luxembourg Luxembourg Computer Science and Communications University of Luxembourg Luxembourg

ISBN: (纸本)9781450310918

The popularity of location-based services leads to serious concerns on user privacy. A common mechanism to protect users' location and query privacy is spatial generalisation. As more user information becomes available with the fast growth of Internet applications, e.g., social networks, attackers have the ability to construct users' personal profiles. This gives rise to new challenges and reconsideration of the existing privacy metrics, such as k-anonymity. In this paper, we propose new metrics to measure users' query privacy taking into account user profiles. Furthermore, we design spatial generalisation algorithms to compute regions satisfying users' privacy requirements expressed in these metrics. By experimental results, our metrics and algorithms are shown to be effective and efficient for practical usage. © 2012 acm.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Short paper: Enhancing mobile application permissions with runtime feedback and constraints

Short paper: Enhancing mobile application permissions with r...

引用

2nd acm Workshop on security and privacy in Smartphones and Mobile Devices, SPSM 2012

作者： Jung, Jaeyeon Han, Seungyeop Wetherall, David Microsoft Research One Microsoft Way Redmond WA United States University of Washington Allen Center Box 352350 Seattle WA United States

ISBN: (纸本)9781450316668

We report on a field study that uses a combination of OS measurements and qualitative interviews to highlight gaps between user expectations with respect to privacy and the result of using the existing permissions architecture to install mobile apps. Most of our participants expected advertising and analytics behavior, yet they were often surprised by applications' data collection in the background and the level of data sharing with third parties that actually occurred. Given participant feedback, we propose platform support to reduce this "expectation gap" with transparency of data usage and constrained permissions.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

privacy Streamliner: A Two-Stage Approach to Improving Algorithm Efficiency 12

Privacy Streamliner: A Two-Stage Approach to Improving Algor...

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Liu, Wen Ming Wang, Lingyu Concordia Institute for Information Systems Engineering Concordia University MontrealQCH3G 1M8 Canada

ISBN: (纸本)9781450310918

In releasing data with sensitive information, a data owner usually has seemingly conflicting goals, including privacy preservation, utility optimization, and algorithm efficiency. In this paper, we observe that a high computational complexity is usually incurred when an algorithm conflates the processes of privacy preservation and utility optimization. We then propose a novel privacy streamliner approach to decouple those two processes for improving algorithm efficiency. More specifically, we first identify a set of potential privacy-preserving solutions satisfying that an adversary's knowledge about this set itself will not help him/her to violate the privacy property;we can then optimize utility within this set without worrying about privacy breaches since such an optimization is now simulatable by adversaries. To make our approach more concrete, we study it in the context of micro-data release with publicly known generalization algorithms. The analysis and experiments both confirm our algorithms to be more efficient than existing solutions. © 2012 acm.

关键词： privacy-preserving techniques

来源：评论

学校读者我要写书评

暂无评论

Comparison-based encryption for fine-grained access control in clouds 12

Comparison-based encryption for fine-grained access control ...

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Zhu, Yan Hu, Hongxin Ahn, Gail-Joon Yu, Mengyang Zhao, Hongjia Institute of Computer Science and Technology Peking University Beijing 100871 China Beijing Key Laboratory of Internet Security Technology Peking University Beijing 100871 China Arizona State University Tempe AZ 85281 United States

ISBN: (纸本)9781450310918

Access control is one of the most important security mechanisms in cloud computing. However, there has been little work that explores various comparison-based constraints for regulating data access in clouds. In this paper, we present an innovative comparison-based encryption scheme to facilitate fine-grained access control in cloud computing. By means of forward/backward derivation functions, we introduce comparison relation into attribute-based encryption to implement various range constraints on integer attributes, such as temporal and level attributes. Then, we present a new cryptosystem with dual decryption to reduce computational overheads on cloud clients, where the majority of decryption operations are executed in cloud servers. We also prove the security strength of our proposed scheme, and our experiment results demonstrate the efficiency of our methodology. © 2012 acm.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Measuring vote privacy, revisited 12

Measuring vote privacy, revisited

引用

2012 acm conference on Computer and Communications security, CCS 2012

作者： Bernhard, David Cortier, Véronique Pereira, Olivier Warinschi, Bogdan University of Bristol Bristol United Kingdom CNRS Loria UMR 7503 Vandoeuvre-lès-Nancy F-54500 France Université Catholique de Louvain ICTEAM B-1348 Louvain-la-Neuve Belgium

ISBN: (纸本)9781450316507

We propose a new measure for privacy of votes. Our measure relies on computational conditional entropy, an extension of the traditional notion of entropy that incorporates both informationtheoretic and computational aspects. As a result, we capture in a unified manner privacy breaches due to two orthogonal sources of insecurity: combinatorial aspects that have to do with the number of participants, the distribution of their votes and published election outcome as well as insecurity of the cryptography used in an implementation. Our privacy measure overcomes limitations of two previous approaches to defining vote privacy and we illustrate its applicability through several case studies. We offer a generic way of applying our measure to a large class of cryptographic protocols that includes the protocols implemented in Helios. We also describe a practical application of our metric on Scantegrity audit data from a real election. Copyright © 2012 acm.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Cookie-based privacy issues on google services 12

Cookie-based privacy issues on google services

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Toubiana, Vincent Verdot, Vincent Christophe, Benoit Bell Labs Research Alcatel-Lucent Bell Labs France Route de Villejust Nozay91620 France

ISBN: (纸本)9781450310918

With the success of Web applications, most of our data is now stored on various third-party servers where they are processed to deliver personalized services. Naturally, we must be authenticated to access this personal information, but the use of personalized services only restricted by identification could indirectly and silently leak sensitive data. We analyzed Google Web Search access mechanisms and found that the current policy applied to session cookies could be used to retrieve users' personal data. We describe two attack schemes based on the Google's "SID cookie". First, we show that it permits a session fixation attack in which the victim's searches are recorded in the attacker's Google Web Search History. The second attack leverages the search personalization (based on the same SID cookie) to retrieve a part of the victim's click history and even some of her contacts. We implemented a proof of concept of the latter attack on the Firefox Web browser and conducted an experiment with ten volunteers. Thanks to this prototype we were able to recover up to 80% of the user's search click history. © 2012 acm.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Revisiting link privacy in social networks 12

Revisiting link privacy in social networks

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Effendy, Suhendry Yap, Roland H.C. Halim, Felix School of Computing National University of Singapore 13 Computing Drive Singapore Singapore

ISBN: (纸本)9781450310918

In this paper, we revisit the problem of the link privacy attack in online social networks. In the link privacy attack, it turns out that by bribing or compromising a small number of nodes (users) in the social network graph, it is possible to obtain complete link information for a much larger fraction of other non-bribed nodes in the graph. This can constitute a significant privacy breach in online social networks where the link information of nodes is kept private or accessible only to closely related nodes. We show that the link privacy attack can be made even more effective with degree inference. Since online social networks typically have high degree, the link privacy attack becomes quite feasible even with an in-lookahead neighborhood of one (only friends can see a user's links/profile). To reduce the effect of the link privacy attack, we present several practical mitigation strategies - non-uniform user privacy settings, approximation of the node degree information and a non-constant cost model for the attack. All the strategies are able to mitigate the privacy link attack by either reducing the effectiveness of the attack or by making it more expensive to mount. Interestingly, some of the more efficient strategies now become worse than the RANDOM strategy and the effect of a larger neighborhood which would otherwise make the attack even more efficient can be mitigated. © 2012 acm.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

SWIPE: Eager Erasure of Sensitive data in Large Scale Systems Software 12

SWIPE: Eager Erasure of Sensitive Data in Large Scale System...

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Gondi, Kalpana Bisht, Prithvi Venkatachari, Praveen Sistla, A. Prasad Venkatakrishnan, V.N. Department of Computer Science University of Illinois Chicago United States

ISBN: (纸本)9781450310918

We describe SWIPE, an approach to reduce the life time of sensitive, memory resident data in large scale applications written in C. In contrast to prior approaches that used a delayed or lazy approach to the problem of erasing sensitive data, SWIPE uses a novel eager erasure approach that minimizes the risk of accidental sensitive data leakage. SWIPE achieves this by transforming a legacy C program to include additional instructions that erase sensitive data immediately after its intended use. SWIPE is guided by a highly-scalable static analysis technique that precisely identifies the locations to introduce erase instructions in the original program. The programs transformed using SWIPE enjoy several additional benefits: minimization of leaks that arise due to data dependencies;erasure of sensitive data with minimal developer guidance;and negligible performance overheads. © 2012 acm.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

Quantitative access control with partially-observable Markov decision processes 12

Quantitative access control with partially-observable Markov...

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Martinelli, Fabio Morisset, Charles Security Group IIT-CNR Pisa Italy

ISBN: (纸本)9781450310918

This paper presents a novel access control framework reducing the access control problem to a traditional decision problem, thus allowing a policy designer to reuse tools and techniques from the decision theory. We propose here to express, within a single framework, the notion of utility of an access, decisions beyond the traditional allowing/denying of an access, the uncertainty over the effect of executing a given decision, the uncertainty over the current state of the system, and to optimize this process for a (probabilistic) sequence of requests. We show that an access control mechanism including these different concepts can be specified as a (Partially Observable) Markov Decision Process, and we illustrate this framework with a running example, which includes notions of conflict, critical resource, mitigation and auditing decisions, and we show that for a given sequence of requests, it is possible to calculate an optimal policy different from the naive one. This optimization is still possible even for several probable sequences of requests. © 2012 acm.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

The privacy in the Time of the Internet: Secrecy vs Transparency 12

The Privacy in the Time of the Internet: Secrecy vs Transpar...

引用

2nd acm conference on data and application security and privacy, CODASPY'12

作者： Pontual, Murillo Gampe, Andreas Chowdhury, Omar Kone, Bazoumana Ashik, Md. Shamim Winsborough, William H. The University of Texas at San Antonio United States

ISBN: (纸本)9781450310918

In the current time of the Internet, specifically with the emergence of social networking, people are sharing both sensitive and non-sensitive information among each other without understanding its consequences. Federal regulations exist to mandate how sensitive information (e.g., SSN, health records, etc.) of a person can be shared (or, used) by organizations. However, there are no established norms or practices regarding how information that is deemed to be not sensitive may be used or shared. Furthermore, for the sake of transparency, different organizations reveal small amounts of non-sensitive information (i.e., photos, salaries, work hours, size of the houses, etc.) about their clients or employees. Although such information seems insignificant, the aggregation of it can be used to create a partial profile of a person which can later be used by malicious parties for robbery, extortion, kidnapping, etc. The goal of this work is to create awareness by demonstrating that it is plausible to create such a partial profile of a person just by crawling the Internet. For this, we have developed an open source framework that generates batch crawlers to create partial profiles of individuals. We also show empirical comparisons of the amount of information that can be gathered by using free and also paid websites. © 2012 acm.

关键词： Transparency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 45 46 47 48 49 50 51 52 53 54 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：