Filters








4,946 Hits in 2.3 sec

Auditing Boolean attributes

Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan
2000 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00  
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensitive information is Boolean  ...  Principles and techniques developed for the security of statistical databases in the case of continuous attributes do not apply here.  ...  Evidently, Boolean attributes make the auditing problem much more tricky.  ... 
doi:10.1145/335168.335210 dblp:conf/pods/KleinbergPR00 fatcat:73oj2png3jfjnnrq7ra7viuq4q

Auditing Boolean attributes

Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan
2003 Journal of computer and system sciences (Print)  
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensitive information is Boolean  ...  Principles and techniques developed for the security of statistical databases in the case of continuous attributes do not apply here.  ...  Evidently, Boolean attributes make the auditing problem much more tricky.  ... 
doi:10.1016/s0022-0000(02)00036-3 fatcat:xqxhd5ooufgjjpkrbdckgrrmhe

Computational complexity of auditing finite attributes in statistical databases

Peter Jonsson, Andrei Krokhin
2008 Journal of computer and system sciences (Print)  
We study the computational complexity of auditing finite attributes in databases allowing statistical queries.  ...  Given a database that supports statistical queries, the auditing problem is to check whether an attribute can be completely determined or not from a given set of statistical information.  ...  To exemplify the use of our results we study the auditing problem for a number of statistical queries (such as max, mean and median), and we completely classify the problem of auditing Boolean attributes  ... 
doi:10.1016/j.jcss.2008.02.002 fatcat:6zhbwhihebcpxgbi2ylcnel4vu

Auditing a Database under Retention Restrictions

Wentian Lu, Gerome Miklau
2009 Proceedings / International Conference on Data Engineering  
Our framework includes a historical data model that supports flexible audit queries, along with a language for retention policies that hide individual attribute values or remove entire tuples from history  ...  Under retention policies, the audit history is partially incomplete. We formalize the meaning of audit queries on the protected history, which can include imprecise results.  ...  For example, our audit log L S can be joined with T S on the ttime attribute.  ... 
doi:10.1109/icde.2009.125 dblp:conf/icde/LuM09 fatcat:mxyrpvwly5dcxk6mnw5sfpwlnq

A Survey of Query Auditing Techniques for Data Privacy [chapter]

Shubha U. Nabar, Krishnaram Kenthapadi, Nina Mishra, Rajeev Motwani
2008 Privacy-Preserving Data Mining  
The auditing problem has also been examined when the private attribute is boolean. Surprisingly, full-disclosure auditing of sum queries over boolean data is coNP-hard.  ...  [8] considers auditing subcube queries, [19] considers the case of auditing average and median queries, while [12] considers the case when the private attribute is boolean.  ... 
doi:10.1007/978-0-387-70992-5_17 dblp:series/ads/NabarKMM08 fatcat:677t6xsq6fhttdae4gupf55h3e

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries [chapter]

Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2005 Lecture Notes in Computer Science  
We derive a dichotomy theorem for this audit problem that sheds more light on audit applicability within database systems.  ...  We study the Boolean conjunctive queries under a more detailed scope, where we investigate their counting problem by means of the algebraic approach through Galois theory, taking advantage of Post's lattice  ...  This is a generalization of the audit problem for Boolean attributes defined in [KPR03] (see also [KJ03] ), which is particularly interesting in databases supporting statistical queries.  ... 
doi:10.1007/11527695_3 fatcat:pc7kel2r45ef3ketqmeq7dlkhi

Auditing Interval-Based Inference [chapter]

Yingjiu Li, Lingyu Wang, X. Sean Wang, Sushil Jajodia
2002 Lecture Notes in Computer Science  
To further examine the practicability of auditing interval-based inference, we classify various auditing methods into three categories: exact auditing, optimistic auditing, and pessimistic auditing.  ...  Compared with auditing exact inference that is traditionally studied, auditing interval-based inference is more complicated. Existing auditing methods such as audit expert do not apply to this case.  ...  [20] recently proved that auditing Boolean attributes is a NP-hard problem.  ... 
doi:10.1007/3-540-47961-9_38 fatcat:gisrg76txjhadkybxc67riwj6y

D3.4: Cooperation Incentives And Trust Management Specification And Refined Software Report

