4,051 research outputs found

    The Melbourne Shuffle: Improving Oblivious Storage in the Cloud

    Full text link
    We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for network-based outsourcing of data

    Application of conformal mapping to diffraction and scattering problems

    Get PDF
    Integral equation method based on conformal mapping applied to scattering and diffraction problems of plane waves by infinite cylinder with arbitrary cross sectio

    Zig-zag Sort: A Simple Deterministic Data-Oblivious Sorting Algorithm Running in O(n log n) Time

    Full text link
    We describe and analyze Zig-zag Sort--a deterministic data-oblivious sorting algorithm running in O(n log n) time that is arguably simpler than previously known algorithms with similar properties, which are based on the AKS sorting network. Because it is data-oblivious and deterministic, Zig-zag Sort can be implemented as a simple O(n log n)-size sorting network, thereby providing a solution to an open problem posed by Incerpi and Sedgewick in 1985. In addition, Zig-zag Sort is a variant of Shellsort, and is, in fact, the first deterministic Shellsort variant running in O(n log n) time. The existence of such an algorithm was posed as an open problem by Plaxton et al. in 1992 and also by Sedgewick in 1996. More relevant for today, however, is the fact that the existence of a simple data-oblivious deterministic sorting algorithm running in O(n log n) time simplifies the inner-loop computation in several proposed oblivious-RAM simulation methods (which utilize AKS sorting networks), and this, in turn, implies simplified mechanisms for privacy-preserving data outsourcing in several cloud computing applications. We provide both constructive and non-constructive implementations of Zig-zag Sort, based on the existence of a circuit known as an epsilon-halver, such that the constant factors in our constructive implementations are orders of magnitude smaller than those for constructive variants of the AKS sorting network, which are also based on the use of epsilon-halvers.Comment: Appearing in ACM Symp. on Theory of Computing (STOC) 201

    Shuttle orbiter boundary layer transition at flight and wind tunnel conditions

    Get PDF
    Hypersonic boundary layer transition data obtained on the windward centerline of the Shuttle orbiter during entry for the first five flights are presented and analyzed. Because the orbiter surface is composed of a large number of thermal protection tiles, the transition data include the effects of distributed roughness arising from tile misalignment and gaps. These data are used as a benchmark for assessing and improving the accuracy of boundary layer transition predictions based on correlations of wind tunnel data taken on both aerodynamically rough and smooth orbiter surfaces. By comparing these two data bases, the relative importance of tunnel free stream noise and surface roughness on orbiter boundary layer transition correlation parameters can be assessed. This assessment indicates that accurate predications of transition times can be made for the orbiter at hypersonic flight conditions by using roughness dominated wind tunnel data. Specifically, times of transition onset and completion is accurately predicted using a correlation based on critical and effective values of a roughness Reynolds number previously derived from wind tunnel data
    corecore