暂无分享,去创建一个
Sanjay Jain | Jason Teutsch | Frank Stephan | Prateek Saxena | P. Saxena | Jason Teutsch | Sanjay Jain | F. Stephan
[1] Andrew J. Blumberg,et al. Verifying computations without reexecuting them , 2015, Commun. ACM.
[2] E. Shi,et al. Pseudonymous Broadcast and Secure Computation from Cryptographic Puzzles , 2015 .
[3] Michael J. Fischer,et al. The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.
[4] Hendrik W. Lenstra,et al. Primality Testing with Gaussian Periods , 2002, FSTTCS.
[5] Leslie Lamport,et al. The Byzantine Generals Problem , 1982, TOPL.
[6] Manindra Agrawal,et al. PRIMES is in P , 2004 .
[7] Justin Thaler,et al. Time-Optimal Interactive Proofs for Circuit Evaluation , 2013, CRYPTO.
[8] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1992, JACM.
[9] Matthew Wampler-Doty. Notes on Scalable Blockchain Protocols (version 0.3.2) , 2015 .
[10] Rusins Freivalds,et al. Fast Probabilistic Algorithms , 1979, MFCS.
[11] Zuocheng Ren,et al. Efficient RAM and control flow in verifiable outsourced computation , 2015, NDSS.
[12] Anne-Marie Kermarrec,et al. Highly dynamic distributed computing with byzantine failures , 2013, PODC '13.
[13] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[14] Jason Teutsch,et al. Demystifying Incentives in the Consensus Computer , 2015, CCS.
[15] Jiří Bečvář,et al. Mathematical Foundations of Computer Science 1979 , 1979, Lecture Notes in Computer Science.
[16] Björn Scheuermann,et al. Bitcoin and Beyond: A Technical Survey on Decentralized Digital Currencies , 2016, IEEE Communications Surveys & Tutorials.