Evaluating Branching Programs on Encrypted Data
From MaRDI portal
Publication:3596400
DOI10.1007/978-3-540-70936-7_31zbMath1156.94354OpenAlexW1518622464MaRDI QIDQ3596400
Publication date: 30 August 2007
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_31
Related Items (77)
An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties ⋮ Rate-limited secure function evaluation ⋮ On the Bottleneck Complexity of MPC with Correlated Randomness ⋮ Efficient and scalable universal circuits ⋮ Algebraic restriction codes and their applications ⋮ Credibility in private set membership ⋮ Size-Hiding Computation for Multiple Parties ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ A framework for statistically sender private OT with optimal rate ⋮ Laconic private set intersection and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Deterministic compression with uncertain priors ⋮ Lattice-based FHE as secure as PKE ⋮ Cryptogenography ⋮ Limits of random oracles in secure computation ⋮ Non-commutative arithmetic circuits with division ⋮ Decision trees, protocols and the entropy-influence conjecture ⋮ Locally testable codes and cayley graphs ⋮ Invitation games and the price of stability ⋮ Welfare maximization and truthfulness in mechanism design with ordinal preferences ⋮ Coordination mechanisms from (almost) all scheduling policies ⋮ Private interactive communication across an adversarial channel ⋮ Tree codes and a conjecture on exponential sums ⋮ Capacity of non-malleable codes ⋮ Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications ⋮ Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements ⋮ Sequential decision making with vector outcomes ⋮ Learning mixtures of arbitrary distributions over large discrete domains ⋮ Why do simple algorithms for triangle enumeration work in the real world? ⋮ Black-box obfuscation for d-CNFs ⋮ Candidate weak pseudorandom functions in AC 0 ○ MOD 2 ⋮ Iterated group products and leakage resilience against NC1 ⋮ Building one-time memories from isolated qubits ⋮ Attribute-efficient evolvability of linear functions ⋮ Energy-efficient circuit design ⋮ Rate-independent computation in continuous chemical reaction networks ⋮ Testers and their applications ⋮ On the automorphism groups of strongly regular graphs I ⋮ Faster private release of marginals on small databases ⋮ Mechanism design in large games ⋮ Redrawing the boundaries on purchasing data from privacy-sensitive individuals ⋮ Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems ⋮ Complexity of approximating CSP with balance / hard constraints ⋮ Integer feasibility of random polytopes ⋮ Multireference alignment using semidefinite programming ⋮ Partial tests, universal tests and decomposability ⋮ High dimensional expanders and property testing ⋮ Parameterized testability ⋮ Direct sum fails for zero error average communication ⋮ Rational arguments ⋮ New Communication-Efficient Oblivious Transfer Protocols Based on Pairings ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Circuit-Private Multi-key FHE ⋮ On the structure of Boolean functions with small spectral norm ⋮ (Leveled) Fully Homomorphic Encryption without Bootstrapping ⋮ The truth behind the myth of the folk theorem ⋮ Towards Robust Computation on Encrypted Data ⋮ Expanders with respect to Hadamard spaces and random graphs ⋮ Limits of local algorithms over sparse random graphs ⋮ Communication Optimal Tardos-Based Asymmetric Fingerprinting ⋮ Decompositions of Triangle-Dense Graphs ⋮ Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Private information retrieval with sublinear online time ⋮ Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy ⋮ Generic Constant-Round Oblivious Sorting Algorithm for MPC ⋮ Bounded Size-Hiding Private Set Intersection ⋮ FHE Circuit Privacy Almost for Free ⋮ Quantum Homomorphic Encryption for Polynomial-Sized Circuits ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ Breaking the Circuit Size Barrier for Secure Computation Under DDH ⋮ A Simpler Rate-Optimal CPIR Protocol ⋮ Homomorphic Encryption
This page was built for publication: Evaluating Branching Programs on Encrypted Data
