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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

555 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

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

主题

59 篇 privacy
44 篇 security
25 篇 data privacy
21 篇 differential pri...
21 篇 machine learning
20 篇 access control
13 篇 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...

语言

552 篇 英文
3 篇 其他
1 篇 中文

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

共 556 条记录，以下是131-140 订阅

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

详细简洁

排序：

Programming Support for Local-First Software Enabling the Design of privacy-Preserving Distributed Software without Relying on the Cloud 26

Programming Support for Local-First Software Enabling the De...

引用

acm SIGPLAN International conference on Systems, Programming, Languages, and applications: Software for Humanity (SPLASH Companion)

作者： Haas, Julian Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781450399012

Local-first software manages and processes private data locally while still enabling collaboration between multiple parties connected via partially unreliable networks. Such software typically involves interactions with users and the execution environment (the outside world). The decentralized nature of local-first software paired with the unpredictability of interactions driven from the outside world impede reasoning about their correctness. Yet, existing solutions to develop local-first software do not provide safety guarantees and instead expect developers to reason about concurrent interactions in an environment with unreliable network conditions. This is too much to ask of application developers, who are usually not experts in designing distributed systems. This work seeks to develop a programming model which facilitates the construction of local-first software and eradicates certain classes of safety and security problems by design. We do so by providing a dedicated local-first programming language and an accompanying automated verification procedure that can be integrated as part of the compilation process.

关键词： local-first reactive programming

来源：评论

学校读者我要写书评

暂无评论

Don't fool yourself with Forward privacy, Your queries STILL belong to us! 21

Don't fool yourself with Forward Privacy, Your queries STILL...

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Salmani, Khosro Barker, Ken Mt Royal Univ Calgary AB Canada Univ Calgary Calgary AB Canada

ISBN: (纸本)9781450381437

Dynamic Searchable Symmetric Encryption (DSSE) enables a user to perform encrypted search queries on encrypted data stored on a server. Recently, a notion of Forward privacy (FP) was introduced to guarantee that a newly added document cannot be linked to previous queries, and to thwart relative attacks and lessen information leakage and its consequences. However, in this paper we show that the forward-private schemes have no advantage (in preventing the related attacks) compared to traditional approaches, and previous attacks are still applicable on FP schemes. In FP approaches, access pattern leakage is still possible and can be employed to uncover the search pattern which can be used by passive and adaptive attacks. To address this issue, we construct a new parallelizable DSSE approach to obfuscate the access and search pattern. Our cost-efficient scheme supports both updates and searches. Our security proof and performance analysis demonstrate the practicality, efficiency, and security of our approach.

关键词： data privacy Cloud security Dynamic SSE Access and search pattern leakage

来源：评论

学校读者我要写书评

暂无评论

Defining security Limits in Biometrics 25

Defining Security Limits in Biometrics

引用

proceedings of the fifteenth acm conference on data and application security and privacy

作者： Axel Durbet Paul-Marie Grollemund Pascal Lafourcade Kevin Thiry-Atighehchi CNRS Clermont Auvergne INP Mines Saint-Étienne LIMOS Université Clermont Auvergne Clermont-Ferrand France CNRS Clermont Auvergne INP Mines Saint-Étienne LMBP Université Clermont Auvergne Clermont-Ferrand France

ISBN: (纸本)9798400714764

Biometric systems are widely used for authentication and identification. The False Match Rate (FMR) quantifies the probability of matching a biometric template to a non-corresponding template and serves as an indicator of the system robustness against security threats. We analyze biometric systems through two main contributions. First, we study untargeted attacks, where an adversary aims to impersonate any user in the database. We compute the number of trials needed for a successful impersonation and derive the critical population size ( i.e., the maximum database size) and critical (FMR) required to maintain security against untargeted attacks as the database grows. Second, we address the biometric birthday problem, which quantifies the probability that there exists two distinct users that collide ( i.e., can impersonate each other). We compute approximate and exact probabilities of collision and derive the associated critical population size and critical (FMR) to bound the risk of biometric collisions, particularly in large-scale databases. These thresholds provide actionable insights for designing biometric systems that mitigate the risks of impersonation and biometric collisions, particularly in large-scale databases. Nevertheless, our findings show that current systems fail to meet the required security level against untargeted attacks, even in small databases, and face significant challenges with the biometric birthday problem as databases grow.

关键词： biometric security

来源：评论

学校读者我要写书评

暂无评论

Two-Client Inner-Product Functional Encryption with an application to Money-Laundering Detection 22

Two-Client Inner-Product Functional Encryption with an Appli...

引用

28th acm SIGSAC conference on Computer and Communications security (CCS)

