標(biāo)題: Titlebook: Data and Applications Security and Privacy XXVII; 27th Annual IFIP WG Lingyu Wang,Basit Shafiq Conference proceedings 2013 IFIP Internatio [打印本頁] 作者: Forbidding 時間: 2025-3-21 19:24
書目名稱Data and Applications Security and Privacy XXVII影響因子(影響力)
書目名稱Data and Applications Security and Privacy XXVII影響因子(影響力)學(xué)科排名
書目名稱Data and Applications Security and Privacy XXVII網(wǎng)絡(luò)公開度
書目名稱Data and Applications Security and Privacy XXVII網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data and Applications Security and Privacy XXVII被引頻次
書目名稱Data and Applications Security and Privacy XXVII被引頻次學(xué)科排名
書目名稱Data and Applications Security and Privacy XXVII年度引用
書目名稱Data and Applications Security and Privacy XXVII年度引用學(xué)科排名
書目名稱Data and Applications Security and Privacy XXVII讀者反饋
書目名稱Data and Applications Security and Privacy XXVII讀者反饋學(xué)科排名
作者: ERUPT 時間: 2025-3-21 20:35
https://doi.org/10.1007/978-3-319-24177-7edly and then proved to be confidentiality preserving, even if an attacker employs some restricted but nevertheless versatile class of a priori knowledge to draw inferences. Finally, a method to compute a secure fragmentation schema is developed.作者: 松軟無力 時間: 2025-3-22 01:22
Darion Cassel,Yan Huang,Limin Jiarify that the server returned correct mining result? In this paper, we focus on the problem of frequent itemset mining, and propose efficient and practical probabilistic verification approaches to check whether the server has returned correct and complete frequent itemsets.作者: 控制 時間: 2025-3-22 05:28
Kangjie Lu,Aditya Pakki,Qiushi Wuinto the definition of privacy-preserving drawer size standard for the biometric setbase. We also empirically evaluate the system reliability of the prototype setbase for the purpose of studying the trade-off values between the level of privacy protection and the level of system security.作者: seroma 時間: 2025-3-22 12:46
Florian Kerschbaum,Hoon Wei Limze domain knowledge in order to mitigate the effect of perturbation error. Evaluations with simulated traffic data show our solutions outperform existing methods in both utility and computation efficiency, enabling real-time data sharing with strong privacy guarantee.作者: GNAW 時間: 2025-3-22 16:56
Jun Zhou,Zhenfu Cao,Xiaolei Dongthe disk and are invisible by the file system. When the cloud providers share the dedicated disk with other users, such misuses can be detected since the shadow data will be overwritten and become irretrievable. We describe the theoretical framework of . and show experimentally that . works well in practice.作者: GNAW 時間: 2025-3-22 20:37 作者: 不可救藥 時間: 2025-3-23 00:55 作者: 胰島素 時間: 2025-3-23 01:49 作者: Entirety 時間: 2025-3-23 09:33 作者: incubus 時間: 2025-3-23 12:35 作者: gout109 時間: 2025-3-23 15:33
A Model for Trust-Based Access Control and Delegation in Mobile Cloudsaccess control model with delegation for providing fine-grained access control. Our model incorporates the notion of trust in the Role-Based Access Control (RBAC) model and also formalizes the concept of trustworthy delegation.作者: AWRY 時間: 2025-3-23 19:32
Database Fragmentation with Encryption: Under Which Semantic Constraints and A Priori Knowledge Can edly and then proved to be confidentiality preserving, even if an attacker employs some restricted but nevertheless versatile class of a priori knowledge to draw inferences. Finally, a method to compute a secure fragmentation schema is developed.作者: 剛開始 時間: 2025-3-23 22:38
Result Integrity Verification of Outsourced Frequent Itemset Miningrify that the server returned correct mining result? In this paper, we focus on the problem of frequent itemset mining, and propose efficient and practical probabilistic verification approaches to check whether the server has returned correct and complete frequent itemsets.作者: LUMEN 時間: 2025-3-24 04:16 作者: deciduous 時間: 2025-3-24 07:26 作者: CULP 時間: 2025-3-24 13:41 作者: Entropion 時間: 2025-3-24 15:37 作者: 壟斷 時間: 2025-3-24 22:17
Arithmetic Garbling from Bilinear Maps provide decision makers with the necessary decision support. The approach comes with the necessary modeling support, a calculus for reasoning about the countermeasure cost and effect, as well as means for visualization of the results to aid decision makers.作者: Proponent 時間: 2025-3-25 00:31
Conference proceedings 20132013, held in Newark, NJ, USA in July 2013. The 16 revised full and 6 short papers presented were carefully reviewed and selected from 45 submissions. The papers are organized in topical sections on privacy, access control, cloud computing, data outsourcing, and mobile computing.作者: 南極 時間: 2025-3-25 06:06 作者: Genteel 時間: 2025-3-25 10:14 作者: refraction 時間: 2025-3-25 12:29
https://doi.org/10.1007/978-3-319-45744-4on related to Helicobactor Pylori infection and stomach cancer are separately collected, the protocol demonstrates that a ..-test can be performed without disclosing the contents of the two confidential databases.作者: liposuction 時間: 2025-3-25 19:51
Extending Loose Associations to Multiple Fragmentsw the publication of multiple loose associations between pairs of fragments of a generic fragmentation can potentially expose sensitive associations. We then describe an approach for supporting the more general case of publishing a loose association among an arbitrary set of fragments.作者: Nebulizer 時間: 2025-3-25 21:53 作者: Nefarious 時間: 2025-3-26 00:33 作者: 譏笑 時間: 2025-3-26 04:44
Hypervisor Event Logs as a Source of Consistent Virtual Machine Evidence for Forensic Cloud Investigse virtual tenant spaces were maliciously violated by other tenants. It presents the design, application and limitations of a software prototype called the Virtual Machine (VM) Log Auditor that helps in detecting inconsistencies within the activity timelines for a VM history. A discussion on modeling a consistent approach is also provided.作者: 橫條 時間: 2025-3-26 08:44 作者: 擦試不掉 時間: 2025-3-26 15:02 作者: 增強 時間: 2025-3-26 18:03 作者: 偉大 時間: 2025-3-26 23:19
Database Fragmentation with Encryption: Under Which Semantic Constraints and A Priori Knowledge Can g approach splits data among two supposedly mutually isolated servers by means of fragmentation and encryption. This approach is modelled logic-orientedly and then proved to be confidentiality preserving, even if an attacker employs some restricted but nevertheless versatile class of a priori knowle作者: monologue 時間: 2025-3-27 02:17 作者: Coma704 時間: 2025-3-27 07:27
Policy Analysis for Administrative Role Based Access Control without Separate Administration a generalized approach to access control and is well recognized for its many advantages in managing authorization policies..This paper considers user-role reachability analysis of administrative role based access control (ARBAC), which defines administrative roles and specifies how members of each 作者: 是突襲 時間: 2025-3-27 12:22 作者: 平 時間: 2025-3-27 15:41 作者: 阻礙 時間: 2025-3-27 18:52
Hypervisor Event Logs as a Source of Consistent Virtual Machine Evidence for Forensic Cloud Investigand privacy concerns of this infrastructure arising from the large co-location of tenants are, however, significant and pose considerable challenges in its widespread deployment. The current work addresses one aspect of the security problem by facilitating forensic investigations to determine if the作者: condone 時間: 2025-3-28 01:17
: Verification of Dedicated Cloud Storageatory control. To address these concerns, cloud providers are starting to offer hardware resources dedicated to a single user. Cloud users have to pay more for such dedicated tenancy; however, they may not be able to detect the unexpected misuse of their dedicated storage due to the abstraction laye作者: Eosinophils 時間: 2025-3-28 03:33 作者: WAG 時間: 2025-3-28 06:55
Bloom Filter Bootstrap: Privacy-Preserving Estimation of the Size of an Intersectionf two Bloom filters (BFs) of the given sets, the proposed scheme applies Bayesian estimation under assumption of beta distribution for an a priori probability of the size to be estimated. The BF retains the communication complexity and the Bayesian estimation improves the estimation accuracy..An pos作者: GEAR 時間: 2025-3-28 13:34 作者: 能量守恒 時間: 2025-3-28 14:44 作者: 人充滿活力 時間: 2025-3-28 22:06
Optimal Re-encryption Strategy for Joins in Encrypted Databaseshat column that will result in the minimum number of re-encryptions even under an unknown schedule of joins. Naive strategies may perform too many or even infinitely many re-encryptions. We provide two strategies that allow for a much better performance. In particular the asymptotic behavior is .(..作者: 施魔法 時間: 2025-3-29 02:24
Access Control and Query Verification for Untrusted Databasesowner lacks direct control over the hardware and the software running at the server, there is a need to ensure that the data are not read or modified by unauthorized entities. Even though a simple encryption of the data before transferring it to the server ensures that only authorized entities who h作者: 宣誓書 時間: 2025-3-29 03:39 作者: JUST 時間: 2025-3-29 09:21
A Model for Trust-Based Access Control and Delegation in Mobile Cloudsssing subjects may dynamically change, resources requiring protection may be created or modified, and a subject’s access requirements to resources may change during the course of the application execution. Cloud tenants may need to acquire permissions from different administrative domains based on t作者: CLIFF 時間: 2025-3-29 11:48 作者: foodstuff 時間: 2025-3-29 16:14 作者: BRIBE 時間: 2025-3-29 19:53 作者: 杠桿 時間: 2025-3-30 00:21 作者: Customary 時間: 2025-3-30 06:11
Towards User-Oriented RBAC Modelnstruct the given permission assignments, and the other is user-oriented approximate RMP, which tolerates a certain amount of deviation from the complete reconstruction. The extra sparseness constraint poses a great challenge to role mining, which in general is already a hard problem. We examine som作者: 莊嚴 時間: 2025-3-30 08:36
Fair Private Set Intersection with a Semi-trusted Arbitertocol. The arbiter can resolve disputes without knowing any private information belongs to the two parties. This feature is appealing for a PSI protocol in which privacy may be of ultimate importance.作者: 人類 時間: 2025-3-30 15:34
Practical Immutable Signature Bouquets (PISB) for Authentication and Integrity in Outsourced Databas . ?schemes are very simple, non-interactive, and computation/communication efficient. Our generic scheme can be constructed from any aggregate signature coupled with a standard signature. Hence, it can flexibly provide performance trade-offs for various types of applications. Our specific scheme is作者: Mortal 時間: 2025-3-30 20:05
Access Control and Query Verification for Untrusted Databases the data. Our solution ensures that a particular data item is read and modified by only those entities who have been authorized by the data owner to access that data item. It provides privacy against malicious entities that somehow get access to the data stored at the server. Our solutions allow ea作者: 不透明性 時間: 2025-3-31 00:00
Liang Feng Zhang,Reihaneh Safavi-Naini of ARBAC rules and users considered during analysis. We also present a number of parallel algorithms that speed up the analysis on multi-core systems. The experimental results show that our techniques significantly reduce the analysis time, making it practical to analyze ARBAC without separate admi作者: synovitis 時間: 2025-3-31 03:53 作者: 撤退 時間: 2025-3-31 06:06 作者: 偉大 時間: 2025-3-31 10:10 作者: 谷物 時間: 2025-3-31 14:14
Computer Security – ESORICS 2016 the data. Our solution ensures that a particular data item is read and modified by only those entities who have been authorized by the data owner to access that data item. It provides privacy against malicious entities that somehow get access to the data stored at the server. Our solutions allow ea作者: 出處 時間: 2025-3-31 21:31
Using Safety Constraint for Transactional Dataset Anonymizationiple to ensure that correlated values are grouped together in unique partitions that enforce .-diversity at the level of individuals. We conduct a set of experiments to evaluate privacy breach and the anonymization cost of safe grouping.作者: 駭人 時間: 2025-4-1 00:31 作者: Cosmopolitan 時間: 2025-4-1 04:02
Data and Applications Security and Privacy XXVII978-3-642-39256-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Arrhythmia 時間: 2025-4-1 09:15 作者: Permanent 時間: 2025-4-1 12:08
Computer Security -- ESORICS 2015rs. To enrich the utility of the published fragments, a recent approach has put forward the idea of complementing them with ., a sanitized form of the sensitive associations broken by fragmentation. The original proposal considers fragmentations composed of two fragments only, and supports the defin作者: craving 時間: 2025-4-1 14:46
https://doi.org/10.1007/978-3-319-24177-7g approach splits data among two supposedly mutually isolated servers by means of fragmentation and encryption. This approach is modelled logic-orientedly and then proved to be confidentiality preserving, even if an attacker employs some restricted but nevertheless versatile class of a priori knowle作者: 我正派 時間: 2025-4-1 19:44
Florian Kerschbaum,Hoon Wei Lim end, private user data must be aggregated and shared continuously over time with data privacy guarantee. However, releasing time series data with standard differential privacy mechanism can lead to high perturbation error due to the correlation between time stamps. In addition, data sparsity in the
