Evaluating Branching Programs on Encrypted Data
From MaRDI portal
(Redirected from Publication:3596400)
Recommendations
Cited in
(89)- Integer feasibility of random polytopes: random integer programs
- Efficient and scalable universal circuits
- Full domain functional bootstrapping using the prime cyclotomic ring
- 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
- Complexity of approximating CSP with balance / hard constraints
- Limits of local algorithms over sparse random graphs
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- FHE circuit privacy almost for free
- Cryptogenography
- Mechanism design in large games: incentives and privacy (extended abstract)
- Communication optimal Tardos-based asymmetric fingerprinting
- Capacity of non-malleable codes
- Testers and their applications
- A simpler rate-optimal CPIR protocol
- Deterministic compression with uncertain priors
- Modern techniques in somewhat homomorphic encryption
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Black-box obfuscation for \(d\)-CNFs
- Learning mixtures of arbitrary distributions over large discrete domains
- Combinatorially homomorphic encryption
- Anonymous permutation routing
- Sequential decision making with vector outcomes
- Decision trees, protocols and the entropy-influence conjecture
- Why do simple algorithms for triangle enumeration work in the real world?
- Faster private release of marginals on small databases
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Automata evaluation and text search protocols with simulation-based security
- Expanders with respect to Hadamard spaces and random graphs (extended abstract)
- Breaking the circuit size barrier for secure computation under DDH
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Locally testable codes and Cayley graphs
- Attribute-efficient evolvability of linear functions
- Lattice-based FHE as secure as PKE
- Rate-independent computation in continuous chemical reaction networks
- Adversarial hypothesis testing and a quantum Stein's lemma for restricted measurements (extended abstract)
- Iterated group products and leakage resilience against \(\mathrm{NC}^1\)
- On the bottleneck complexity of MPC with correlated randomness
- Welfare maximization and truthfulness in mechanism design with ordinal preferences
- Private interactive communication across an adversarial channel
- Towards building efficient SCALES protocols
- A framework for statistically sender private OT with optimal rate
- Algebraic restriction codes and their applications
- Credibility in private set membership
- \textsf{Justvengers}: batched VOLE ZK disjunctions in \(\mathcal{O}(R+B+C)\) communication
- Non-commutative arithmetic circuits with division
- Size-Hiding Computation for Multiple Parties
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals
- Multireference alignment using semidefinite programming
- scientific article; zbMATH DE number 3952653 (Why is no real title available?)
- Rate-limited secure function evaluation
- Energy-efficient circuit design
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Private information retrieval with sublinear online time
- Adaptive oblivious transfer with access control from lattice assumptions
- Limits of random oracles in secure computation (extended abstract)
- Homomorphic encryption
- Laconic branching programs from the Diffie-Hellman assumption
- Lower-bounds on public-key operations in PIR
- Direct sum fails for zero error average communication
- Invitation games and the price of stability
- Parameterized testability
- High dimensional expanders and property testing
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Bounded size-hiding private set intersection
- Circuit-private multi-key FHE
- (Leveled) fully homomorphic encryption without bootstrapping
- Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
- Partial tests, universal tests and decomposability
- An efficient protocol for oblivious DFA evaluation and applications
- Enhanced trapdoor hashing from DDH and DCR
- Amortizing rate-1 OT and applications to PIR and PSI
- Laconic private set intersection and applications
- On the Hardness of Scheme-Switching Between SIMD FHE Schemes
- Somewhat homomorphic encryption from linear homomorphism and sparse LPN
- On the automorphism groups of strongly regular graphs. I
- Building one-time memories from isolated qubits (extended abstract)
- Coordination mechanisms from (almost) all scheduling policies
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Rate-limited secure function evaluation: definitions and constructions
- Two-message, oblivious evaluation of cryptographic functionalities
- Rational arguments: single round delegation with sublinear verification
- Simulatable adaptive oblivious transfer with statistical receiver's privacy
- Generic constant-round oblivious sorting algorithm for MPC
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Cryptanalyses of Candidate Branching Program Obfuscators
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
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)
