The following pages link to Yuval Ishai (Q166364):
Displaying 50 items.
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation (Q2697852) (← links)
- (Q2778845) (← links)
- (Q2778854) (← links)
- Selective private function evaluation with applications to private statistics (Q2787694) (← links)
- Universal service-providers for database private information retrieval (extended abstract) (Q2790104) (← links)
- On Public Key Encryption from Noisy Codewords (Q2798809) (← links)
- Private Large-Scale Databases with Distributed Searchable Symmetric Encryption (Q2799008) (← links)
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits (Q2799088) (← 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)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (Q2849393) (← links)
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Q2849395) (← links)
- Zero Knowledge LTCs and Their Applications (Q2851889) (← links)
- Secure Multi-Party Computation with Identifiable Abort (Q2874547) (← links)
- Non-Interactive Secure Multiparty Computation (Q2874549) (← links)
- Identifying Cheaters without an Honest Majority (Q2891474) (← links)
- On Efficient Zero-Knowledge PCPs (Q2891481) (← links)
- Black-box constructions for secure computation (Q2931374) (← links)
- On the randomness complexity of efficient sampling (Q2931431) (← links)
- Secure multiparty computation of approximations (Q2944525) (← links)
- Function Secret Sharing (Q2948389) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Lossy chains and fractional secret sharing (Q2957881) (← links)
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications (Q2988877) (← links)
- On Achieving the “Best of Both Worlds” in Secure Multiparty Computation (Q2999858) (← links)
- Correlation Extractors and Their Applications (Q3002096) (← links)
- Efficient Non-interactive Secure Computation (Q3003395) (← links)
- Black-Box Constructions of Protocols for Secure Computation (Q3020005) (← links)
- On Invertible Sampling and Adaptive Security (Q3058673) (← links)
- Binary AMD Circuits from Secure Multiparty Computation (Q3179363) (← links)
- On Complete Primitives for Fairness (Q3408189) (← links)
- Founding Cryptography on Tamper-Proof Hardware Tokens (Q3408202) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- Cryptography with One-Way Communication (Q3457066) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Secure Computation from Leaky Correlated Randomness (Q3457091) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- (Q3549593) (← links)
- (Q3549728) (← links)
- Bounded Key-Dependent Message Security (Q3563848) (← links)
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
