Pages that link to "Item:Q1263281"
From MaRDI portal
The following pages link to On hiding information from an oracle (Q1263281):
Displaying 27 items.
- Symmetric quantum fully homomorphic encryption with perfect security (Q479359) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Locally random reductions: Improvements and applications (Q676825) (← links)
- Secure circuit evaluation. A protocol based on hiding information from an oracle (Q913487) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- On being incoherent without being very hard (Q1198954) (← links)
- On the power of two-local random reductions (Q1209364) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- The power of adaptiveness and additional queries in random-self- reductions (Q1332664) (← links)
- Batch RSA (Q1363068) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Hardness of learning problems over Burnside groups of exponent 3 (Q2339133) (← links)
- Equivalence of single-server and multiple-server blind quantum computation protocols (Q2686213) (← links)
- Evaluation and Cryptanalysis of the Pandaka Lightweight Cipher (Q2794511) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)
- Hypercubes and Private Information Retrieval (Q3297525) (← links)
- BLIND QUANTUM COMPUTATION (Q3430389) (← links)
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers (Q3452351) (← links)
- Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
- Towards Robust Computation on Encrypted Data (Q3600376) (← links)
- Upper bound on the communication complexity of private information retrieval (Q4571971) (← links)
- The complexity of generating test instances (Q5048939) (← links)
- An information-theoretic treatment of random-self-reducibility (Q5048951) (← links)
