The following pages link to Yuval Ishai (Q166364):
Displaying 50 items.
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- On linear-size pseudorandom generators and hardcore functions (Q744085) (← links)
- Limits of practical sublinear secure computation (Q775973) (← links)
- Private circuits: a modular approach (Q775985) (← links)
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\) (Q937192) (← links)
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Private computation using a PEZ dispenser. (Q1426438) (← links)
- Protecting data privacy in private information retrieval schemes (Q1577014) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Best possible information-theoretic MPC (Q1631330) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Quasi-optimal SNARGs via linear multi-prover interactive proofs (Q1653086) (← links)
- The price of low communication in secure multi-party computation (Q1675733) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q1690260) (← links)
- How to construct a leakage-resilient (stateless) trusted party (Q1690270) (← links)
- Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\) (Q1690280) (← links)
- Can we access a database both locally and privately? (Q1690289) (← links)
- Non-interactive multiparty computation without correlated randomness (Q1701442) (← links)
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions (Q1701448) (← links)
- Minimizing locality of one-way functions via semi-private randomized encodings (Q1747656) (← links)
- On the message complexity of secure multiparty computation (Q1749308) (← links)
- On privacy and partition arguments (Q1854427) (← links)
- Reducing the servers' computation in private information retrieval: PIR with preprocessing (Q1880406) (← links)
- Adaptive versus non-adaptive security of multi-party protocols (Q1882568) (← links)
- On computational shortcuts for information-theoretic PIR (Q2055735) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- On pseudorandom encodings (Q2119099) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- Sublinear GMW-style compiler for MPC with preprocessing (Q2128572) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Private circuits with quasilinear randomness (Q2170088) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- Secure computation with preprocessing via function secret sharing (Q2175917) (← links)
- Trapdoor hash functions and their applications (Q2304914) (← links)
- Zero-knowledge proofs on secret-shared data via fully linear PCPs (Q2304915) (← links)
- Reusable non-interactive secure computation (Q2304929) (← links)
- Efficient pseudorandom correlation generators: silent OT extension and more (Q2304930) (← links)
- Cryptographic sensing (Q2304933) (← links)
- Computationally private randomizing polynomials and their applications (Q2458940) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
