The following pages link to Eyal Kushilevitz (Q294743):
Displayed 50 items.
- Learning unions of high-dimensional boxes over the reals (Q294744) (← links)
- Partition arguments in multiparty communication complexity (Q541668) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) (Q937192) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- The linear-array conjecture in communication complexity is false (Q1125618) (← links)
- A communication-privacy tradeoff for modular addition (Q1209990) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm (Q1261018) (← links)
- Learning boxes in high dimension (Q1271193) (← links)
- Characterizing linear size circuits in terms of privacy (Q1305927) (← links)
- On the structure of the privacy hierarchy (Q1324758) (← links)
- Online learning versus offline learning (Q1373713) (← links)
- A simple algorithm for learning O(log n)-term DNF (Q1392215) (← links)
- Private computation using a PEZ dispenser. (Q1426438) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- The complexity of multiparty PSM protocols and related models (Q1648834) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- PAC learning with nasty noise. (Q1853516) (← links)
- The query complexity of finding local minima in the lattice (Q1854471) (← links)
- Learning by distances (Q1892878) (← links)
- Witness sets for families of binary vectors (Q1906149) (← links)
- On learning visual concepts and DNF formulae (Q1916881) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- Efficient 3-party distributed ORAM (Q2106641) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Sub-logarithmic distributed oblivious RAM with small block size (Q2289203) (← links)
- Cryptographic sensing (Q2304933) (← links)
- Computationally private randomizing polynomials and their applications (Q2458940) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- On the limitations of universally composable two-party computation without set-up assumptions (Q2499272) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- (Q2724430) (← links)
- Amortizing randomness in private multiparty computations (Q2790103) (← links)
- Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (Q2799008) (← links)
- Distribution Design (Q2800555) (← links)
- Secure Multiparty Computation with General Interaction Patterns (Q2800562) (← links)
- Improved upper bounds on information-theoretic private information retrieval (extended abstract) (Q2819536) (← links)
- One-way functions are essential for single-server private information retrieval (Q2819537) (← links)
- From randomizing polynomials to parallel algorithms (Q2826046) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (Q2849393) (← links)
- Non-Interactive Secure Multiparty Computation (Q2874549) (← links)
- Black-box constructions for secure computation (Q2931374) (← links)
- Information-theoretically secure protocols and security under composition (Q2931375) (← links)