On hiding information from an oracle

DOI10.1016/0022-0000(89)90018-4zbMath0687.68016OpenAlexW2023906228MaRDI QIDQ1263281

Joe Kilian, Martín Abadi, Joan Feigenbaum

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90018-4

zbMATH Keywords

computing with encrypted dataencryptability of ND-hard functionsencryptable functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items

The power of adaptiveness and additional queries in random-self- reductions ⋮ The complexity of generating test instances ⋮ An information-theoretic treatment of random-self-reducibility ⋮ Best possible information-theoretic MPC ⋮ Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ Batch RSA ⋮ A survey on delegated computation ⋮ Average-case intractability vs. worst-case intractability ⋮ Upper bound on the communication complexity of private information retrieval ⋮ A server-aided computation protocol for rsa enciphering algorithm ⋮ Secure commitment against a powerful adversary ⋮ Equivalence of single-server and multiple-server blind quantum computation protocols ⋮ Secure circuit evaluation. A protocol based on hiding information from an oracle ⋮ Arithmetic operations on encrypted data ⋮ Symmetric quantum fully homomorphic encryption with perfect security ⋮ Hypercubes and Private Information Retrieval ⋮ Locally random reductions: Improvements and applications ⋮ New collapse consequences of NP having small circuits ⋮ On being incoherent without being very hard ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ On the power of two-local random reductions ⋮ On the autoreducibility of functions ⋮ Competing provers yield improved Karp-Lipton collapse results ⋮ Towards Robust Computation on Encrypted Data ⋮ Evaluation and Cryptanalysis of the Pandaka Lightweight Cipher ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Secret sharing over infinite domains ⋮ Hard promise problems and nonuniform complexity ⋮ Hardness of learning problems over Burnside groups of exponent 3 ⋮ BLIND QUANTUM COMPUTATION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines that take advice
• Some consequences of non-uniform conditions on uniform classes
• Complexity and structure
• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• The polynomial-time hierarchy
• Universal classes of hash functions
• The polynomial-time hierarchy and sparse oracles
• Quantitative Relativizations of Complexity Classes
• The Knowledge Complexity of Interactive Proof Systems
• Every Prime Has a Succinct Certificate
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations