Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
306
Tor: The secondgeneration onion router,”
- in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract
-
Cited by 1229 (33 self)
- Add to MetaCart
by a symmetric key at each node (like the layers of an onion) and relayed downstream. The Onion Routing project published several design and analysis papers Perfect forward secrecy: In the original Onion Routing design, a single hostile node could record traffic and later compromise successive nodes
Detecting Privacy Violations in Database Publishing using Disjoint Queries [Extended Abstract]
"... We present a new method of detecting privacy violations in the context of database publishing. Our method defines a published view V to preserve the privacy of a secret query Q if V and Q return no tuples in common, over all possible database instances. We then establish necessary and sufficient con ..."
Abstract
- Add to MetaCart
We present a new method of detecting privacy violations in the context of database publishing. Our method defines a published view V to preserve the privacy of a secret query Q if V and Q return no tuples in common, over all possible database instances. We then establish necessary and sufficient
The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization
- HPCA-4
, 1998
"... As we look to the future, and the prospect of a billion transistors on a chip, it seems inevitable that microprocessors will exploit having multiple parallel threads. To achieve the full potential of these "single-chip multiprocessors," however, we must find a way to parallelize non-numeri ..."
Abstract
-
Cited by 256 (9 self)
- Add to MetaCart
support TLDS by augmenting its cache coherence scheme to detect dependence violations, and by using the primary data caches to buffer speculative state.
Checking for k-Anonymity Violation by Views
- In VLDB
, 2005
"... When a private relational table is published using views, secrecy or privacy may be violated. ..."
Abstract
-
Cited by 37 (2 self)
- Add to MetaCart
When a private relational table is published using views, secrecy or privacy may be violated.
Detecting privacy violations in sensitive xml databases
- In Secure Data Management (SDM’05
, 2005
"... Abstract. Privacy violations and the exposition of sensitive data to a third party may seriously damage the business of a company. Therefore, it is crucial for the company to identify that set of users that may have exposed the sensitive data. To identify that set of users is a problem, when multipl ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. Privacy violations and the exposition of sensitive data to a third party may seriously damage the business of a company. Therefore, it is crucial for the company to identify that set of users that may have exposed the sensitive data. To identify that set of users is a problem, when
Privacy-Preserving Distributed k-Anonymity
, 2005
"... k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol w ..."
Abstract
-
Cited by 27 (3 self)
- Add to MetaCart
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. This paper presents a k-anonymity protocol
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles). In: Dwork
- CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract
-
Cited by 119 (10 self)
- Add to MetaCart
been interest in "anonymous" identity-based encryption systems, where the ciphertext does not leak the identity of the recipient. In addition to their obvious privacy benefits, anonymous IBE systems can be leveraged to construct Public key Encryption with Keyword Search (PEKS) schemes
of Additive and Multiplicative Data Perturbation for Privacy Preserving Data Mining
"... Abstract- The collection of digital information by governments, corporations, and individuals has created tremendous opportunities for knowledge- and information-based decision making. Driven by mutual benefits, or by regulations that require certain data to be published, there is a demand for the e ..."
Abstract
- Add to MetaCart
for the exchange and publication of data among various parties. Data in its original form, however, typically contains sensitive information about individuals, and publishing such data will violate individual privacy. Privacy preserving data mining (PPDM) tends to transform original data, so that sensitive data
2011 IEEE Symposium on Security and Privacy
"... Abstract—TXBOX is a new system for sandboxing untrusted applications. It speculatively executes the application in a system transaction, allowing security checks to be parallelized and yielding significant performance gains for techniques such as on-access anti-virus scanning. TXBOX is not vulnerabl ..."
Abstract
- Add to MetaCart
is not vulnerable to TOCTTOU attacks and incorrect mirroring of kernel state. Furthermore, TXBOX supports automatic recovery: if a violation is detected, the sandboxed program is terminated and all of its effects on the host are rolled back. This enables effective enforcement of security policies that span multiple
Real-Time Visibility-Based Fusion of Depth Maps
- In Int. Conf. on Computer Vision and Pattern Recognition
, 2007
"... We present a viewpoint-based approach for the quick fusion of multiple stereo depth maps. Our method selects depth estimates for each pixel that minimize violations of visibility constraints and thus remove errors and inconsistencies from the depth maps to produce a consistent surface. We advocate a ..."
Abstract
-
Cited by 84 (12 self)
- Add to MetaCart
is presented first. It aims to determine the validity of a depth estimate by rendering multiple depth maps into the reference view as well as rendering the reference depth map into the other views in order to detect occlusions and freespace violations. We also present an approximate alternative formulation
Results 1 - 10
of
306
