The following pages link to (Q3359734):
Displaying 32 items.
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority (Q809588) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- Highly resilient correctors for polynomials (Q1199875) (← links)
- On the power of two-local random reductions (Q1209364) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
- Locally Decodable Codes: A Brief Survey (Q3005596) (← links)
- Hypercubes and Private Information Retrieval (Q3297525) (← links)
- Upper bound on the communication complexity of private information retrieval (Q4571971) (← links)
- Program result checking: A new approach to making programs more reliable (Q4630244) (← links)
- (Q4993289) (← links)
- (Q5002633) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- (Q5121895) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- The power of natural properties as oracles (Q6116834) (← links)
