標(biāo)題: Titlebook: Data and Applications Security and Privacy XXIV; 24th Annual IFIP WG Sara Foresti,Sushil Jajodia Conference proceedings 2010 IFIP Internat [打印本頁] 作者: Assert 時(shí)間: 2025-3-21 18:17
書目名稱Data and Applications Security and Privacy XXIV影響因子(影響力)
書目名稱Data and Applications Security and Privacy XXIV影響因子(影響力)學(xué)科排名
書目名稱Data and Applications Security and Privacy XXIV網(wǎng)絡(luò)公開度
書目名稱Data and Applications Security and Privacy XXIV網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Data and Applications Security and Privacy XXIV被引頻次
書目名稱Data and Applications Security and Privacy XXIV被引頻次學(xué)科排名
書目名稱Data and Applications Security and Privacy XXIV年度引用
書目名稱Data and Applications Security and Privacy XXIV年度引用學(xué)科排名
書目名稱Data and Applications Security and Privacy XXIV讀者反饋
書目名稱Data and Applications Security and Privacy XXIV讀者反饋學(xué)科排名
作者: ordain 時(shí)間: 2025-3-21 22:59 作者: 不來 時(shí)間: 2025-3-22 00:57
Mining Likely Properties of Access Control Policies via Association Rule Miningules in the policy. To show the effectiveness of our approach, we conduct evaluation on four XACML policies. Our evaluation results show that our approach achieves more than 30% higher fault-detection capability than that of an existing approach. Our approach includes additional techniques such as b作者: Postulate 時(shí)間: 2025-3-22 05:57
Enforcing Request Integrity in Web Applications—access control is not built into the application, but based on OS level policy settings. We evaluated . using nine open source web applications. Our results indicate that our approach is effective against request integrity attacks and incurs negligible overhead.作者: 身體萌芽 時(shí)間: 2025-3-22 11:27
Conference proceedings 19811st editionalizes .PIR and .-Anonymity in that the bounding box can include as much as all the data on the server or as little as just . data items. The efficiency of .PIR compared to .PIR and the effectiveness of .PIR compared to .-Anonymity are verified in extensive experimental evaluations.作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-22 14:01
https://doi.org/10.1007/978-3-662-68313-2y, we define a formal model of noise and experimentally evaluate the previously proposed algorithm for .-approx RMP against its robustness to noise. Essentially, this would allow one to come up with strategies to minimize the effect of noise while discovering roles. Our experiments on real data indi作者: 亞當(dāng)心理陰影 時(shí)間: 2025-3-22 17:19 作者: 真繁榮 時(shí)間: 2025-3-22 21:42
https://doi.org/10.1007/978-3-319-75214-3—access control is not built into the application, but based on OS level policy settings. We evaluated . using nine open source web applications. Our results indicate that our approach is effective against request integrity attacks and incurs negligible overhead.作者: Pigeon 時(shí)間: 2025-3-23 04:33
Generalizing PIR for Practical Private Retrieval of Public Data Private Information Retrieval (.PIR) achieves complete privacy for clients, but is deemed impractical since it involves expensive computation on all the data on the server. Besides, it is inflexible if the server wants to charge the client based on the service data that is exposed. .-Anonymity, on 作者: LIKEN 時(shí)間: 2025-3-23 09:34 作者: Interferons 時(shí)間: 2025-3-23 13:02
Understanding Privacy Risk of Publishing Decision Treesential risk to privacy. However, there is not much investigation on the privacy consequence of publishing decision trees. To understand this problem, we need to quantitatively measure privacy risk..Based on the well-established maximum entropy theory, we have developed a systematic method to quantif作者: 肉體 時(shí)間: 2025-3-23 15:14
Secure Outsourcing of DNA Searching via Finite Automatarvice provider has a pattern that corresponds to a genetic test. Error-resilient searching is achieved by representing the pattern as a finite automaton and evaluating it on the DNA sequence, where privacy of both the pattern and the DNA sequence must be preserved. Interactive solutions to this prob作者: fledged 時(shí)間: 2025-3-23 21:09 作者: 抵消 時(shí)間: 2025-3-24 00:53
Role Mining in the Presence of Noiseent years. The role mining problem (RMP) and several of its variants have been proposed in the literature. While the basic RMP discovers roles that exactly represent the UPA, the . variants, such as the .-approx RMP and MinNoise-RMP, allow for some inexactness in the sense that the discovered roles 作者: 相同 時(shí)間: 2025-3-24 03:34
Distributed and Secure Access Control in P2P Databases demand adequate mechanisms to restrict the access to authorized parties. In this paper, we study a distributed access control model, where data items are stored, queried and authenticated in a totally decentralized fashion. Our contribution focuses on the design of a comprehensive framework for acc作者: Integrate 時(shí)間: 2025-3-24 08:12
Constructing Key Assignment Schemes from Chain Partitions first contribution is to improve an existing cryptographic access control mechanism for scalable multimedia formats. We then show how our methods can be applied to a chain partition to develop alternative mechanisms for scalable multimedia formats and how these methods can themselves be extended to作者: gustation 時(shí)間: 2025-3-24 13:59
Query: SPARQL Query Rewriting to Enforce Data Confidentialitysive language to query RDF databases. SPARQL has been defined to easily localize and extract data in an RDF graph. Since confidential data are accessed, SPARQL queries must be filtered so that only authorized data are returned with respect to some confidentiality policy. In this paper, we model a co作者: FLAIL 時(shí)間: 2025-3-24 18:34 作者: 改變立場 時(shí)間: 2025-3-24 21:26
Query Racing: Fast Completeness Certification of Query Resultstion is the concept of “Query Race”: we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based condition作者: In-Situ 時(shí)間: 2025-3-25 00:45 作者: 征服 時(shí)間: 2025-3-25 03:29
Scalable and Efficient Reasoning for Enforcing Role-Based Access Controlaking critical decisions. Thus, there is a need for a scalable access control model that simplifies the management of security policies and handles the heterogeneity inherent in the information system. This paper proposes an ontology-based distributed solution to this problem, with the benefits of b作者: Lipoprotein(A) 時(shí)間: 2025-3-25 10:17
Enforcing Request Integrity in Web Applications(RI) attacks, wherein an attacker forces an application into processing an unintended request sequence. Cross-site-request forgeries (CSRF) and workflow violations are two classes of RI attacks. Enforcing the intended request sequences is essential for ensuring the integrity of the application. We d作者: 辯論的終結(jié) 時(shí)間: 2025-3-25 12:02 作者: 作嘔 時(shí)間: 2025-3-25 18:38
Modelling Dynamic Trust with Property Based Attestation in Trusted Platformsstation, an extension of binary attestation enables more meaningful attestation by abstracting low level binary values to high level security properties or functions of platforms. We believe that despite having trusted processes for integrity measurement, binary and property based attestation may st作者: KIN 時(shí)間: 2025-3-25 21:09 作者: 比喻好 時(shí)間: 2025-3-26 02:33
An Access Control Model for Web Databases information, these systems are highly interesting to attackers and special care needs to be taken to prevent them from malicious accesses. In this paper, we propose (..), an extension of the NIST RBAC (Role-Based Access Control) standard with the notions of application, application profile and sub-作者: 衰老 時(shí)間: 2025-3-26 05:44 作者: 我不死扛 時(shí)間: 2025-3-26 09:37
How Fast is the Fourier Transform?tion may be specified. Our concern is with developing the formal foundations of our conceptual model. For both the specific access control models and privacy policies, which may be defined in terms of the meta-model, we adopt a combining approach: we combine access control concepts to form the meta-作者: 六個(gè)才偏離 時(shí)間: 2025-3-26 14:36
https://doi.org/10.1007/978-1-4613-9464-8ential risk to privacy. However, there is not much investigation on the privacy consequence of publishing decision trees. To understand this problem, we need to quantitatively measure privacy risk..Based on the well-established maximum entropy theory, we have developed a systematic method to quantif作者: 意外的成功 時(shí)間: 2025-3-26 20:20
Statistical Theory and the Computerrvice provider has a pattern that corresponds to a genetic test. Error-resilient searching is achieved by representing the pattern as a finite automaton and evaluating it on the DNA sequence, where privacy of both the pattern and the DNA sequence must be preserved. Interactive solutions to this prob作者: 該得 時(shí)間: 2025-3-26 22:02 作者: Aqueous-Humor 時(shí)間: 2025-3-27 03:28
https://doi.org/10.1007/978-3-662-68313-2ent years. The role mining problem (RMP) and several of its variants have been proposed in the literature. While the basic RMP discovers roles that exactly represent the UPA, the . variants, such as the .-approx RMP and MinNoise-RMP, allow for some inexactness in the sense that the discovered roles 作者: 發(fā)展 時(shí)間: 2025-3-27 06:46
https://doi.org/10.1007/978-3-662-68313-2 demand adequate mechanisms to restrict the access to authorized parties. In this paper, we study a distributed access control model, where data items are stored, queried and authenticated in a totally decentralized fashion. Our contribution focuses on the design of a comprehensive framework for acc作者: Harpoon 時(shí)間: 2025-3-27 11:14 作者: ANNUL 時(shí)間: 2025-3-27 15:23 作者: 斑駁 時(shí)間: 2025-3-27 19:18 作者: Ceramic 時(shí)間: 2025-3-28 01:03
https://doi.org/10.1007/978-3-662-68313-2tion is the concept of “Query Race”: we split up a general query into several single attribute queries, and exploit concurrency and speed to bind the complexity to the fastest of them. Our method supports selection queries with general composition of conjunctive and disjunctive order-based condition作者: 危險(xiǎn) 時(shí)間: 2025-3-28 03:44
https://doi.org/10.1007/978-3-662-68313-2icies. To ensure the correctness of access control policies, policy authors conduct policy verification to check whether certain properties are satisfied by a policy. However, these properties are often not written in practice. To facilitate property verification, we present an approach that automat作者: Adjourn 時(shí)間: 2025-3-28 08:09
https://doi.org/10.1007/978-3-662-68313-2aking critical decisions. Thus, there is a need for a scalable access control model that simplifies the management of security policies and handles the heterogeneity inherent in the information system. This paper proposes an ontology-based distributed solution to this problem, with the benefits of b作者: Multiple 時(shí)間: 2025-3-28 12:37 作者: 圍巾 時(shí)間: 2025-3-28 16:43
María Alejandra Zangara,Cecilia Sanzudget. Security evaluation standards, such as Common Criteria and ISO/IEC 17799, cannot be used due to resource limitations, time-to-market, and other constraints. We propose an alternative time and cost effective approach for predicting the security level of a security solution using information so作者: GLIDE 時(shí)間: 2025-3-28 18:50 作者: 格子架 時(shí)間: 2025-3-29 02:40
https://doi.org/10.1007/978-3-319-75214-3oduce new and amplify existing security and privacy problems. This is especially critical in the emerging field of enterprise Mashups. Despite several contributions in the field of Mashup security the issue of protecting exchanged resources against the Mashup-providing Platform has generally been ne作者: 熱心 時(shí)間: 2025-3-29 03:26
Numeric Line: A Códimo’s Activity information, these systems are highly interesting to attackers and special care needs to be taken to prevent them from malicious accesses. In this paper, we propose (..), an extension of the NIST RBAC (Role-Based Access Control) standard with the notions of application, application profile and sub-作者: STALL 時(shí)間: 2025-3-29 11:18
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263227.jpg作者: acquisition 時(shí)間: 2025-3-29 13:18
Data and Applications Security and Privacy XXIV978-3-642-13739-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Verify 時(shí)間: 2025-3-29 18:03
https://doi.org/10.1007/978-3-662-68313-2 first contribution is to improve an existing cryptographic access control mechanism for scalable multimedia formats. We then show how our methods can be applied to a chain partition to develop alternative mechanisms for scalable multimedia formats and how these methods can themselves be extended to create a new type of key assignment scheme.作者: HACK 時(shí)間: 2025-3-29 23:06
https://doi.org/10.1007/978-3-642-13739-6Protection; RFID; access control; anonymity; authentication; automata; control; database; management; modelli作者: 基因組 時(shí)間: 2025-3-30 03:17
978-3-642-13738-9IFIP International Federation for Information Processing 2010作者: Parabola 時(shí)間: 2025-3-30 04:47 作者: Aura231 時(shí)間: 2025-3-30 11:47 作者: Additive 時(shí)間: 2025-3-30 14:46 作者: 虛構(gòu)的東西 時(shí)間: 2025-3-30 19:14
Secure Outsourcing of DNA Searching via Finite Automatalem already exist, but can be a burden on the participants. Thus, we propose techniques for secure outsourcing of finite automata evaluation to computational servers, which do not learn any information. Our techniques are applicable to any type of finite automata, but the optimizations are tailored to DNA searching.作者: 易彎曲 時(shí)間: 2025-3-30 22:43
Query: SPARQL Query Rewriting to Enforce Data Confidentialitynfidentiality policy as a set of positive and negative filters (corresponding respectively to permissions and prohibitions) that apply to SPARQL queries. We then define rewriting algorithms that transform the queries so that the results returned by transformed queries are compliant with the confidentiality policy.作者: INCUR 時(shí)間: 2025-3-31 03:23 作者: malign 時(shí)間: 2025-3-31 05:13 作者: 擁護(hù) 時(shí)間: 2025-3-31 11:37 作者: fatty-acids 時(shí)間: 2025-3-31 16:55 作者: Petechiae 時(shí)間: 2025-3-31 20:13
https://doi.org/10.1007/978-3-662-68313-2compromise the peers, the decryption keys are decomposed into pieces scattered amongst peers. We discuss the details of how to adapt distributed encryption schemes to PDMS to enforce robust and resilient access control, and demonstrate the efficiency and scalability of our approach by means of an extensive experimental study.作者: Inelasticity 時(shí)間: 2025-4-1 00:19
Distributed and Secure Access Control in P2P Databasescompromise the peers, the decryption keys are decomposed into pieces scattered amongst peers. We discuss the details of how to adapt distributed encryption schemes to PDMS to enforce robust and resilient access control, and demonstrate the efficiency and scalability of our approach by means of an extensive experimental study.作者: 競選運(yùn)動 時(shí)間: 2025-4-1 03:27 作者: 防銹 時(shí)間: 2025-4-1 08:24
