Jesse Kamp

Deterministic extractors for bit-fixing sources and exposure-resilient cryptography

We give an efficient deterministic algorithm which extracts /spl Omega/(n/sup 2/spl gamma//) almost-random bits from sources where n/sup 1/2 + /spl gamma// of the n bits are uniformly random and the rest are fixed in advance. This improves on previous constructions which required that at least n/2 of the bits be random. Our construction also gives explicit adaptive exposure-resilient functions and in turn adaptive all-or-nothing transforms. For sources where instead of bits the values are chosen from [d], for d > 2, we give an algorithm which extracts a constant fraction of the randomness. We also give bounds on extracting randomness for sources where the fixed bits can depend on the random bits.

Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography

We give an efficient deterministic algorithm that extracts

Deterministic extractors for small-space sources

Omega(n^{2gamma})

Oracle Database In-Memory: A dual format in-memory database

almost-random bits from sources where

Distributed architecture of Oracle database in-memory

n^{frac{1}{2}+gamma}

Query optimization in Oracle 12c database in-memory

of the

Accelerating analytics with dynamic in-memory expressions

n

Fault-tolerant real-time analytics with distributed Oracle Database In-memory

bits are uniformly random and the rest are fixed in advance. This improves upon previous constructions, which required that at least

How does Oracle Database In-Memory scale out?

n/2

Instructions matérielles efficaces pour processeurs d'instruction unique données multiples

of the bits be random in order to extract many bits. Our construction also has applications in exposure-resilient cryptography, giving explicit adaptive exposure-resilient functions and, in turn, adaptive all-or-nothing transforms. For sources where instead of bits the values are chosen from