We take an important step forward in making Oblivious RAM (O-RAM) practical. We pro-pose an O-RAM construction achieving an amortized overhead of 20 ∼ 35X (for an O-RAMroughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoreticfront, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifi-cally, we partition a bi...

For 6 years adult, non-synchronized Hampshire ewes (n=2,5,8,8,9 and 12) and rams (n=6,10,12,11,11 and 9) were maintained separately and released to contiguous pastures having in common a woven-wire fence about 80m long and 1.1m high. Natural estrous cycles were monitored daily by observations of ram-seeking behavior as defined as a ewe being persistent in staying at the common fence with attent...

We define the concept of and present provably secure constructions for Anonymous RAM (AnonRAM), a novel multi-user storage primitive that offers strong privacy and integrity guarantees. AnonRAM combines privacy features of anonymous communication and oblivious RAM (ORAM) schemes, allowing it to protect, simultaneously, the privacy of content, access patterns and user’s identity, from curious se...

Few examples of individual polymer-based 3-D printed quasi-optical component types have been previously demonstrated above ca. 100 GHz. This paper presents the characterization components and complete subsystems for applications operating at G-band (140 to 220 GHz). Two low-cost consumer-level printing technologies (vat polymerization fused deposition modeling) are employed, normally associated...

ADVERTISEMENT RETURN TO ISSUEEditorialNEXTBorderless Collaboration in Materials Chemistry for an Industrial Ecosystem the Semiconductor IndustryHan-Bo-Ram Lee*Han-Bo-Ram LeeDepartment of Science and Engineering, Incheon National University, 22012, Republic Korea*Email: [email protected]More by Han-Bo-Ram Leehttps://orcid.org/0000-0002-0097-6738 Seiyon KimSeiyon KimR&D Division, SK Hynix Inc., I...

Oblivious RAM (O-RAM) is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications. This paper proposes novel O-RAM constructions that achieves poly-logarithmic worst-case cost, while consuming constant client-side storage. Our techniques for constructing Oblivious RAM are fundamentally different from previous approache...

This paper proposes an efficient architecture for the two-dimensional discrete wavelet transform (2-D DWT). The proposed architecture includes a transform module, a RAM module, and a multiplexer. In the transform module, we employ the polyphase decomposition technique and the coefficient folding technique to the decimation filters of stages 1 and 2, respectively. In comparison with other 2-D DW...

Garbled RAM, introduced by Lu and Ostrovsky (Eurocrypt 2013), provides a novel method to garble RAM (Random Access Machine) programs directly. It can be seen as a RAM analogue of Yao’s garbled circuits such that, the size of the garbled program and the time it takes to create and evaluate it, is proportional only to the running time of the RAM program, avoiding the inefficient process of first ...

This paper presents two architectures for 2-D discrete wavelet transform (DWT) and inverse DWT (IDWT). The first consists of transform module, RAM module and address sequencer. The transform module, which takes uniform and regular structure with local communication, offers many advantages, e.g. simple control flow, full hardware-utilization and low-power. The second architecture features parall...

We define the range 1 query (R1Q) problem as follows. Given a d-dimensional (d ≥ 1) input bit matrix A, preprocess A so that for any given regionR of A, one can efficiently answer queries asking ifR contains a 1 or not. We consider both orthogonal and non-orthogonal shapes for R including rectangles, axis-parallel right-triangles, certain types of polygons, and spheres. We provide space-efficie...