On the composition of authenticated byzantine agreement
暂无分享,去创建一个
[1] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[2] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[3] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[4] Danny Dolev,et al. Authenticated Algorithms for Byzantine Agreement , 1983, SIAM J. Comput..
[5] Nancy A. Lynch,et al. Easy impossibility proofs for distributed consensus problems , 1985, PODC '85.
[6] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[7] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[8] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[9] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[10] P. Lincoln,et al. Byzantine Agreement with Authentication : Observations andApplications in Tolerating Hybrid and Link Faults , 1995 .
[11] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[12] Moni Naor,et al. Concurrent zero-knowledge , 1998, STOC '98.
[13] Joe Kilian,et al. On the Concurrent Composition of Zero-Knowledge Proofs , 1999, EUROCRYPT.
[14] Matthias Fitzi,et al. From partial consistency to global broadcast , 2000, STOC '00.
[15] Juan A. Garay,et al. Concurrent oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[16] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[17] Silvio Micali,et al. Parallel Reducibility for Information-Theoretically Secure Computation , 2000, CRYPTO.
[18] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Ran Canetti,et al. Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds , 2001, Electron. Colloquium Comput. Complex..
[20] Oded Goldreich,et al. The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .
[21] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[22] Ran Canetti,et al. Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds , 2001, STOC '01.
[23] Yehuda Lindell,et al. Secure Computation without Agreement , 2002, DISC.
[24] Oded Goldreich,et al. Concurrent zero-knowledge with timing, revisited , 2002, STOC '02.
[25] Matthias Fitzi,et al. Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch , 2002, EUROCRYPT.
[26] Oded Goldreich,et al. Cryptography and cryptographic protocols , 2003, Distributed Computing.
[27] Ran Canetti,et al. Universal Composition with Joint State , 2003, CRYPTO.
[28] Donald Beaver,et al. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority , 2004, Journal of Cryptology.
[29] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.