作者： de Perthuis, Paola Pointcheval, David Cosmian Paris France CNRS INRIA ENS PSL CosmianDIENS Paris France

ISBN: (纸本)9781450394505

In this paper, we extend Inner-Product Functional Encryption (IPFE), where there is just a vector in the key and a vector in the single sender's ciphertext, to two-client ciphertexts. More precisely, in our two-client functional encryption scheme, there are two data Providers who can independently encrypt vectors alpha and y for a data consumer who can, from a functional decryption key associated to a vector alpha, compute Sigma alpha(i)x(i)y(i) = x. center dot Diag(alpha) center dot y(inverted perpendicular). Ciphertexts are linear in the dimension of the vectors, whereas the functional decryption keys are of constant size. We study two interesting particular cases: 2-party Inner-Product Functional Encryption, with alpha = (1,..., 1). There is a unique functional decryption key, which enables the computation of x center dot y(inverted perpendicular) by a third party, where.. and.. are provided by two independent clients;Inner-Product Functional Encryption with a Selector, with x = x(0)parallel to x(1) and y = (b) over bar (n)parallel to b(n) is an element of {1(n)parallel to 0(n),0(n)parallel to 1(n)}}, for some bit b, on the public coefficients alpha = alpha(0)parallel to alpha(1), in the functional decryption key, so that one gets x(b) center dot alpha(inverted perpendicular)(b), where x and b are provided by two independent clients. This result is based on the fundamental Product-Preserving Lemma, which is of independent interest. It exploits Dual Pairing Vector Spaces (DPVS), with security proofs under the SXDH assumption. We provide two practical applications to medical diagnosis for the latter IPFE with a selector, and to money-laundering detection for the former 2-party IPFE, both with strong privacy properties, adaptative security and the use of labels granting a Multi-Client Functional Encryption (MCFE) security for the scheme, thus enabling its use in practical situations.

关键词： functional encryption inner-product private evaluation

来源：评论

学校读者我要写书评

暂无评论

A Large Publicly Available Corpus of Website privacy Policies Based on DMOZ 21

A Large Publicly Available Corpus of Website Privacy Policie...

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Zaeem, Razieh Nokhbeh Barber, K. Suzanne Univ Texas Austin Ctr Ident Austin TX 78712 USA

ISBN: (纸本)9781450381437

Studies have shown website privacy policies are too long and hard to comprehend for their target audience. These studies and a more recent body of research that utilizes machine learning and natural language processing to automatically summarize privacy policies greatly benefit, if not rely on, corpora of privacy policies collected from the web. While there have been smaller annotated corpora of web privacy policies made public, we are not aware of any large publicly available corpus. We use DMOZ, a massive open-content directory of the web, and its manually categorized 1.5 million websites, to collect hundreds of thousands of privacy policies associated with their categories, enabling research on privacy policies across different categories/market sectors. We review the statistics of this corpus and make it available for research. We also obtain valuable insights about privacy policies, e.g., which websites post them less often. Our corpus of web privacy policies is a valuable tool at the researchers' disposal to investigate privacy policies. For example, it facilitates comparison among different methods of privacy policy summarization by providing a benchmark, and can be used in unsupervised machine learning to summarize privacy policies.

关键词： datasets privacy policies DMOZ corpus

来源：评论

学校读者我要写书评

暂无评论

2022 4th Blockchain and Internet of Things conference, BIOTC 2022

2022 4th Blockchain and Internet of Things Conference, BIOTC...

引用

4th Blockchain and Internet of Things conference, BIOTC 2022

ISBN: (纸本)9781450396622

The proceedings contain 18 papers. The topics discussed include: distributed random number generation method on smart contracts;loan chain: a blockchain-based framework for smart credit lending;blockchain-based security governance framework of agricultural product traceability data;research progress and trend prospect of blockchain technology application in logistics and supply chain information system under pandemic-hit;a blockchain-based electricity retail contracts management system;computational experimental evaluation of the time variance of cryptocurrency mining using cryptographic hash functions;optimization of student physical health data cycle under computer blockchain technology;design and implementation of electronic medical record system based on Hyperledger fabric;trusted blockchain-based data fingerprinting differential-traceability and SkipList indexing methods in privacy protection;and a blockchain-enabled location privacy-preserving under local differential privacy for internet of vehicles.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Efficient Labeling of Network Incident datasets Using Tcpreplay and Snort 21

Towards Efficient Labeling of Network Incident Datasets Usin...

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Masumi, Kohei Han, Chansu Ban, Tao Takahashi, Takeshi Natl Inst Informat & Commun Technol Tokyo Japan

ISBN: (纸本)9781450381437

