Elaine Shi
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- ITCS2 editions2021–2023
all 7 in the filters
on a stage with
- Daniel Wichs2×
- Greg Morrisettonce
- Hao Chungonce
all 8 in the filters
who talks about the same things
- Shafi Goldwasser13 talks
- Nick Sullivan11 talks
- Lijie Chen9 talks
- Andres Erbsen5 talks
- Toniann Pitassi5 talks
- Elaine Li4 talks
| title | conference | date |
|---|---|---|
| Talk by Elaine Shi (Carnegie Mellon University) | Obfuscation | 2025-06-23 |
Claims a construction of quasi-linear EF iO that runs in time proportional to circuit size plus EF-proof size, assuming FHE, one-way functions and iO for… | ||
| Private Information Retrieval and Oblivious RAM | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Survey condenses two concrete systems and their numbers: a tree/Circuit-ORAM implementation (used by Signal via a TEE but optimized to 20–50 microseconds per… | ||
| Private Information Retrieval and Oblivious RAM | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Signal runs Path ORAM for private contact discovery and achieves single-query latencies of 20–50 microseconds and ~200k qps on one machine; a reworked ORAM… | ||
| A Core Calculus for Equational Proofs of Cryptographic Protocols | POPL 2023 | 2023-01-15 |
Introduces a tiny process calculus and an equation-of-logic that proves observational equivalence for distributed crypto by rewriting networks of probabilistic… | ||
| What Can Cryptography Do For Decentralized Mechanism Design? | ITCS 2023 | 2023-01-10 |
Paper proves that adding cryptography — a practical MPC-assisted model where many miners run an honest-majority multi‑party computation over user bids — lets… | ||
| Differentially Oblivious Turing Machines | ITCS 2021 | 2021-01-06 |
Claim: any multi-tape Turing machine admits a compiler to a Differentially Oblivious Turing Machine that hides any single differing step while incurring only… | ||
| Game-Theoretically Secure Protocols Inspired by Blockchains | Proofs, Consensus, and Decentralizing Society Reunion 2020 | 2020-12-04 |
Claims a constructive protocol that achieves game-theoretic leader election with corrupt majority and no trusted setup, improving from the usual log n… | ||
| Cryptocurrencies and Smart Contracts | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Defines a formal F-blockchain model that trusts correctness but not privacy, then builds Hark, a compiler and protocol that turns ordinary smart contracts into… | ||
| Oblivious RAM I | Cryptography Boot Camp 2015 | 2015-05-18 |
Describes why encrypted memory leaks via access patterns in SGX and cloud settings then gives concrete ORAM constructions, costs, and implementations. Tree… | ||
| Oblivious RAM II | Cryptography Boot Camp 2015 | 2015-05-18 |
Describes two concrete advances and what they actually build: an OnionORAM that achieves constant communication per access by shaving the usual log N factor at… | ||
| nothing matches | ||