The following pages link to Andrej Bogdanov (Q315548):
Displaying 44 items.
- A dichotomy for local small-bias generators (Q315550) (← links)
- On the security of Goldreich's one-way function (Q430847) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- On the Hardness of Learning with Rounding over Small Modulus (Q2796126) (← links)
- Homomorphic Evaluation Requires Depth (Q2796133) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Limits of Provable Security for Homomorphic Encryption (Q2845664) (← links)
- A Dichotomy for Local Small-Bias Generators (Q2891508) (← links)
- Sparse extractor families for all the entropy (Q2986901) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- Input Locality and Hardness Amplification (Q3000528) (← links)
- Pseudorandom Bits for Polynomials (Q3068640) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- Threshold Secret Sharing Requires a Linear Size Alphabet (Q3181037) (← links)
- (Q3413362) (← links)
- Average-Case Complexity (Q3522267) (← links)
- The Complexity of Distinguishing Markov Random Fields (Q3541806) (← links)
- Pseudorandom generators for low degree polynomials (Q3581382) (← links)
- On the Security of Goldreich’s One-Way Function (Q3638893) (← links)
- (Q4422092) (← links)
- (Q5009525) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- (Q5111384) (← links)
- (Q5140836) (← links)
- On Basing Size-Verifiable One-Way Functions on NP-Hardness (Q5261621) (← links)
- On Extracting Common Random Bits From Correlated Sources (Q5272265) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313033) (← links)
- Pseudorandomness for Read-Once Formulas (Q5494968) (← links)
- On Worst‐Case to Average‐Case Reductions for NP Problems (Q5757460) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- Hard Functions for Low-Degree Polynomials over Prime Fields (Q5892189) (← links)
- Hard Functions for Low-Degree Polynomials over Prime Fields (Q5894222) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5918380) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5919497) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- (Q6126252) (← links)
- Public-key encryption, local pseudorandom generators, and the low-degree method (Q6581791) (← links)
- Nondeterministic interactive refutations for nearest Boolean vector (Q6638021) (← links)
- CDS composition of multi-round protocols (Q6653053) (← links)
- Classical simulation of one-query quantum distinguishers (Q6663059) (← links)
