Elaine Shi

Q: What Schools Are Affiliated With Elaine Shi

Elaine Shi is affiliated with the following schools: University of Maryland, College Park, Tsinghua University, Carnegie Mellon University, Cornell University

Elaine Shi's AcademicInfluence.com Rankings

Elaine Shi

Computer Science

#4857

World Rank

#5128

Historical Rank

Database

#3837

World Rank

#3992

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Elaine Shi's Degrees

PhD Computer Science Carnegie Mellon University
Masters Computer Science Carnegie Mellon University
Bachelors Computer Science Tsinghua University

Similar Degrees You Can Earn

Why Is Elaine Shi Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Elaine Runting Shi is a Chinese and American computer scientist and cryptographer, whose research has included work on blockchain and smart contracts, secure distributed systems, and the oblivious RAM model, and cryptographic techniques for encrypted computation. She is an associate professor of computer science and electrical engineering at Carnegie Mellon University.

(See a Problem?)

Elaine Shi's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts (2016) (1745)
The Sybil attack in sensor networks: analysis & defenses (2004) (1666)
Controlling data in the cloud: outsourcing computation without outsourcing control (2009) (984)
Designing secure sensor networks (2004) (679)
Path ORAM: an extremely simple oblivious RAM protocol (2012) (656)
The Honey Badger of BFT Protocols (2016) (621)
Bitter to Better - How to Make Bitcoin a Better Currency (2012) (606)
Multi-Dimensional Range Query over Encrypted Data (2007) (538)
Privacy-Preserving Aggregation of Time-Series Data (2011) (508)
Town Crier: An Authenticated Data Feed for Smart Contracts (2016) (500)
Practical Dynamic Searchable Encryption with Small Leakage (2014) (485)
On Scaling Decentralized Blockchains - (A Position Paper) (2016) (478)
Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab (2016) (463)
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack (2016) (450)
Predicate Privacy in Encryption Systems (2009) (446)
Private and Continual Release of Statistics (2010) (435)
Oblivious RAM with O((logN)3) Worst-Case Cost (2011) (426)
Hybrid Consensus: Efficient Consensus in the Permissionless Model (2017) (337)
Towards Practical Oblivious RAM (2011) (326)
FruitChains: A Fair Blockchain (2017) (322)
ObliVM: A Programming Framework for Secure Computation (2015) (302)
Implicit Authentication through Learning User Behavior (2010) (300)
TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs (2009) (300)
Permacoin: Repurposing Bitcoin Work for Data Preservation (2014) (289)
BIND: a fine-grained attestation service for secure distributed systems (2005) (282)
Implicit authentication for mobile devices (2009) (269)
GUPT: privacy preserving data analysis made easy (2012) (261)
ObliviStore: High Performance Oblivious Cloud Storage (2013) (256)
Path ORAM (2012) (245)
Portcullis: protecting connection setup from denial-of-capability attacks (2007) (236)
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound (2015) (235)
PHANTOM: practical oblivious computation in a secure processor (2013) (234)
Snow White: Provably Secure Proofs of Stake (2016) (223)
Thunderella: Blockchains with Optimistic Instant Confirmation (2018) (214)
Privacy-Preserving Stream Aggregation with Fault Tolerance (2012) (211)
Practical dynamic proofs of retrievability (2013) (206)
Joint Link Prediction and Attribute Inference Using a Social-Attribute Network (2014) (182)
Cloud Data Protection for the Masses (2012) (178)
Delegating Capabilities in Predicate Encryption Systems (2008) (175)
The Ring of Gyges: Investigating the Future of Criminal Smart Contracts (2016) (173)
Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge (2011) (172)
Oblivious Data Structures (2014) (171)
Authentication in the clouds: a framework and its application to mobile users (2010) (163)
Detection of denial-of-message attacks on sensor network broadcasts (2005) (161)
GhostRider: A Hardware-Software System for Memory Trace Oblivious Computation (2015) (159)
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake (2019) (159)
The Sleepy Model of Consensus (2017) (158)
SCORAM: Oblivious RAM for Secure Computation (2014) (157)
Signatures of Correct Computation (2013) (155)
Constants Count: Practical Improvements to Oblivious RAM (2015) (150)
Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (2016) (138)
Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions (2015) (137)
Multi-cloud oblivious storage (2013) (136)
GraphSC: Parallel Secure Computation Made Easy (2015) (127)
Automating Efficient RAM-Model Secure Computation (2014) (106)
Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams (2012) (95)
ShadowCrypt: Encrypted Web Applications for Everyone (2014) (93)
Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns (2014) (92)
Solidus: Confidential Distributed Ledger Transactions via PVORM (2017) (90)
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge (2017) (86)
Optimal Lower Bound for Differentially Private Multi-party Aggregation (2012) (84)
OptORAMa: Optimal Oblivious RAM (2020) (83)
Formal Abstractions for Attested Execution Secure Processors (2017) (80)
Streamlet: Textbook Streamlined Blockchains (2020) (78)
Authenticated data structures, generically (2014) (76)
Communication Complexity of Byzantine Agreement, Revisited (2018) (74)
Constant-Round MPC with Fairness and Guarantee of Output Delivery (2015) (74)
Streaming Authenticated Data Structures (2013) (69)
Predicting Links and Inferring Attributes using a Social-Attribute Network (SAN) (2011) (68)
xJsnark: A Framework for Efficient Verifiable Computation (2018) (67)
Verifiable Oblivious Storage (2014) (63)
Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM (2014) (61)
Memory Trace Oblivious Program Execution (2013) (60)
TRUESET: Faster Verifiable Set Computations (2014) (59)
Rethinking Large-Scale Consensus (2017) (59)
Do You Know Where Your Data Are? Secure Data Capsules for Deployable Data Protection (2011) (55)
PaLa: A Simple Partially Synchronous Blockchain (2018) (54)
HOP: Hardware makes Obfuscation Practical (2017) (47)
EnCore: private, context-based communication for mobile social apps (2014) (46)
Foundations of Differentially Oblivious Algorithms (2019) (45)
Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM (2015) (45)
Scambaiter: Understanding Targeted Nigerian Scams on Craigslist (2014) (43)
Multi-Client Verifiable Computation with Stronger Security Guarantees (2015) (43)
Synchronous, with a Chance of Partition Tolerance (2019) (42)
Signatures of Reputation (2010) (40)
C ∅ C ∅ : A Framework for Building Composable Zero-Knowledge Proofs (2016) (40)
OverDoSe: A Generic DDoS Protection Service Using an Overlay Network (2006) (39)
Improved Extension Protocols for Byzantine Broadcast and Agreement (2020) (39)
Locally Decodable and Updatable Non-malleable Codes and Their Applications (2015) (39)
Efficient and secure threshold-based event validation for VANETs (2011) (37)
Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM (2017) (35)
How to Use SNARKs in Universally Composable Protocols (2015) (35)
Towards Automated Safety Vetting of PLC Code in Real-World Plants (2019) (33)
Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs (2017) (33)
PiLi: An Extremely Simple Synchronous Blockchain (2018) (31)
Secure Dating with Four or Fewer Cards (2015) (31)
Pseudonymous Secure Computation from Time-Lock Puzzles (2014) (30)
Adaptively Secure Fully Homomorphic Signatures Based on Lattices (2014) (30)
ObliviStore: High Performance Oblivious Distributed Cloud Data Store (2013) (27)
On the Depth of Oblivious Parallel RAM (2017) (26)
Can We Overcome the n log n Barrier for Oblivious Sorting? (2019) (25)
Anonymous Multi-Attribute Encryption with Range Query and Conditional Decryption∗ (2006) (24)
SDDR: Light-Weight, Secure Mobile Encounters (2014) (24)
Cache-Oblivious and Data-Oblivious Sorting and Applications (2018) (23)
Perfectly Secure Oblivious Parallel RAM (2018) (23)
FastPRP: Fast Pseudo-Random Permutations for Small Domains (2012) (22)
Foundations of Transaction Fee Mechanism Design (2021) (22)
Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles (2015) (21)
Characterizing Long-tail SEO Spam on Cloud Web Hosting Services (2016) (21)
Expected Constant Round Byzantine Broadcast under Dishonest Majority (2020) (18)
Sublinear-Round Byzantine Agreement Under Corrupt Majority (2020) (18)
Opaak: using mobile phones to limit anonymous identities online (2012) (17)
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting (2018) (17)
Lower bounds for external memory integer sorting via network coding (2018) (16)
Oblivious Computation with Data Locality (2017) (16)
Context-centric Security (2012) (16)
Consensus through Herding (2019) (16)
Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue (2020) (15)
Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time (2021) (15)
Publicly Verifiable Delegation of Computation (2011) (15)
Game Theoretic Notions of Fairness in Multi-party Coin Toss (2018) (14)
Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies (2012) (14)
Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions (2020) (12)
Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey) (2019) (12)
A secure computation framework for SDNs (2014) (12)
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (2015) (11)
Oblivious Parallel Tight Compaction (2020) (11)
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort (2020) (11)
Analysis of Deterministic Longest-Chain Protocols (2019) (11)
Understanding Craigslist Rental Scams (2016) (10)
Locality-Preserving Oblivious RAM (2019) (10)
Non-Interactive Anonymous Router (2021) (9)
Evaluating predicates over encrypted data (2008) (9)
On the Adaptive Security of MACs and PRFs (2020) (9)
Symbolic Proofs for Lattice-Based Cryptography (2018) (9)
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss (2021) (9)
TRUESET: Nearly Practical Verifiable Set Computations (2014) (9)
Communication-Efficient Byzantine Agreement without Erasures (2018) (7)
Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More (2019) (7)
Klotski: Efficient Obfuscated Execution against Controlled-Channel Attacks (2020) (7)
Viaduct: an extensible, optimizing compiler for secure distributed programs (2021) (7)
Distributed Private Data Analysis (2017) (7)
Data Oblivious Algorithms for Multicores (2020) (7)
Locally Differentially Private Sparse Vector Aggregation (2021) (7)
A High-Performance Oblivious RAM Controller on the Convey HC-2ex Heterogeneous Computing Platform (2013) (7)
PiLi : A Simple , Fast , and Robust Family of Blockchain Protocols ∗ (2019) (6)
Blockchain with Varying Number of Players (2020) (6)
MicroFedML: Privacy Preserving Federated Learning for Small Weights (2022) (5)
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms (2021) (5)
Optimal Single-Server Private Information Retrieval (2022) (4)
Non-Interactive Differentially Anonymous Router (2021) (4)
PAKE-Based Web Authentication : the Good , the Bad , and the Hurdles (2009) (4)
Optimal Oblivious Parallel RAM (2022) (4)
Sorting Short Keys in Circuits of Size o(n log n) (2020) (4)
Differentially Private Densest Subgraph (2021) (4)
Privacy settings from contextual attributes: A case study using Google Buzz (2011) (4)
Secure Massively Parallel Computation for Dishonest Majority (2020) (4)
log*-Round Game-Theoretically-Fair Leader Election (2022) (3)
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture (2020) (3)
Round Complexity of Byzantine Agreement, Revisited (2019) (3)
Oblivious Network RAM (2015) (3)
Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time (2020) (3)
Ponyta: Foundations of Side-Contract-Resilient Fair Exchange (2022) (3)
Multi-Input Functional Encryption (2013) (2)
Differentially Oblivious Turing Machines (2021) (2)
Identifying Scams and Trends (2016) (2)
FANFARE for the common flow (2005) (2)
Path Oblivious Heap (2019) (2)
Non-Interactive Cryptography in the RAM Model of Computation (2014) (2)
iDASH Secure Genome Analysis Competition Using ObliVM (2015) (2)
WIRELESS SENSOR NETWORKS DESIGNING SECURE SENSOR NETWORKS (2)
Lower bounds for external memory integer sorting via network coding (2020) (2)
IPDL: A Simple Framework for Formally Verifying Distributed Cryptographic Protocols (2021) (2)
A Retrospective on Path ORAM (2020) (2)
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels (2019) (2)
Streamlet (2020) (2)
Summary/overview for artificial intelligence and security (AISec'13) (2013) (2)
Oblivious RAM with Worst-Case Logarithmic Overhead (2023) (2)
An Extensible, Optimizing Compiler for Secure Distributed Programs (Technical Report) (2021) (2)
Adore: Differentially Oblivious Relational Database Operators (2022) (2)
The Power of the Differentially Oblivious Shuffle in Distributed Privacy Mechanisms (2022) (1)
A Theory of Composition for Differential Obliviousness (2022) (1)
Circuit OPRAM: A (Somewhat) Tight Oblivious Parallel RAM (2016) (1)
Title Private and continual release of statistics (2010) (1)
Case Study: Rental Scams (2016) (1)
The Sleepy Model of Consensus Rafael Pass CornellTech (2017) (1)
Secure Dating with Four or Fewer Cards ( A short note on teaching cryptography ) (2015) (1)
Optimal Sorting Circuits for Short Keys (2021) (1)
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions (2020) (1)
The Thunder Protocol (2018) (1)
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions (2021) (1)
Locality-Preserving Oblivious RAM (2022) (0)
NanoGRAM: Garbled RAM with Õ(logN) Overhead (2022) (0)
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions (2022) (0)
Multi-Client Inner Product Encryption: Function-Hiding Instantiations Without Random Oracles (2023) (0)
Case Study: Sales Scams (2016) (0)
Path Oblivious (2019) (0)
Title Privacy-Preserving Aggregation of Time-Series Data (2010) (0)
Signatures of Reputation (Extended Abstract) (2010) (0)
2 Results : Consensus in a Weakly Synchronous Network (2019) (0)
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead (2022) (0)
How to Authenticate any Data Structure (2015) (0)
Differentially Oblivious Relational Database Operators (2022) (0)
Perfectly Secure Oblivious Parallel RAM (cid:63) (2018) (0)
Emil Stefanov: Bridging the Theory and Practice of Cloud Computing Security (2014) (0)
Streamlet: An Absurdly Simple, Textbook Blockchain Protocol (2021) (0)
Poster : Oblivious Data Structures (2014) (0)
Non-Interactive Anonymous Router with Quasi-Linear Router Computation (2022) (0)
2 The Thunder Protocol in a Nutshell (2018) (0)
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness (2018) (0)
EnigMap: Signal Should Use Oblivious Algorithms for Private Contact Discovery (2022) (0)
On the Amortized Communication Complexity of Byzantine Broadcast (2023) (0)
VoteTrust: A System to Defend against Social Network Sybils in Facebook (2018) (0)
Revised Selected Papers of the 16th International Conference on Information and Communications Security - Volume 8958 (2014) (0)
Efficient Oblivious RAM (2011) (0)
Title Optimal lower bound for differentially private multi-partyaggregation (2012) (0)
2.3 Privacy: Oblivious RAM (2017) (0)
Session details: Privacy (2010) (0)
IPDL: A Probabilistic Dataflow Logic for Cryptography (2019) (0)
Session details: Cryptographic protocols (2013) (0)
Proceedings of the ACM Conference on Computer and Communications Security: Foreword (2013) (0)
D C ] 9 M ay 2 01 8 Communication-Efficient Byzantine Agreement without Erasures (2018) (0)
Streamlined Blockchains: A Simple and Elegant Approach (2020) (0)
Selfish Mining Attacks Exacerbated by Elastic Hash Supply (2021) (0)
Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead (2020) (0)
Information and Communications Security (2014) (0)
INTERNATIONALISATION OF CARREFOUR AND THE DYNAMICS OF MODERN CHANGE MANAGEMENT PRACTICES (2017) (0)
Complexity of Byzantine Agreement , Revisited (2019) (0)

This paper list is powered by the following services:

Other Resources About Elaine Shi

What Schools Are Affiliated With Elaine Shi?

Elaine Shi is affiliated with the following schools:

Elaine Shi's Academic­Influence.com Rankings