A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Filters
Sub-linear Queries Statistical Databases: Privacy with Power
[chapter]
2005
Lecture Notes in Computer Science
We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries. ...
We call this a sub-linear queries (SuLQ) database. The assumption of sublinearity becomes reasonable as databases grow increasingly large. ...
Introduction Consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries. ...
doi:10.1007/978-3-540-30574-3_1
fatcat:cspsdr3tpnewvhd3dkpsdqmzna
Mirror Descent Based Database Privacy
[chapter]
2012
Lecture Notes in Computer Science
In this paper, we focus on the problem of private database release in the interactive setting: a trusted database curator receives queries in an online manner for which it needs to respond with accurate ...
but privacy preserving answers. ...
In the interactive setting, a database curator who owns a dataset (e.g. a hospital/bank) tries to answer queries about the dataset accurately (i.e., with small error), while preserving privacy of each ...
doi:10.1007/978-3-642-32512-0_49
fatcat:isr6orovmzbmdp74ykj7oy2rn4
Privacy-Preserving Datamining on Vertically Partitioned Databases
[chapter]
2004
Lecture Notes in Computer Science
In a recent paper Dinur and Nissim considered a statistical database in which a trusted database administrator monitors queries and introduces noise to the responses with the goal of maintaining data privacy ...
Under a rigorous definition of breach of privacy, Dinur and Nissim proved that unless the total number of queries is sub-linear in the size of the database, a substantial amount of noise is required to ...
Multi-Attribute Sub-Linear Queries (SuLQ) Databases. ...
doi:10.1007/978-3-540-28628-8_32
fatcat:flzrai2wyvfz3gu6qyaa26267q
Secure Mining of Association Rules in Databases using Distributed Database Algorithm
2018
Zenodo
We propose a protocol for secure mining of association rules in horizontally distributed databases. The current leading protocol is that of Distribute Database Algorithm. ...
Our protocol offers enhanced privacy concerning the protocol. Also it is simpler and is significantly more efficient regarding communication rounds, communication cost, and computational cost. ...
Indeed, the dot product is probably the most common sub-protocol used. As such, a lot of attention has been focused on coming up with secure protocols for computing it. ...
doi:10.5281/zenodo.1410981
fatcat:3ooj4cmwdvg53imtr3zui2rumm
OLAP and statistical databases
1997
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '97
with statistical summarizations over the dimensions of the data sets. ...
that object-oriented data models and systems should support liItroduclion Both OLAP (On-Line Analytical Processing) and Statistical Databases (SDBs) deal with multidimensional datasets, and both am concerned ...
a discussion on privacy in summary databases. ...
doi:10.1145/263661.263682
dblp:conf/pods/Shoshani97
fatcat:nnwnpitmufdazda7yjhdk3pl4y
Distributed Database Design for Mobile Geographical Applications
2000
Journal of Database Management
Although this approach is very useful, dynamic information needed in ITS is not dealt with. OO data modeling as an alternative for spatial databases was discussed by Worboys et al. ...
We usually do not think of the street network as segments of links with intersection, but more as the street as a whole. As such, the topological data model is not a natural navigable database . ...
Figure 1 : 1 An Overview of the System they may be equipped with computing units of di erent computational power. ...
doi:10.4018/jdm.2000010101
fatcat:yu2oefoiwvblvj4sy4fgn4rn2u
On real-time distributed geographical database systems
1994
Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences HICSS-94
., representation, storage and retrievM, data aggregation, and parallel processing of on-line queries in the proposed GIS-based systems axe discussed. ...
Dep~.nding on the workload of base stations, they may be equipped with computing units of dif-fe~:ent computational power. ...
However, the consistency issue is not directly dealt with in the database design. ...
doi:10.1109/hicss.1994.323481
fatcat:miaxqexsave2hc4w43bhqz3mla
Generating private synthetic databases for untrusted system evaluation
2014
2014 IEEE 30th International Conference on Data Engineering
Accuracy is achieved by generating synthetic data using a carefully selected set of statistical properties of the original data which balance privacy loss with relevance to the given query workload. ...
But such evaluation tasks rely heavily on actual data and query workloads that are often unavailable to researchers due to privacy restrictions. ...
Next we propose a novel algorithm for selecting the queries that constitute the model Q, where we must balance descriptive power with accuracy achievable under the privacy condition. ...
doi:10.1109/icde.2014.6816689
dblp:conf/icde/LuMG14
fatcat:wtvp4zcq3ng6forglvqwdpwhdu
Practical privacy
2005
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '05
We consider a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries. ...
We call this query and (slightly) noisy reply the SuLQ (Sub-Linear Queries) primitive. The assumption of sublinearity becomes reasonable as databases grow increasingly large. ...
term Sub-Lineare Queries, or SuLQ, framework. ...
doi:10.1145/1065167.1065184
dblp:conf/pods/BlumDMN05
fatcat:jl6nbcazebfadczovnk3qnhk2a
A Theory of Pricing Private Data
2014
ACM Transactions on Database Systems
Privacy mechanisms protect the owner's data while releasing to analysts noisy versions of aggregate query results. ...
Our framework adopts and extends key principles from both differential privacy and query pricing in data markets. ...
query the database, because otherwise the contract with the data owner would be breached. ...
doi:10.1145/2691190.2691191
fatcat:xpxiufrze5e33ppqkbtvz62duy
Round-Efficient Oblivious Database Manipulation
[chapter]
2011
Lecture Notes in Computer Science
Existing results in the multi-party setting mostly hold for private information retrieval [17, 5] where the database is replicated in several sites and only the secrecy of the query index i is protected ...
In this paper, we provide efficient protocols for oblivious selection, filtering and shuffle-essential tools in privacy-preserving data analysis. ...
The miners' workload is linear in the database size, which is again optimal, since each database element must be touched or otherwise information leaks about the queries. ...
doi:10.1007/978-3-642-24861-0_18
fatcat:admnnitkqrc3lfeqii7uyg7tsm
Toward Privacy in Public Databases
[chapter]
2005
Lecture Notes in Computer Science
An important contribution of this work is a definition of privacy (and privacy compromise) for statistical databases, together with a method for describing and comparing the privacy offered by specific ...
Unlike in the study of secure function evaluation, in which privacy is preserved to the extent possible given a specific functionality goal, in the census problem privacy is paramount; intuitively, things ...
We have benefited enormously from numerous conversations with many people, and are particularly grateful to Dimitris Achlioptas, Gagan Aggarwal, Jin-Yi Cai, Petros Drineas, John Dunagan, Amos Fiat, Michael ...
doi:10.1007/978-3-540-30576-7_20
fatcat:3gleraucuzd27gumfersbtms6a
Sharing Private Information Across Distributed Databases
2009
2009 Eighth IEEE International Symposium on Network Computing and Applications
Without sending or mirroring data to any trusted, centralized entity, we demonstrate how queries can be answered in a distributed manner that preserves the privacy of the original data. ...
on the tradeoff between privacy and performance. ...
Published statistics [23] [24] indicate a rough power law distribution in the size of providers and in the frequency of patient visits, so the topology took this into account. ...
doi:10.1109/nca.2009.33
dblp:conf/nca/SiegenthalerB09
fatcat:bgckhvazqvaenhrg2ivng4oucu
Revealing information while preserving privacy
2003
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '03
We model a statistical database by an n-bit string d 1 , .., d n , with a query being a subset q ⊆ [n] to be answered by i∈q d i . ...
We examine the tradeoff between privacy and usability of statistical databases. ...
Analyzing the random walk, we prove that, with extremely high probability, a sub-linear number of steps is not sufficient for reaching the confidence required for violating privacy. of Theorem 5. ...
doi:10.1145/773153.773173
dblp:conf/pods/DinurN03
fatcat:zrsvcvgp2nggnewdf4e3gjgihq
Providing Database Encryption as a Scalable Enterprise Infrastructure Service
2005
Social Science Research Network
In this paper we explore a new approach for data privacy and security in which a security administrator protecting privacy at the level of individual fields and records, and providing seamless mechanisms ...
to create, store, and securely access databases. ...
A method for common sub-expression elimination (CSE) needs to be applied to expensive user defined functions for a query. ...
doi:10.2139/ssrn.664201
fatcat:4lbiepn54zaqndcdwol2cy3qqm
« Previous
Showing results 1 — 15 out of 6,537 results