The following pages link to Omer Reingold (Q354648):
Displaying 50 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Completeness in two-party secure computation: A computational view (Q862422) (← links)
- On the construction of pseudorandom permutations: Luby-Rackoff revisited (Q1284012) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Constructing pseudo-random permutations with a prescribed structure (Q1601828) (← links)
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring (Q1606932) (← links)
- Entropy waves, the zig-zag graph product, and new constant-degree expanders (Q1613289) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- Tight bounds for shared memory systems accessed by Byzantine processes (Q1953641) (← links)
- Fault tolerance in large games (Q2016249) (← links)
- Partial exposure in large games (Q2268112) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- (Q2768333) (← links)
- (Q2778845) (← links)
- Pure Differential Privacy for Rectangle Queries via Private Partitions (Q2795997) (← links)
- On recycling the randomness of states in space bounded computation (Q2819543) (← links)
- Fairness through awareness (Q2826058) (← links)
- Balls and Bins: Smaller Hash Families and Faster Evaluation (Q2848208) (← links)
- Pseudorandom Generators for Combinatorial Shapes (Q2848209) (← links)
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions (Q2848227) (← links)
- Pseudorandomness for Regular Branching Programs via Fourier Analysis (Q2851892) (← links)
- Efficiency improvements in constructing pseudorandom generators from one-way functions (Q2875171) (← links)
- Incremental Deterministic Public-Key Encryption (Q2894435) (← links)
- Pseudorandom walks on regular digraphs and the RL vs. L problem (Q2931408) (← links)
- Preserving Statistical Validity in Adaptive Data Analysis (Q2941495) (← links)
- The reusable holdout: Preserving validity in adaptive data analysis (Q2961909) (← links)
- Deterministic coupon collection and better strong dispersers (Q2969668) (← links)
- Pseudorandom Functions and Factoring (Q3149873) (← links)
- Number-theoretic constructions of efficient pseudo-random functions (Q3168269) (← links)
- Players' Effects Under Limited Independence (Q3169075) (← links)
- Computational Differential Privacy (Q3183561) (← links)
- S-T connectivity on digraphs with a known stationary distribution (Q3189013) (← links)
- Pseudo-random functions and factoring (extended abstract) (Q3191966) (← links)
- On the Power of the Randomized Iterate (Q3225163) (← links)
- Magic Functions (Q3452511) (← links)
- Just fast keying (Q3546456) (← links)
- (Q3549591) (← links)
- Universal One-Way Hash Functions via Inaccessible Entropy (Q3563858) (← links)
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function (Q3575163) (← links)
- Randomness conductors and constant-degree lossless expanders (Q3579250) (← links)
- Completeness in two-party secure computation (Q3580999) (← links)
- Extractors (Q3581258) (← links)
- (Q3581398) (← links)
- Undirected ST-connectivity in log-space (Q3581436) (← links)
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (Q3591440) (← links)
- Undirected connectivity in log-space (Q3604402) (← links)
- How Well Do Random Walks Parallelize? (Q3638899) (← links)
- Pseudorandom Bit Generators That Fool Modular Sums (Q3638908) (← links)
