Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElaine Shi
Elaine Runting Shi
Person information
- affiliation: Carnegie Mellon University, USA
- affiliation (former): Cornell University, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j18]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak
, Rafael Pass, Ling Ren, Elaine Shi:
Communication complexity of byzantine agreement, revisited. Distributed Comput. 36(1): 3-28 (2023)- [j17]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023) - [j16]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. 36(2): 7 (2023) - [j15]Joshua Gancher, Kristina Sojakova, Xiong Fan, Elaine Shi, Greg Morrisett:
A Core Calculus for Equational Proofs of Cryptographic Protocols. Proc. ACM Program. Lang. 7(POPL): 866-892 (2023) - [c147]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. EUROCRYPT (3) 2023: 3-34 - [c146]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. EUROCRYPT (1) 2023: 395-425 - [c145]Andrew Park, Wei-Kai Lin, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. EUROCRYPT (1) 2023: 456-486 - [c144]Elaine Shi, Hao Chung, Ke Wu:
What Can Cryptography Do for Decentralized Mechanism Design? ITCS 2023: 97:1-97:22 - [c143]Tung Le, Pengzhi Huang, Attila A. Yavuz, Elaine Shi, Thang Hoang:
Efficient Dynamic Proof of Retrievability for Cold Storage. NDSS 2023 - [c142]Elaine Shi, Nikhil Vanjani:
Multi-Client Inner Product Encryption: Function-Hiding Instantiations Without Random Oracles. Public Key Cryptography (1) 2023: 622-651 - [c141]Hao Chung, Elaine Shi:
Foundations of Transaction Fee Mechanism Design. SODA 2023: 3856-3899 - [i125]Sarabjeet Singh, Xiong Fan, Ananth Krishna Prasad, Lin Jia, Anirban Nag, Rajeev Balasubramonian, Mahdi Nazm Bojnordi, Elaine Shi:
XCRYPT: Accelerating Lattice Based Cryptography with Memristor Crossbar Arrays. CoRR abs/2302.00095 (2023) - [i124]Ke Wu, Elaine Shi, Hao Chung:
Maximizing Miner Revenue in Transaction Fee Mechanism Design. CoRR abs/2302.12895 (2023) - [i123]Atsuki Momose, Ling Ren, Elaine Shi, Jun Wan, Zhuolun Xiang:
On the Amortized Communication Complexity of Byzantine Broadcast. IACR Cryptol. ePrint Arch. 2023: 38 (2023) - [i122]Ke Wu, Elaine Shi, Hao Chung:
Maximizing Miner Revenue in Transaction Fee Mechanism Design. IACR Cryptol. ePrint Arch. 2023: 283 (2023) - 2022
- [j14]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. J. ACM 69(4): 27:1-27:49 (2022) - [j13]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. J. Cryptol. 35(2): 6 (2022) - [j12]Lianke Qin, Rajesh Jayaram, Elaine Shi, Zhao Song, Danyang Zhuo, Shumo Chu:
Differentially Oblivious Relational Database Operators. Proc. VLDB Endow. 16(4): 842-855 (2022) - [j11]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size ${o(n \log n)}$. SIAM J. Comput. 51(3): 424-466 (2022) - [c140]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. AISTATS 2022: 11581-11597 - [c139]Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu:
log *-Round Game-Theoretically-Fair Leader Election. CRYPTO (3) 2022: 409-438 - [c138]Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi:
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. CRYPTO (1) 2022: 688-718 - [c137]Ke Wu, Gilad Asharov, Elaine Shi:
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. EUROCRYPT (1) 2022: 120-149 - [c136]Naama Ben-David, Benjamin Y. Chan, Elaine Shi:
Revisiting the Power of Non-Equivocation in Distributed Protocols. PODC 2022: 450-459 - [c135]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. SODA 2022: 2459-2521 - [c134]Wei-Kai Lin, Elaine Shi:
Optimal Sorting Circuits for Short Keys. SODA 2022: 3583-3629 - [c133]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. IEEE Symposium on Security and Privacy 2022: 422-439 - [c132]Jiaheng Zhang, Tiancheng Xie, Thang Hoang, Elaine Shi, Yupeng Zhang:
Polynomial Commitment with a One-to-Many Prover and Applications. USENIX Security Symposium 2022: 2965-2982 - [e6]Heng Yin, Angelos Stavrou, Cas Cremers, Elaine Shi:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022. ACM 2022, ISBN 978-1-4503-9450-5 [contents] - [i121]Elaine Shi, Hao Chung, Ke Wu:
What Can Cryptography Do For Decentralized Mechanism Design. CoRR abs/2209.14462 (2022) - [i120]Pengzhi Huang, Thang Hoang, Yueying Li, Elaine Shi, G. Edward Suh:
STAMP: Lightweight TEE-Assisted MPC for Efficient Privacy-Preserving Machine Learning. CoRR abs/2210.10133 (2022) - [i119]Lianke Qin, Rajesh Jayaram, Elaine Shi, Zhao Song, Danyang Zhuo, Shumo Chu:
Adore: Differentially Oblivious Relational Database Operators. CoRR abs/2212.05176 (2022) - [i118]Mingxun Zhou, Elaine Shi:
The Power of the Differentially Oblivious Shuffle in Distributed Privacy Mechanisms. IACR Cryptol. ePrint Arch. 2022: 177 (2022) - [i117]Andrew Park, Wei-Kai Lin, Elaine Shi:
NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead. IACR Cryptol. ePrint Arch. 2022: 191 (2022) - [i116]Hao Chung, Elisaweta Masserova, Elaine Shi, Sri Aravinda Krishnan Thyagarajan:
Ponyta: Foundations of Side-Contract-Resilient Fair Exchange. IACR Cryptol. ePrint Arch. 2022: 582 (2022) - [i115]Mingxun Zhou, Wei-Kai Lin, Yiannis Tselekounis, Elaine Shi:
Optimal Single-Server Private Information Retrieval. IACR Cryptol. ePrint Arch. 2022: 609 (2022) - [i114]Yue Guo, Antigoni Polychroniadou, Elaine Shi, David Byrd, Tucker Balch:
MicroFedML: Privacy Preserving Federated Learning for Small Weights. IACR Cryptol. ePrint Arch. 2022: 714 (2022) - [i113]Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu:
log*-Round Game-Theoretically-Fair Leader Election. IACR Cryptol. ePrint Arch. 2022: 791 (2022) - [i112]Ilan Komargodski, Elaine Shi:
Differentially Oblivious Turing Machines. IACR Cryptol. ePrint Arch. 2022: 883 (2022) - [i111]Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi:
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. IACR Cryptol. ePrint Arch. 2022: 1027 (2022) - [i110]Hao Chung, Elisaweta Masserova, Elaine Shi, Sri Aravinda Krishnan Thyagarajan:
Rapidash: Improved Constructions for Side-Contract-Resilient Fair Exchange. IACR Cryptol. ePrint Arch. 2022: 1063 (2022) - [i109]Afonso Tinoco, Sixiang Gao, Elaine Shi:
EnigMap: Signal Should Use Oblivious Algorithms for Private Contact Discovery. IACR Cryptol. ePrint Arch. 2022: 1083 (2022) - [i108]Elaine Shi, Hao Chung, Ke Wu:
What Can Cryptography Do For Decentralized Mechanism Design? IACR Cryptol. ePrint Arch. 2022: 1294 (2022) - [i107]Mingxun Zhou, Elaine Shi, T.-H. Hubert Chan, Shir Maimon:
A Theory of Composition for Differential Obliviousness. IACR Cryptol. ePrint Arch. 2022: 1357 (2022) - [i106]Rex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani:
Non-Interactive Anonymous Router with Quasi-Linear Router Computation. IACR Cryptol. ePrint Arch. 2022: 1395 (2022) - [i105]Tung Le, Pengzhi Huang, Attila A. Yavuz, Elaine Shi, Thang Hoang:
Efficient Dynamic Proof of Retrievability for Cold Storage. IACR Cryptol. ePrint Arch. 2022: 1417 (2022) - 2021
- [c131]Elaine Shi:
Streamlet: An Absurdly Simple, Textbook Blockchain Protocol. AsiaCCS 2021: 320 - [c130]T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak:
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. ITC 2021: 8:1-8:23 - [c129]Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. ITC 2021: 19:1-19:24 - [c128]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election. CRYPTO (2) 2021: 3-32 - [c127]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) 2021: 610-640 - [c126]Elaine Shi, Waqar Aqeel, Balakrishnan Chandrasekaran, Bruce M. Maggs:
Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time. CRYPTO (4) 2021: 641-669 - [c125]Elaine Shi, Ke Wu:
Non-Interactive Anonymous Router. EUROCRYPT (3) 2021: 489-520 - [c124]Yoko Shibuya, Go Yamamoto, Fuhito Kojima, Elaine Shi, Shin'ichiro Matsuo, Aron Laszka:
Selfish Mining Attacks Exacerbated by Elastic Hash Supply. Financial Cryptography (2) 2021: 269-276 - [c123]Ilan Komargodski, Elaine Shi:
Differentially Oblivious Turing Machines. ITCS 2021: 68:1-68:19 - [c122]Cosku Acay, Rolph Recto, Joshua Gancher, Andrew C. Myers, Elaine Shi:
Viaduct: an extensible, optimizing compiler for secure distributed programs. PLDI 2021: 740-755 - [c121]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size o(n log n). SODA 2021: 2249-2268 - [c120]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. SPAA 2021: 373-384 - [e5]Yongdae Kim, Jong Kim, Giovanni Vigna, Elaine Shi:
CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15 - 19, 2021. ACM 2021, ISBN 978-1-4503-8454-4 [contents] - [i104]Wei-Kai Lin, Elaine Shi:
Optimal Sorting Circuits for Short Keys. CoRR abs/2102.11489 (2021) - [i103]Yoko Shibuya, Go Yamamoto, Fuhito Kojima, Elaine Shi, Shin'ichiro Matsuo, Aron Laszka:
Selfish Mining Attacks Exacerbated by Elastic Hash Supply. CoRR abs/2103.08007 (2021) - [i102]Alireza Farhadi, MohammadTaghi Hajiaghayi, Elaine Shi:
Differentially Private Densest Subgraph. CoRR abs/2106.00508 (2021) - [i101]Hao Chung, Elaine Shi:
Foundations of Transaction Fee Mechanism Design. CoRR abs/2111.03151 (2021) - [i100]Mingxun Zhou, Tianhao Wang, T.-H. Hubert Chan, Giulia Fanti, Elaine Shi:
Locally Differentially Private Sparse Vector Aggregation. CoRR abs/2112.03449 (2021) - [i99]Greg Morrisett, Elaine Shi, Kristina Sojakova, Xiong Fan, Joshua Gancher:
IPDL: A Simple Framework for Formally Verifying Distributed Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2021: 147 (2021) - [i98]Elaine Shi, Ke Wu:
Non-Interactive Anonymous Router. IACR Cryptol. ePrint Arch. 2021: 435 (2021) - [i97]Cosku Acay, Rolph Recto, Joshua Gancher, Andrew C. Myers, Elaine Shi:
Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs (Technical Report). IACR Cryptol. ePrint Arch. 2021: 468 (2021) - [i96]Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. IACR Cryptol. ePrint Arch. 2021: 593 (2021) - [i95]Ke Wu, Gilad Asharov, Elaine Shi:
A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. IACR Cryptol. ePrint Arch. 2021: 748 (2021) - [i94]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2021: 1123 (2021) - [i93]Benedikt Bünz, Yuncong Hu, Shin'ichiro Matsuo, Elaine Shi:
Non-Interactive Differentially Anonymous Router. IACR Cryptol. ePrint Arch. 2021: 1242 (2021) - [i92]Hao Chung, Elaine Shi:
Foundations of Transaction Fee Mechanism Design. IACR Cryptol. ePrint Arch. 2021: 1474 (2021) - 2020
- [j10]Alireza Farhadi, Mohammad Taghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. Commun. ACM 63(10): 97-105 (2020) - [j9]Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-malleable Codes and Their Applications. J. Cryptol. 33(1): 319-355 (2020) - [j8]Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher W. Fletcher, Ling Ren, Xiangyao Yu, Srinivas Devadas:
A Retrospective on Path ORAM. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(8): 1572-1576 (2020) - [c119]Benjamin Y. Chan, Elaine Shi:
Streamlet: Textbook Streamlined Blockchains. AFT 2020: 1-11 - [c118]Andrew Morgan, Rafael Pass, Elaine Shi:
On the Adaptive Security of MACs and PRFs. ASIACRYPT (1) 2020: 724-753 - [c117]Pan Zhang, Chengyu Song, Heng Yin, Deqing Zou, Elaine Shi, Hai Jin:
Klotski: Efficient Obfuscated Execution against Controlled-Channel Attacks. ASPLOS 2020: 1263-1276 - [c116]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) 2020: 403-432 - [c115]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. ITC 2020: 11:1-11:23 - [c114]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. ITCS 2020: 75:1-75:52 - [c113]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Sublinear-Round Byzantine Agreement Under Corrupt Majority. Public Key Cryptography (2) 2020: 246-265 - [c112]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA 2020: 8-14 - [c111]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. SODA 2020: 2349-2365 - [c110]Elaine Shi:
Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue. IEEE Symposium on Security and Privacy 2020: 842-858 - [c109]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. TCC (2) 2020: 379-409 - [c108]Jun Wan, Hanshen Xiao, Elaine Shi, Srinivas Devadas:
Expected Constant Round Byzantine Broadcast Under Dishonest Majority. TCC (1) 2020: 381-411 - [c107]Jun Wan, Hanshen Xiao, Srinivas Devadas, Elaine Shi:
Round-Efficient Byzantine Broadcast Under Strongly Adaptive and Majority Corruptions. TCC (1) 2020: 412-456 - [c106]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. DISC 2020: 28:1-28:17 - [i91]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. CoRR abs/2002.11321 (2020) - [i90]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. CoRR abs/2008.00332 (2020) - [i89]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR abs/2008.01765 (2020) - [i88]Gilad Asharov, Wei-Kai Lin, Elaine Shi:
Sorting Short Keys in Circuits of Size o(n log n). CoRR abs/2010.09884 (2020) - [i87]Elaine Shi:
Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey). IACR Cryptol. ePrint Arch. 2020: 87 (2020) - [i86]Benjamin Y. Chan, Elaine Shi:
Streamlet: Textbook Streamlined Blockchains. IACR Cryptol. ePrint Arch. 2020: 88 (2020) - [i85]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020: 125 (2020) - [i84]T.-H. Hubert Chan, Kai-Min Chung, Wei-Kai Lin, Elaine Shi:
MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture. IACR Cryptol. ePrint Arch. 2020: 240 (2020) - [i83]Jun Wan, Hanshen Xiao, Elaine Shi, Srinivas Devadas:
Expected Constant Round Byzantine Broadcast under Dishonest Majority. IACR Cryptol. ePrint Arch. 2020: 590 (2020) - [i82]T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. IACR Cryptol. ePrint Arch. 2020: 604 (2020) - [i81]T.-H. Hubert Chan, Naomi Ephraim, Antonio Marcedone, Andrew Morgan, Rafael Pass, Elaine Shi:
Blockchain with Varying Number of Players. IACR Cryptol. ePrint Arch. 2020: 677 (2020) - [i80]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. IACR Cryptol. ePrint Arch. 2020: 947 (2020) - [i79]Andrew Morgan, Rafael Pass, Elaine Shi:
On the Adaptive Security of MACs and PRFs. IACR Cryptol. ePrint Arch. 2020: 1090 (2020) - [i78]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. IACR Cryptol. ePrint Arch. 2020: 1157 (2020) - [i77]Jun Wan, Hanshen Xiao, Srinivas Devadas, Elaine Shi:
Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions. IACR Cryptol. ePrint Arch. 2020: 1236 (2020) - [i76]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020: 1292 (2020) - [i75]Kai-Min Chung, T.-H. Hubert Chan, Ting Wen, Elaine Shi:
Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions. IACR Cryptol. ePrint Arch. 2020: 1591 (2020) - [i74]Elaine Shi, Waqar Aqeel, Balakrishnan Chandrasekaran, Bruce M. Maggs:
Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time. IACR Cryptol. ePrint Arch. 2020: 1592 (2020)
2010 – 2019
- 2019
- [j7]Dana Dachman-Soled, Chang Liu, Charalampos Papamanthou, Elaine Shi, Uzi Vishkin:
Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness. J. Cryptol. 32(3): 941-972 (2019) - [c105]Elaine Shi:
Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey). ASIACRYPT (1) 2019: 3-17 - [c104]Prabhanjan Ananth, Xiong Fan, Elaine Shi:
Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More. ASIACRYPT (1) 2019: 112-141 - [c103]Yue Guo, Rafael Pass, Elaine Shi:
Synchronous, with a Chance of Partition Tolerance. CRYPTO (1) 2019: 499-529 - [c102]Elaine Shi:
Analysis of Deterministic Longest-Chain Protocols. CSF 2019: 122-135 - [c101]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. EUROCRYPT (2) 2019: 214-243 - [c100]T.-H. Hubert Chan, Rafael Pass, Elaine Shi:
Consensus Through Herding. EUROCRYPT (1) 2019: 720-749 - [c99]Phil Daian, Rafael Pass, Elaine Shi:
Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake. Financial Cryptography 2019: 23-41 - [c98]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication Complexity of Byzantine Agreement, Revisited. PODC 2019: 317-326 - [c97]Wei-Kai Lin, Elaine Shi, Tiancheng Xie:
Can We Overcome the n log n Barrier for Oblivious Sorting? SODA 2019: 2419-2438 - [c96]T.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi:
Foundations of Differentially Oblivious Algorithms. SODA 2019: 2448-2467 - [c95]Mu Zhang, Chien-Ying Chen, Bin-Chou Kao, Yassine Qamsane, Yuru Shao, Yikai Lin, Elaine Shi, Sibin Mohan, Kira Barton, James R. Moyne, Z. Morley Mao:
Towards Automated Safety Vetting of PLC Code in Real-World Plants. IEEE Symposium on Security and Privacy 2019: 522-538 - [c94]Alireza Farhadi, MohammadTaghi Hajiaghayi, Kasper Green Larsen, Elaine Shi:
Lower bounds for external memory integer sorting via network coding. STOC 2019: 997-1008 - [i73]T.-H. Hubert Chan, Zhibin Liang, Antigoni Polychroniadou, Elaine Shi:
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels. CoRR abs/1910.12175 (2019) - [i72]