Exposing Computationally-Challenged Byzantine Impostors
暂无分享,去创建一个
[1] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[2] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.
[3] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[4] Michael K. Reiter,et al. The Rampart Toolkit for Building High-Integrity Services , 1994, Dagstuhl Seminar on Distributed Systems.
[5] Gil Neiger,et al. Distributed Consensus Revisited , 1994, Inf. Process. Lett..
[6] Ronald L. Rivest,et al. Time-lock Puzzles and Timed-release Crypto , 1996 .
[7] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[8] Mihir Bellare,et al. The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin , 1996, EUROCRYPT.
[9] Ari Juels,et al. Client puzzles: A cryptographic defense against connection depletion , 1999 .
[10] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.
[11] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[12] Michael B. Jones,et al. SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.
[13] M. Waldman. Secure and Robust Censorship-Resistant Publishing Systems , 2003 .
[14] Emin Gün Sirer,et al. KARMA : A Secure Economic Framework for Peer-to-Peer Resource Sharing , 2003 .
[15] Peter R. Pietzuch,et al. XenoTrust: event-based distributed trust management , 2003, 14th International Workshop on Database and Expert Systems Applications, 2003. Proceedings..
[16] Matthias Fitzi,et al. Efficient player-optimal protocols for strong and differential consensus , 2003, PODC '03.
[17] Alexandre V. Evfimievski,et al. Information sharing across private databases , 2003, SIGMOD '03.
[18] Ted Wobber,et al. Moderately hard, memory-bound functions , 2005, TOIT.