Pages that link to "Item:Q3582751"
From MaRDI portal
The following pages link to Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness (Q3582751):
Displaying 50 items.
- On the exact decryption range for Gentry-Halevi's implementation of fully homomorphic encryption (Q742024) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- CRT-based fully homomorphic encryption over the integers (Q1749613) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Random self-reducibility of ideal-SVP via Arakelov random walks (Q2096524) (← links)
- Comparison-based attacks against noise-free fully homomorphic encryption schemes (Q2218947) (← links)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← links)
- Decompositions of triangle-dense graphs (Q2796209) (← links)
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers (Q2980858) (← links)
- Lattice-based FHE as secure as PKE (Q2988863) (← links)
- Cryptogenography (Q2988864) (← links)
- Limits of random oracles in secure computation (Q2988865) (← links)
- Non-commutative arithmetic circuits with division (Q2988867) (← links)
- Decision trees, protocols and the entropy-influence conjecture (Q2988868) (← links)
- Locally testable codes and cayley graphs (Q2988869) (← links)
- Invitation games and the price of stability (Q2988870) (← links)
- Welfare maximization and truthfulness in mechanism design with ordinal preferences (Q2988871) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- Private interactive communication across an adversarial channel (Q2988873) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Capacity of non-malleable codes (Q2988875) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- Adversarial hypothesis testing and a quantum stein's lemma for restricted measurements (Q2988878) (← links)
- Sequential decision making with vector outcomes (Q2988880) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Why do simple algorithms for triangle enumeration work in the real world? (Q2988883) (← links)
- Black-box obfuscation for d-CNFs (Q2988884) (← links)
- Candidate weak pseudorandom functions in AC <sup>0</sup> ○ MOD <sub>2</sub> (Q2988885) (← links)
- Iterated group products and leakage resilience against NC1 (Q2988886) (← links)
- Building one-time memories from isolated qubits (Q2988887) (← links)
- Attribute-efficient evolvability of linear functions (Q2988888) (← links)
- Energy-efficient circuit design (Q2988889) (← links)
- Rate-independent computation in continuous chemical reaction networks (Q2988890) (← links)
- Testers and their applications (Q2988891) (← links)
- On the automorphism groups of strongly regular graphs I (Q2988892) (← links)
- Faster private release of marginals on small databases (Q2988893) (← links)
- Mechanism design in large games (Q2988894) (← links)
- Redrawing the boundaries on purchasing data from privacy-sensitive individuals (Q2988895) (← links)
- Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems (Q2988896) (← links)
- 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)
- Benaloh’s Dense Probabilistic Encryption Revisited (Q3011926) (← links)
