On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Improved Deterministic Parallel Padded Sorting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Random Cayley Digraphs and the Discrete Logarithm
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
t-Wise independence with local dependencies
Information Processing Letters
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Intrusion-resilient key exchange in the bounded retrieval model
TCC'07 Proceedings of the 4th conference on Theory of cryptography
1-pass relative-error Lp-sampling with applications
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data stream algorithms for codeword testing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Instantiability of RSA-OAEP under chosen-plaintext attack
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Random selection with an adversarial majority
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Randomness-Dependent message security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Improved Approximation of Linear Threshold Functions
Computational Complexity
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
We introduce a natural notion of obliviousness of a sampling procedure, and construct a randomness-efficient oblivious sampler. Our sampler uses O(l+log /spl delta//sup -1//spl middot/log l) coins to output m=poly(/spl epsiv//sup -1/, log /spl delta//sup -1/, log l) sample points x/sub 1/, ..., x/sub m/, /spl isin/ {0, 1}/sup 1/ such that Pr[|1/m/spl Sigma//sub i=1//sup m/f(x/sub i/)-E[f]|