Pages that link to "Item:Q3596400"
From MaRDI portal
The following pages link to Evaluating Branching Programs on Encrypted Data (Q3596400):
Displaying 30 items.
- Complexity of approximating CSP with balance / hard constraints (Q2988897) (← links)
- Integer feasibility of random polytopes (Q2988898) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Partial tests, universal tests and decomposability (Q2988902) (← links)
- High dimensional expanders and property testing (Q2988903) (← links)
- Parameterized testability (Q2988904) (← links)
- Direct sum fails for zero error average communication (Q2988905) (← links)
- Rational arguments (Q2988906) (← links)
- Simulatable Adaptive Oblivious Transfer with Statistical Receiver’s Privacy (Q3092348) (← links)
- Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Towards Robust Computation on Encrypted Data (Q3600376) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
- On the Bottleneck Complexity of MPC with Correlated Randomness (Q5087257) (← links)
- Cryptanalyses of Candidate Branching Program Obfuscators (Q5270365) (← links)
- Circuit-Private Multi-key FHE (Q5738758) (← links)
- A Simpler Rate-Optimal CPIR Protocol (Q5854446) (← links)
- Expanders with respect to Hadamard spaces and random graphs (Q5892453) (← links)
- Limits of local algorithms over sparse random graphs (Q5892454) (← links)
- Deterministic compression with uncertain priors (Q5892455) (← links)
- The truth behind the myth of the folk theorem (Q5892456) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
- Anonymous permutation routing (Q6582210) (← links)
- Laconic branching programs from the Diffie-Hellman assumption (Q6635828) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6655869) (← links)
