The following pages link to Yuval Ishai (Q166364):
Displaying 47 items.
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle (Q5458603) (← links)
- How to Garble Arithmetic Circuits (Q5494942) (← links)
- How to Garble Arithmetic Circuits (Q5495012) (← links)
- Theory of Cryptography (Q5711649) (← links)
- Theory of Cryptography (Q5711651) (← links)
- Theory of Cryptography (Q5711657) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge (Q5746335) (← links)
- On the Cryptographic Complexity of the Worst Functions (Q5746343) (← links)
- Scalable Secure Multiparty Computation (Q5756646) (← links)
- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation (Q5756647) (← links)
- Cryptography in $NC^0$ (Q5757454) (← links)
- (Q5875778) (← links)
- (Q5875789) (← links)
- (Q5875794) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5915727) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5918380) (← links)
- Unconditionally secure computation against low-complexity leakage (Q5919497) (← links)
- Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
- Universal service-providers for private information retrieval (Q5927708) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation (Q6070448) (← links)
- Line-point zero knowledge and its applications (Q6107254) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Authenticated garbling from simple correlations (Q6111541) (← links)
- Programmable distributed point functions (Q6111543) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
- (Q6126252) (← links)
- (Q6126253) (← links)
- (Q6126310) (← links)
- Streaming and unbalanced PSI from function secret sharing (Q6134846) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- Tight bounds on the randomness complexity of secure multiparty computation (Q6166963) (← links)
- Refuting the dream XOR lemma via ideal obfuscation and resettable MPC (Q6561690) (← links)
- Information-theoretic distributed point functions (Q6561700) (← links)
- Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)
- Limits of preprocessing (Q6581870) (← links)
- Combinatorially homomorphic encryption (Q6582175) (← links)
- On low-end obfuscation and learning (Q6610286) (← links)
- Leakage-tolerant circuits (Q6637525) (← links)
- Constant-round simulation-secure coin tossing extension with guaranteed output (Q6637540) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds (Q6653044) (← links)
