The following pages link to Eyal Kushilevitz (Q294743):
Displayed 50 items.
- Randomness in private computations (Q2942730) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- (Q2957881) (← links)
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858) (← links)
- Efficient Non-interactive Secure Computation (Q3003395) (← links)
- Black-Box Constructions of Protocols for Secure Computation (Q3020005) (← links)
- Information-Theoretically Secure Protocols and Security under Composition (Q3053161) (← links)
- Private information retrieval (Q3158526) (← links)
- (Q3374903) (← links)
- Cryptography with One-Way Communication (Q3457066) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Distribution-Free Property-Testing (Q3519390) (← links)
- Testing monotonicity over graph products (Q3522829) (← links)
- (Q3549593) (← links)
- (Q3549728) (← links)
- Zero-Knowledge Proofs from Secure Multiparty Computation (Q3575162) (← links)
- Batch codes and their applications (Q3580973) (← links)
- Learning with attribute costs (Q3581435) (← links)
- Secure Multiparty Computation with Minimal Interaction (Q3582778) (← links)
- From Secrecy to Soundness: Efficient Verification via Secure Computation (Q3587376) (← links)
- Choosing, Agreeing, and Eliminating in Communication Complexity (Q3587399) (← links)
- On Pseudorandom Generators with Linear Stretch in NC0 (Q3595413) (← links)
- Public Key Encryption That Allows PIR Queries (Q3612544) (← links)
- Cryptography with Constant Input Locality (Q3612545) (← links)
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? (Q3612555) (← links)
- Partition Arguments in Multiparty Communication Complexity (Q3638050) (← links)
- Privacy and Communication Complexity (Q4012449) (← links)
- On Learning Read-k-Satisfy-j DNF (Q4210120) (← links)
- Log-Space Polynomial End-to-End Communication (Q4210121) (← links)
- Lower Bounds for Randomized Mutual Exclusion (Q4210122) (← links)
- (Q4228448) (← links)
- (Q4228509) (← links)
- (Q4231909) (← links)
- (Q4234105) (← links)
- (Q4249322) (← links)
- (Q4249630) (← links)
- (Q4250187) (← links)
- Learning Decision Trees Using the Fourier Spectrum (Q4277547) (← links)
- Privacy, additional information and communication (Q4307471) (← links)
- Randomness in Private Computations (Q4377451) (← links)
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks (Q4388895) (← links)
- A Randomness-Rounds Tradeoff in Private Computation (Q4388979) (← links)
- Learning functions represented as multiplicity automata (Q4406308) (← links)
- (Q4409117) (← links)
- (Q4414264) (← links)
- (Q4434869) (← links)
- (Q4434901) (← links)
- Amortizing Randomness in Private Multiparty Computations (Q4443108) (← links)
- (Q4471371) (← links)
- Computing Functions of a Shared Secret (Q4490789) (← links)