The following pages link to Yuval Ishai (Q166364):
Displaying 50 items.
- Zero-Knowledge Proofs from Secure Multiparty Computation (Q3575162) (← links)
- Batch codes and their applications (Q3580973) (← links)
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography (Q3582754) (← links)
- Secure Multiparty Computation with Minimal Interaction (Q3582778) (← links)
- From Secrecy to Soundness: Efficient Verification via Secure Computation (Q3587376) (← links)
- Private Circuits II: Keeping Secrets in Tamperable Circuits (Q3593103) (← links)
- On Pseudorandom Generators with Linear Stretch in NC0 (Q3595413) (← links)
- Evaluating Branching Programs on Encrypted Data (Q3596400) (← links)
- Founding Cryptography on Oblivious Transfer – Efficiently (Q3600241) (← links)
- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR (Q3603474) (← links)
- Secure Arithmetic Computation with No Honest Majority (Q3611773) (← links)
- Cryptography with Constant Input Locality (Q3612545) (← links)
- How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? (Q3612555) (← links)
- (Q4409117) (← links)
- (Q4434901) (← links)
- (Q4535072) (← links)
- (Q4535073) (← links)
- (Q4536794) (← links)
- (Q4542531) (← links)
- (Q4542532) (← links)
- (Q4638056) (← links)
- Valid Generalisation from Approximate Interpolation (Q4715266) (← links)
- (Q4737161) (← links)
- Succinct Non-interactive Arguments via Linear Interactive Proofs (Q4910285) (← links)
- On the Power of Correlated Randomness in Secure Computation (Q4910301) (← links)
- On Linear-Size Pseudorandom Generators and Hardcore Functions (Q4925235) (← links)
- (Q4941881) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5092467) (← links)
- Partial Garbling Schemes and Their Applications (Q5167780) (← links)
- Extracting Correlations (Q5171210) (← links)
- The round complexity of verifiable secret sharing and secure multicast (Q5176016) (← links)
- Constant-Rate Oblivious Transfer from Noisy Channels (Q5199219) (← links)
- Circuits resilient to additive attacks with applications to secure computation (Q5259585) (← links)
- Public-Coin Differing-Inputs Obfuscation and Its Applications (Q5261695) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Ad Hoc PSM Protocols: Secure Computation Without Coordination (Q5270377) (← links)
- (Q5302091) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307268) (← links)
- On the Power of Nonlinear Secret-Sharing (Q5317613) (← links)
- Robust Pseudorandom Generators (Q5326593) (← links)
- Distributed Point Functions and Their Applications (Q5418720) (← links)
- On the Complexity of UC Commitments (Q5418722) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428116) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428136) (← links)
- Private Multiparty Sampling and Approximation of Vector Combinations (Q5428813) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator (Q5451037) (← links)
- Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems (Q5451038) (← links)