Research on network intrusion detection (NID) requires a large amount of traffic data with reliable labels indicating which packets are associated with particular network attacks. In this paper, we implement a prototype of an automated system to create labeled packet datasets for NID research. By re-transmitting pre-captured packet data in a controlled network environment pre-installed with a network intrusion detection system, the system automatically assigns labels to attack packets within the packet data. In the feasibility study, we investigate factors that may influence the detection accuracy of the attacking packets and show an example using the prototype to label a packet file. Finally, we show an efficient way to locate the packets associated with issued NID alerts using this prototype.

关键词： Network intrusion detection data labeling Tcpreplay Snort

来源：评论

学校读者我要写书评

暂无评论

Decentralized Reputation 21

Decentralized Reputation

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Dimitriou, Tassos Kuwait Univ Comp Engn Dept Kuwait Kuwait

ISBN: (纸本)9781450381437

In this work we develop a privacy-preserving reputation scheme for collaborative systems such as P2P networks in which peers can represent themselves with different pseudonyms when interacting with others. All these pseudonyms, however, are bound to the same reputation token, allowing honest peers to maintain their good record even when switching to a new pseudonym while preventing malicious ones from making a fresh start. Our system is truly decentralized. Using an append-only distributed ledger such as Bitcoin's blockchain, we show how participants can make anonymous yet verifiable assertions about their own reputation. In particular, reputation can be demonstrated and updated effectively using efficient zkSNARK proofs. The system maintains soundness, peer-pseudonym unlinkability as well as unlinkability among pseudonyms of the same peer. We formally prove these properties and we evaluate the efficiency of the various operations, demonstrating the viability of our approach.

关键词： Reputation Decentralization privacy Peer-to-peer networks Sybilresistance Blockchain zkSNARKs

来源：评论

学校读者我要写书评

暂无评论

Quantum Obfuscation: Quantum Predicates with Entangled qubits 21

Quantum Obfuscation: Quantum Predicates with Entangled qubit...

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Balachandran, Vivek Singapore Inst Technol Singapore Singapore

ISBN: (纸本)9781450381437

In this paper we discuss developing opaque predicates with the help of quantum entangled qubits. These opaque predicates obfuscate classical control flow in hybrid quantum-classical systems. The idea is to use a pair of entangled qubits, one at compile-time and one in the compiled code at runtime to create opaque predicates. We make use of the CHSH game (John Clauser, Michael Horne, Abner Shimony, and Richard Holt) to get consensus about the value of a qubit at runtime, whose value can be predicted at compile time with high probability due to quantum properties. The paper discusses designing opaque predicate that relies on the quantum behavior of the entangled qubits and quantum measurements. The obfuscation produced by this technique maintain only a semantic accuracy of 85.35% when one entangled pair of qubits are used. However, we show that the accuracy can be improved to 100% by introducing additional entangled qubit pairs.

关键词： Quantum Obfuscation Quantum Computing Quantum security

来源：评论

学校读者我要写书评

暂无评论

The Cost of OSCORE and EDHOC for Constrained Devices 21

The Cost of OSCORE and EDHOC for Constrained Devices

引用

11th acm conference on data and application security and privacy (CODASPY)

作者： Hristozov, Stefan Huber, Manuel Xu, Lei Fietz, Jaro Liess, Marco Sigl, Georg Fraunhofer AISEC Garching Germany Microsoft Vancouver BC Canada Tech Univ Munich Munich Germany

ISBN: (纸本)9781450381437

Many modern IoT applications rely on the Constrained application Protocol (CoAP). Recently, the Internet Engineering Task Force (IETF) proposed two novel protocols for securing it. These are: 1) Object security for Constrained RESTful Environments (OSCORE) providing authenticated encryption for the CoAP's payload data and 2) Ephemeral Diffie-Hellman Over COSE (EDHOC) providing the symmetric session keys required for OSCORE. In this paper, we present the design of four firmware libraries for these protocols which are especially targeted for constrained microcontrollers and their detailed evaluation. More precisely, we present the design of mu OSCORE and mu EDHOC libraries for regular microcontrollers and mu OSCORE-TEE and mu EDHOC-TEE libraries for microcontrollers with a Trusted Execution Environment (TEE), such as microcontrollers featuring ARM TrustZone-M. Our firmware design for the latter class of devices concerns the fact that attackers may exploit common software vulnerabilities, e.g., buffer overflows in the protocol logic, OS or application to compromise the protocol security. We present an evaluation of our implementations in terms of RAM/FLASH requirements and execution speed on a broad range of microcontrollers. Our implementations are available as open-source software.

关键词： IoT CoAP security IETF OSCORE EDHOC

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：