Carlos Ballester
2012 Zenodo  
Compute audit string.  ...  Compute audit string.  ... 
doi:10.5281/zenodo.33125 fatcat:7f7k7hgsmne4fp3otbdlsw25ym

Page 10250 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
Boolean attributes.  ...  is Boolean.  ... 

Corporate governance in India: A systematic review and synthesis for future research

Faozi A. Almaqtari, Hamood Mohd. Al-Hattami, Khalid M. E. Al-Nuzaili, Mohammed A. Al-Bukhrani, Collins G. Ntim
2020 Cogent Business & Management  
The results indicated that 151 studies investigated the board of directors' issues, 90 studies analyzed ownership structure, 64 studies discussed audit committee attributes, and 11 articles studied audit  ...  The results provided that among corporate governance issues, board and audit committee independence, foreign and institutional ownership have the highest and majority focus of research in India.  ...  , 64 studies are discussed audit committee attributes and 11 articles studied audit quality by Big-Four audit companies see (Figure 3 ).  ... 
doi:10.1080/23311975.2020.1803579 fatcat:ra62v55iavgyritzja55i7m66e

Context-based Profiling for Anomaly Intrusion Detection with Diagnosis

Benferhat Salem, Tabia Karim
2008 2008 Third International Conference on Availability, Reliability and Security  
for anomaly intrusion detection with diagnosis 6 Normal profile Context-based profiling for anomaly intrusion detection with diagnosis 7 Computing local anomaly scores Numeric features Boolean  ...  New/rare/deviating values cause utmost deviations => anomalies Context-based profiling for anomaly intrusion detection with diagnosis 8 Aggregating local anomaly scores Sum of individual attributes  ... 
doi:10.1109/ares.2008.150 dblp:conf/IEEEares/BenferhatT08 fatcat:eyoeadhydreelarfvgxlm2cpji

From IHE Audit Trails to XES Event Logs Facilitating Process Mining

Ferdinand Paster, Emmanuel Helm
2015 Studies in Health Technology and Informatics  
Using the standardized audit trails provides the ability to apply these methods to all IHE based information systems.  ...  The following approach presents how audit trails collected by the means of ATNA can be transformed to enable process mining.  ...  Each object can contain an arbitrary set of strongly typed attributes, e.g. String, Boolean, Timestamp, etc. To add semantics to these data types, XES defines the concept of extensions.  ... 
pmid:25991098 fatcat:jrceien67fd4jj3erusrahpypa

Releasing Private Contingency Tables

Shubha U. Nabar, Nina Mishra
2010 Journal of Privacy and Confidentiality  
Using this framework we build a complete cell suppression solution for the special case of boolean private attributes. We study both theoretically and experimentally the utility of our approach.  ...  Along the way, we demonstrate a connection to the query auditing problem in statistical databases and make a foundational contribution to this problem as well.  ...  Special Case: Boolean Private Attributes With this general framework in hand, we now focus on the special case of Boolean private attributes, where each X k is either 1 or 0.  ... 
doi:10.29012/jpc.v2i1.586 fatcat:vo25wokzebhhzfh6cbwfnmhjru

Simulatable auditing

Krishnaram Kenthapadi, Nina Mishra, Kobbi Nissim
2005 Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05  
We uncover the fundamental issue that solutions to the offline auditing problem cannot be directly used to solve the online auditing problem since query denials may leak information.  ...  We demonstrate that sum queries can be audited in a simulatable fashion under this privacy definition.  ...  The same attack works also for the (tractable) approximate auditing version of Boolean auditing in [17] .  ... 
doi:10.1145/1065167.1065183 dblp:conf/pods/KenthapadiMN05 fatcat:a42kyvcczzd73lqpjfobyihedi

Auditing a database under retention policies

Wentian Lu, Gerome Miklau, Neil Immerman
2012 The VLDB journal  
Our framework includes an historical data model that supports flexible audit queries, along with a language for retention policies that can hide individual attribute values or remove entire tuples from  ...  Under retention policies, the audit history is partially incomplete. Thus, audit queries on the protected history can include imprecise results.  ...  For example, our audit log L S can be joined with T S on the ttime attribute.  ... 
doi:10.1007/s00778-012-0282-x fatcat:l2dzrnf6a5hrrkczrgccvkmenm
« Previous Showing results 1 — 15 out of 4,946 results