A presentation by Ted Dunning of MapR on why Streaming Matters made to the Hadoop User Group (HUG) Ireland at Hadoop Summit on April 12th 2016. This presentation covers streaming and why it is so important in any big data solution
A presentation by Ted Dunning of MapR on why Streaming Matters made to the Hadoop User Group (HUG) Ireland at Hadoop Summit on April 12th 2016. This presentation covers streaming and why it is so important in any big data solution
We are a renowned firm engaged in importing and distributing Machines & Machine Tool Accessories. Available in various technical specifications, the products we offer are widely appreciated for their optimum performance and sturdy construction.
I Laboratori di Urbanistica Partecipata a Potenza: sperimentazione di tecnich...Lucia Tilio
I Laboratori di Urbanistica Partecipata a Potenza: sperimentazione di tecniche e strumenti, presented with Viviana Lanza @INPUT 2010, Settembre 2010, Università degli Studi della Basilicata
Work by Lucia Tilio, Viviana Lanza, Piergiuseppe Pontrandolfi
Gene Selection Based on Rough Set Applications of Rough Set on Computational ...ijcoa
Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient’s medical record); on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting Alice and Bob know the contents of the tuple and the database, respectively. In this paper, we propose two protocols solving this problem on suppression-based and generalization-based k-anonymous and confidential databases. The protocols rely on well-known cryptographic assumptions, and we provide theoretical analyses to proof their soundness and experimental results to illustrate their efficiency.
Remix: On-demand Live Randomization (Fine-grained live ASLR during runtime)Yue Chen
Fine-grained live ASLR (address space layout randomization) during runtime, periodically or with random time intervals.
This can significantly leverage the bar of code reuse attack, like return-oriented programming (ROP).
In case of information leak, sine it is runtime dynamic ASLR, the memory layout can be changed.
keywords for search: control-flow integrity, CFI, memory corruption, Oakland, IEEE S&P, CCS, USENIX Security, NDSS, CODASPY, memory bugs, memory error, buffer overflow, crash, use after free, double free, ptrace
We are a renowned firm engaged in importing and distributing Machines & Machine Tool Accessories. Available in various technical specifications, the products we offer are widely appreciated for their optimum performance and sturdy construction.
I Laboratori di Urbanistica Partecipata a Potenza: sperimentazione di tecnich...Lucia Tilio
I Laboratori di Urbanistica Partecipata a Potenza: sperimentazione di tecniche e strumenti, presented with Viviana Lanza @INPUT 2010, Settembre 2010, Università degli Studi della Basilicata
Work by Lucia Tilio, Viviana Lanza, Piergiuseppe Pontrandolfi
Gene Selection Based on Rough Set Applications of Rough Set on Computational ...ijcoa
Suppose Alice owns a k-anonymous database and needs to determine whether her database, when inserted with a tuple owned by Bob, is still k-anonymous. Also, suppose that access to the database is strictly controlled, because for example data are used for certain experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob (e.g., a patient’s medical record); on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus, the problem is to check whether the database inserted with the tuple is still k-anonymous, without letting Alice and Bob know the contents of the tuple and the database, respectively. In this paper, we propose two protocols solving this problem on suppression-based and generalization-based k-anonymous and confidential databases. The protocols rely on well-known cryptographic assumptions, and we provide theoretical analyses to proof their soundness and experimental results to illustrate their efficiency.
Remix: On-demand Live Randomization (Fine-grained live ASLR during runtime)Yue Chen
Fine-grained live ASLR (address space layout randomization) during runtime, periodically or with random time intervals.
This can significantly leverage the bar of code reuse attack, like return-oriented programming (ROP).
In case of information leak, sine it is runtime dynamic ASLR, the memory layout can be changed.
keywords for search: control-flow integrity, CFI, memory corruption, Oakland, IEEE S&P, CCS, USENIX Security, NDSS, CODASPY, memory bugs, memory error, buffer overflow, crash, use after free, double free, ptrace
