Results 1 - 10
of
268
FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment
- IN PROCEEDINGS OF THE 5TH SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDI
, 2002
"... Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availability and reliability through randomized replicated storage; it ensures the secrecy of file contents with cry ..."
Abstract
-
Cited by 487 (13 self)
- Add to MetaCart
Farsite is a secure, scalable file system that logically functions as a centralized file server but is physically distributed among a set of untrusted computers. Farsite provides file availability and reliability through randomized replicated storage; it ensures the secrecy of file contents
Privacy, Integrity, and Incentive-Compatibility in Computations with Untrusted Parties
, 2004
"... In this dissertation, I study privacy, integrity, and incentive compatibility in computations with untrusted parties. The study of privacy and integrity belongs to the research area of secure multi-party computation, while incentive compatibility is a natural extension of the research on secure mult ..."
Abstract
- Add to MetaCart
In this dissertation, I study privacy, integrity, and incentive compatibility in computations with untrusted parties. The study of privacy and integrity belongs to the research area of secure multi-party computation, while incentive compatibility is a natural extension of the research on secure
Trustworthy Data from Untrusted Databases
"... Data are often stored at untrusted database servers. The lack of trust arises naturally when the database server is owned by a third party, as in the case of cloud computing. It also arises if the server may have been compromised, or there is a malicious insider. Ensuring the trustworthiness of data ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Data are often stored at untrusted database servers. The lack of trust arises naturally when the database server is owned by a third party, as in the case of cloud computing. It also arises if the server may have been compromised, or there is a malicious insider. Ensuring the trustworthiness
Trustworthy Data from Untrusted Databases
"... Abstract — Ensuring the trustworthiness of data retrieved from a database is of utmost importance to users. The correctness of data stored in a database is defined by the faithful execution of only valid (authorized) transactions. In this paper we address the question of whether it is necessary to t ..."
Abstract
- Add to MetaCart
the level of trust necessary in order to establish the authenticity and integrity of data at an untrusted server. Earlier work on this problem is limited to situations where there are no updates to the database, or all updates are authorized and vetted by a central trusted entity. This is an unreasonable
Shielding applications from an untrusted cloud with haven.
- In OSDI,
, 2014
"... Abstract Today's cloud computing infrastructure requires substantial trust. Cloud users rely on both the provider's staff and its globally-distributed software/hardware platform not to expose any of their private data. We introduce the notion of shielded execution, which protects the conf ..."
Abstract
-
Cited by 14 (3 self)
- Add to MetaCart
the confidentiality and integrity of a program and its data from the platform on which it runs (i.e., the cloud operator's OS, VM and firmware). Our prototype, Haven, is the first system to achieve shielded execution of unmodified legacy applications, including SQL Server and Apache, on a commodity OS (Windows
ABSTRACT Approximate XML Joins
"... XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the format through which data from multiple sources is integrated. In this paper we study the problem of integrating XML data so ..."
Abstract
- Add to MetaCart
, content has to be folded in the join operation. We quantify approximate match in structure and content using well defined notions of distance. For structure, we propose computationally inexpensive lower and upper bounds for the tree edit distance metric between two trees. We then show how the tree edit
Fairness and Load Balancing in Wireless LANs Using Association Control
"... Recent studies on operational wireless LANs (WLANs) have shown that the traffic load is often unevenly distributed among the access points (APs). Such load imbalance results in unfair bandwidth allocation among users. We argue that the load imbalance and consequent unfair bandwidth allocation can ..."
Abstract
-
Cited by 157 (3 self)
- Add to MetaCart
bandwidth allocation. As this problem is NP-hard, we devise algorithms that achieve constant-factor approximation. In particular, we present a 2-approximation algorithm for unweighted users and a 3-approximation algorithm for weighted users. In our algorithms, we first compute a fractional association
Private Editing Using Untrusted Cloud Services
"... Abstract—We present a general methodology for protecting the confidentiality and integrity of user data for a class of on-line editing applications. The key insight is that many of these applications are designed to perform most of their data-dependent computation on the client side, so it is possib ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract—We present a general methodology for protecting the confidentiality and integrity of user data for a class of on-line editing applications. The key insight is that many of these applications are designed to perform most of their data-dependent computation on the client side, so
Approximate joins for data-centric XML
- In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Society
, 2008
"... Abstract- In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an approximate join must be used. For XML data, most approximate join strategies are based on some ordered tree matc ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
Abstract- In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an approximate join must be used. For XML data, most approximate join strategies are based on some ordered tree
Abstract Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments ∗
, 2008
"... During the last years, large-scale simulations of realistic physical environments which support the interaction of multiple participants over the Internet have become increasingly available and economically significant, most notably in the computer gaming industry. Such systems, commonly called netw ..."
Abstract
- Add to MetaCart
policies to enforce semantic integrity involve intolerable network load, and are therefore not practically feasible. We present a new semantic integrity protocol based on cryptographic primitives which enables the server system to audit the local computations of the clients on demand. Our approach
Results 1 - 10
of
268