Results 51 to 60 of about 5,314 (170)
Survey of research on confidential computing
IET Communications, Volume 18, Issue 9, Page 535-556, June 2024.This paper provides a comprehensive overview of the development process of confidential computing, summarizing its current research status and issues, which focuses on the security requirements for data security and privacy protection. Abstract As the global data strategy deepens and data elements accelerate integrating and flowing more rapidly, the ...
Dengguo Feng +5 more
wiley +1 more source
Statistically-secure ORAM with $\tilde{O}(\log^2 n)$ Overhead
, 2013 We demonstrate a simple, statistically secure, ORAM with computational overhead $\tilde{O}(\log^2 n)$; previous ORAM protocols achieve only computational security (under computational assumptions) or require $\tilde{\Omega}(\log^3 n)$ overheard.
B. Pinkas +12 more
core +1 more source
A review of SDN‐enabled routing protocols for Named Data Networking
Engineering Reports, Volume 6, Issue 5, May 2024.Abstract Named Data Networking is a novel network architecture for the future internet in which data is named rather than addressed. This enables routers to forward data more efficiently based on its name, outperforming IP‐based routing. Another networking architecture that divides the control plane and the data plane is software‐defined networking ...
Sembati Yassine +2 more
wiley +1 more source
End‐to‐End Compressed Meshlet Rendering
Computer Graphics Forum, Volume 43, Issue 1, February 2024.Our approach allows us to keep unstructured triangle meshes in GPU memory in compressed form and decompress them in the mesh shader just in time for rasterization. Abstract In this paper, we study rendering of end‐to‐end compressed triangle meshes using modern GPU techniques, in particular, mesh shaders.
D. Mlakar +2 more
wiley +1 more source
Towards Practical Oblivious RAM [PDF]
, 2012 We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme.
Shi, Elaine, Song, Dawn, Stefanov, Emil
core
Low Communication‐Cost PSI Protocol for Unbalanced Two‐Party Private Sets
IET Information Security, Volume 2024, Issue 1, 2024.Two‐party private set intersection (PSI) plays a pivotal role in secure two‐party computation protocols. The communication cost in a PSI protocol is normally influenced by the sizes of the participating parties. However, for parties with unbalanced sets, the communication costs of existing protocols mainly depend on the size of the larger set, leading ...
Jingyu Ning +4 more
wiley +1 more source
DeltaTree: A Practical Locality-aware Concurrent Search Tree [PDF]
, 2013 As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality.
Anshus, Otto, Ha, Phuong, Umar, Ibrahim
core
CloudTree: A Library to Extend Cloud Services for Trees
, 2015 In this work, we propose a library that enables on a cloud the creation and management of tree data structures from a cloud client. As a proof of concept, we implement a new cloud service CloudTree.
Ji, Yanqing +3 more
core +1 more source
DR.SGX: Hardening SGX Enclaves against Cache Attacks with Data Location Randomization
, 2019 Recent research has demonstrated that Intel's SGX is vulnerable to software-based side-channel attacks. In a common attack, the adversary monitors CPU caches to infer secret-dependent data accesses patterns. Known defenses have major limitations, as they
Brasser, Ferdinand +5 more
core +1 more source
, 2014 Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.We present the first
A. Fiat +10 more
core +1 more source