Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era
暂无分享,去创建一个
Aggelos Kiayias | Juan A. Garay | Vassilis Zikas | Giorgos Panagiotakos | Rafail M. Ostrovsky | J. Garay | A. Kiayias | Giorgos Panagiotakos | Vassilis Zikas | R. Ostrovsky
[1] Elaine Shi,et al. Snow White: Provably Secure Proofs of Stake , 2016, IACR Cryptol. ePrint Arch..
[2] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[3] Eran Omri,et al. Characterization of Secure Multiparty Computation Without Broadcast , 2016, Journal of Cryptology.
[4] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[5] Silvio Micali,et al. How to play any mental game, or a completeness theorem for protocols with honest majority , 2019, Providing Sound Foundations for Cryptography.
[6] Birgit Pfitzmann,et al. Unconditional Byzantine Agreement for any Number of Faulty Processors , 1992, STACS.
[7] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[8] Ueli Maurer,et al. Bitcoin as a Transaction Ledger: A Composable Treatment , 2017, CRYPTO.
[9] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[10] Ueli Maurer,et al. Universally Composable Synchronous Computation , 2013, TCC.
[11] Tal Rabin,et al. Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.
[12] Elaine Shi,et al. Pseudonymous Secure Computation from Time-Lock Puzzles , 2014, IACR Cryptol. ePrint Arch..
[13] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[14] Aggelos Kiayias,et al. Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability , 2018, IACR Cryptol. ePrint Arch..
[15] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[16] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[17] Aggelos Kiayias,et al. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.
[18] E. Shi,et al. Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles , 2015 .
[19] Aggelos Kiayias,et al. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain , 2018, EUROCRYPT.
[20] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[21] Nancy A. Lynch,et al. Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.
[22] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[23] Malte Borcherding,et al. Levels of authentication in distributed agreement , 1996 .
[24] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[25] Ueli Maurer,et al. Unconditional Security Against Memory-Bounded Adversaries , 1997, CRYPTO.
[26] Martin Hirt,et al. Adaptively Secure Broadcast , 2010, EUROCRYPT.
[27] Manoj Prabhakaran,et al. Resource Fairness and Composability of Cryptographic Protocols , 2006, Journal of Cryptology.
[28] Abhi Shelat,et al. Analysis of the Blockchain Protocol in Asynchronous Networks , 2017, EUROCRYPT.
[29] Ran Canetti,et al. Universally composable signature, certification, and authentication , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[30] Marcin Andrychowicz,et al. PoW-Based Distributed Cryptography with No Trusted Setup , 2015, CRYPTO.
[31] Fred B. Schneider,et al. Implementing fault-tolerant services using the state machine approach: a tutorial , 1990, CSUR.
[32] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[33] Aggelos Kiayias,et al. The Bitcoin Backbone Protocol: Analysis and Applications , 2015, EUROCRYPT.
[34] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[35] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[36] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[37] Matthias Fitzi,et al. Generalized communication and security models in Byzantine agreement , 2002 .