Robust Synchronous P2P Primitives Using SGX Enclaves
暂无分享,去创建一个
Zhenkai Liang | Prateek Saxena | Shruti Tople | Tarik Moataz | Yaoqi Jia | Deli Gong | P. Saxena | Zhenkai Liang | Shruti Tople | Yaoqi Jia | Tarik Moataz | D. Gong
[1] Piotr Berman,et al. Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds , 2005, Mathematical systems theory.
[2] Ethan Heilman,et al. Eclipse Attacks on Bitcoin's Peer-to-Peer Network , 2015, USENIX Security Symposium.
[3] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[4] Bruce M. Kapron,et al. Fast asynchronous byzantine agreement and leader election with full information , 2008, SODA '08.
[5] Prateek Saxena,et al. A Secure Sharding Protocol For Open Blockchains , 2016, CCS.
[6] Tal Rabin,et al. Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.
[7] Moni Naor,et al. Split-ballot voting: Everlasting privacy with distributed trust , 2007, TSEC.
[8] Vinod Vaikuntanathan,et al. Randomized algorithms for reliable broadcast , 2009 .
[9] Silvio Micali,et al. An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..
[10] Jeremy Clark,et al. On Bitcoin as a public randomness source , 2015, IACR Cryptol. ePrint Arch..
[11] Anne-Marie Kermarrec,et al. Highly dynamic distributed computing with byzantine failures , 2013, PODC '13.
[12] Danny Dolev,et al. Early stopping in Byzantine agreement , 1990, JACM.
[13] Sam Toueg,et al. Asynchronous consensus and broadcast protocols , 1985, JACM.
[14] Miguel Correia,et al. The Design of a COTSReal-Time Distributed Security Kernel , 2002, EDCC.
[15] Miguel Correia,et al. How to tolerate half less one Byzantine nodes in practical distributed systems , 2004, Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, 2004..
[16] Danny Dolev,et al. Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity , 2015, STOC.
[17] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[18] Yoram Moses,et al. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds , 1998, SIAM J. Comput..
[19] Ghassan O. Karame,et al. Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing , 2016, IEEE Transactions on Computers.
[20] Piotr Berman,et al. Randomized distributed agreement revisited , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.
[21] Richard M. Karp,et al. Load Balancing in Structured P2P Systems , 2003, IPTPS.
[22] Matthias Fitzi,et al. Efficient player-optimal protocols for strong and differential consensus , 2003, PODC '03.
[23] Christian Scheideler,et al. Robust random number generation for peer-to-peer systems , 2006, Theor. Comput. Sci..
[24] Sebastian Nowozin,et al. Oblivious Multi-Party Machine Learning on Trusted Processors , 2016, USENIX Security Symposium.
[25] Michel Raynal,et al. Signature-Free Asynchronous Byzantine Consensus with $ , 2014 .
[26] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[27] Sam Toueg,et al. Time and Message Efficient Reliable Broadcasts , 1990, WDAG.
[28] Jared Saia,et al. Scalable byzantine computation , 2010, SIGA.
[29] Marcin Andrychowicz,et al. Distributed Cryptography Based on the Proofs of Work , 2014, IACR Cryptol. ePrint Arch..
[30] Jonathan Katz,et al. On Expected Constant-Round Protocols for Byzantine Agreement , 2006, CRYPTO.
[31] Hugo Krawczyk,et al. Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , 1999, Journal of Cryptology.
[32] Yoram Moses,et al. Fully polynomial Byzantine agreement in t + 1 rounds , 1993, STOC.
[33] Elaine Shi,et al. The Honey Badger of BFT Protocols , 2016, CCS.
[34] Michel Raynal,et al. Optimal early stopping uniform consensus in synchronous systems with process omission failures , 2004, SPAA '04.
[35] Michael J. Fischer,et al. Scalable Bias-Resistant Distributed Randomness , 2017, 2017 IEEE Symposium on Security and Privacy (SP).
[36] Jacob R. Lorch,et al. TrInc: Small Trusted Hardware for Large Distributed Systems , 2009, NSDI.
[37] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[38] Marcus Peinado,et al. Inferring Fine-grained Control Flow Inside SGX Enclaves with Branch Shadowing , 2016, USENIX Security Symposium.
[39] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[40] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[41] Marcus Peinado,et al. Controlled-Channel Attacks: Deterministic Side Channels for Untrusted Operating Systems , 2015, 2015 IEEE Symposium on Security and Privacy.
[42] Jeremy Clark,et al. On the Use of Financial Data as a Random Beacon , 2010, EVT/WOTE.
[43] Victor Shoup,et al. Secure and Efficient Asynchronous Broadcast Protocols , 2001, CRYPTO.
[44] László Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[45] Michael O. Rabin,et al. Transaction Protection by Beacons , 1983, J. Comput. Syst. Sci..
[46] Dirk Grunwald,et al. Low-resource routing attacks against tor , 2007, WPES '07.
[47] Christian Cachin,et al. Secure INtrusion-Tolerant Replication on the Internet , 2002, Proceedings International Conference on Dependable Systems and Networks.
[48] Nikita Borisov,et al. Computational Puzzles as Sybil Defenses , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).
[49] Piotr Berman,et al. Optimal Early Stopping in Distributed Consensus (Extended Abstract) , 1992, WDAG.
[50] Sam Toueg,et al. Fault-tolerant broadcasts and related problems , 1993 .
[51] Gabriel Bracha,et al. An asynchronous [(n - 1)/3]-resilient consensus protocol , 1984, PODC '84.
[52] Stefano Tessaro,et al. Asynchronous Verifiable Information Dispersal , 2005, DISC.
[53] Srinivas Devadas,et al. Intel SGX Explained , 2016, IACR Cryptol. ePrint Arch..
[54] Marcus Peinado,et al. T-SGX: Eradicating Controlled-Channel Attacks Against Enclave Programs , 2017, NDSS.
[55] Yehuda Lindell,et al. Introduction to Modern Cryptography , 2004 .
[56] Gabriel Bracha,et al. Asynchronous Byzantine Agreement Protocols , 1987, Inf. Comput..
[57] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[58] Kartik Nayak,et al. Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).
[59] George Cybenko,et al. Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..
[60] Shweta Shinde,et al. Preventing Page Faults from Telling Your Secrets , 2016, AsiaCCS.
[61] Victor Shoup,et al. Random Oracles in Constantinople: Practical Asynchronous Byzantine Agreement Using Cryptography , 2000, Journal of Cryptology.
[62] Elaine Shi,et al. Formal Abstractions for Attested Execution Secure Processors , 2017, EUROCRYPT.
[63] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[64] Prateek Mittal,et al. SybilControl: practical sybil defense with computational puzzles , 2012, STC '12.
[65] George Danezis,et al. Denial of service or denial of security? , 2007, CCS '07.
[66] Sam Toueg,et al. Distributed agreement in the presence of processor and communication faults , 1986, IEEE Transactions on Software Engineering.
[67] Miguel Correia,et al. Efficient Byzantine Fault-Tolerance , 2013, IEEE Transactions on Computers.
[68] Scott Shenker,et al. Attested append-only memory: making adversaries stick to their word , 2007, SOSP.