Evaluating Branching Programs on Encrypted Data

DOI10.1007/978-3-540-70936-7_31zbMATH Open1156.94354OpenAlexW1518622464MaRDI QIDQ3596400FDOQ3596400

Authors: Yuval Ishai, Anat Paskin 

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

Recommendations

• scientific article; zbMATH DE number 3952653
• Multi-party computation of polynomials and branching programs without simultaneous interaction
• Computing on Encrypted Data
• Theory of Cryptography
• Fully homomorphic encryption using ideal lattices

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (86)

• New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
• Towards Robust Computation on Encrypted Data
• Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems
• Tree codes and a conjecture on exponential sums
• Limits of local algorithms over sparse random graphs
• Complexity of approximating CSP with balance / hard constraints
• On the automorphism groups of strongly regular graphs I
• Cryptogenography
• Quantum Homomorphic Encryption for Polynomial-Sized Circuits
• Two-Message, Oblivious Evaluation of Cryptographic Functionalities
• Building one-time memories from isolated qubits
• Capacity of non-malleable codes
• Testers and their applications
• Rational arguments
• Deterministic compression with uncertain priors
• Homomorphic Encryption
• Learning mixtures of arbitrary distributions over large discrete domains
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• Sequential decision making with vector outcomes
• Decision trees, protocols and the entropy-influence conjecture
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
• Why do simple algorithms for triangle enumeration work in the real world?
• Integer feasibility of random polytopes
• Decompositions of triangle-dense graphs
• Faster private release of marginals on small databases
• Automata evaluation and text search protocols with simulation-based security
• FHE Circuit Privacy Almost for Free
• Communication Optimal Tardos-Based Asymmetric Fingerprinting
• Attribute-efficient evolvability of linear functions
• Mechanism design in large games
• Lattice-based FHE as secure as PKE
• Rate-independent computation in continuous chemical reaction networks
• Circuit-Private Multi-key FHE
• Welfare maximization and truthfulness in mechanism design with ordinal preferences
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM
• Private interactive communication across an adversarial channel
• Black-box obfuscation for d-CNFs
• Non-commutative arithmetic circuits with division
• Size-Hiding Computation for Multiple Parties
• Redrawing the boundaries on purchasing data from privacy-sensitive individuals
• Title not available (Why is that?)
• Multireference alignment using semidefinite programming
• Energy-efficient circuit design
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Rate-limited secure function evaluation
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• Locally testable codes and cayley graphs
• Private information retrieval with sublinear online time
• Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements
• Direct sum fails for zero error average communication
• Invitation games and the price of stability
• Iterated group products and leakage resilience against NC1
• Parameterized testability
• High dimensional expanders and property testing
• Partial tests, universal tests and decomposability
• An efficient protocol for oblivious DFA evaluation and applications
• (Leveled) fully homomorphic encryption without bootstrapping
• Amortizing rate-1 OT and applications to PIR and PSI
• Laconic private set intersection and applications
• On the structure of Boolean functions with small spectral norm
• Coordination mechanisms from (almost) all scheduling policies
• Rate-limited secure function evaluation: definitions and constructions
• Maliciously circuit-private multi-key FHE and MPC based on LWE
• Limits of random oracles in secure computation
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• A Simpler Rate-Optimal CPIR Protocol
• Bounded Size-Hiding Private Set Intersection
• Cryptanalyses of Candidate Branching Program Obfuscators
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
• Efficient and scalable universal circuits
• On the Bottleneck Complexity of MPC with Correlated Randomness
• Expanders with respect to Hadamard spaces and random graphs
• Combinatorially homomorphic encryption
• Anonymous permutation routing
• A framework for statistically sender private OT with optimal rate
• Algebraic restriction codes and their applications
• Credibility in private set membership
• The truth behind the myth of the folk theorem
• Adaptive oblivious transfer with access control from lattice assumptions
• Laconic branching programs from the Diffie-Hellman assumption
• Lower-bounds on public-key operations in PIR
• Achievable \textsf{CCA2} relaxation for homomorphic encryption
• Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
• On the Hardness of Scheme-Switching Between SIMD FHE Schemes
• Simulatable adaptive oblivious transfer with statistical receiver's privacy
• Generic constant-round oblivious sorting algorithm for MPC

This page was built for publication: Evaluating Branching Programs on Encrypted Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596400)