The following pages link to Elaine Shi (Q1629436):
Displaying 50 items.
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Thunderella: blockchains with optimistic instant confirmation (Q1648817) (← links)
- Circuit OPRAM: unifying statistically and computationally secure ORAMs and OPRAMs (Q1690263) (← links)
- The sleepy model of consensus (Q1703930) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Sublinear-round Byzantine agreement under corrupt majority (Q2055693) (← links)
- Expected constant round Byzantine broadcast under dishonest majority (Q2055728) (← links)
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions (Q2055729) (← links)
- Non-interactive anonymous router (Q2056804) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Secure massively parallel computation for dishonest majority (Q2119053) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Synchronous, with a chance of partition tolerance (Q2181863) (← links)
- Streamlined blockchains: a simple and elegant approach (a tutorial and survey) (Q2181872) (← links)
- Towards attribute-based encryption for RAMs from LWE: sub-linear decryption, and more (Q2181876) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- On the depth of oblivious parallel RAM (Q2412885) (← links)
- Oblivious hashing revisited, and applications to asymptotically efficient ORAM and OPRAM (Q2412887) (← links)
- Communication complexity of Byzantine agreement, revisited (Q2689834) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (Q2811137) (← links)
- Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies (Q2900233) (← links)
- Optimal Lower Bound for Differentially Private Multi-party Aggregation (Q2912848) (← links)
- Oblivious RAM with O((logN)3) Worst-Case Cost (Q3102186) (← links)
- Constant-Round MPC with Fairness and Guarantee of Output Delivery (Q3457060) (← links)
- Delegating Capabilities in Predicate Encryption Systems (Q3519533) (← links)
- Signatures of Reputation (Q3583566) (← links)
- Private and Continual Release of Statistics (Q3587456) (← links)
- Predicate Privacy in Encryption Systems (Q3611782) (← links)
- Distributed Private Data Analysis (Q4554940) (← links)
- Path ORAM (Q4561506) (← links)
- (Q4608037) (← links)
- Privacy-Preserving Stream Aggregation with Fault Tolerance (Q4648489) (← links)
- Signatures of Correct Computation (Q4910280) (← links)
- Streaming Authenticated Data Structures (Q4924421) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- Communication Complexity of Byzantine Agreement, Revisited (Q5145228) (← links)
- Lower Bounds for External Memory Integer Sorting via Network Coding (Q5157396) (← links)
- Lower bounds for external memory integer sorting via network coding (Q5212840) (← links)
- Can We Overcome the <i>n</i> log <i>n</i> Barrier for Oblivious Sorting? (Q5236337) (← links)
- Foundations of Differentially Oblivious Algorithms (Q5236339) (← links)
- Locally Decodable and Updatable Non-malleable Codes and Their Applications (Q5261639) (← links)
- Multi-Client Verifiable Computation with Stronger Security Guarantees (Q5261673) (← links)
