PROOFS OF WORK AND BREAD PUDDING PROTOCOLS (EXTENDED ABSTRACT)
暂无分享,去创建一个
[1] A. Agrawal,et al. Experimental Characterization of Multiconductor Transmission Lines in Inhomogeneous Media Using Time-Domain Techniques , 1979, IEEE Transactions on Electromagnetic Compatibility.
[2] Martín Abadi,et al. On hiding information from an oracle , 1987, STOC '87.
[3] Martín Abadi,et al. On hiding information from an oracle , 1987, J. Comput. Syst. Sci..
[4] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.
[5] Richard J. Lipton,et al. Towards uncheatable benchmarks , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[6] Manuel Blum,et al. Program result-checking: a theory of testing meets a test of theory , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[7] Ronald L. Rivest,et al. Time-lock Puzzles and Timed-release Crypto , 1996 .
[8] Adi Shamir,et al. PayWord and MicroMint: Two Simple Micropayment Schemes , 1996, Security Protocols Workshop.
[9] Mihir Bellare,et al. Encapsulated Key Escrow , 1996 .
[10] Manuel Blum,et al. Software reliability via run-time result-checking , 1997, JACM.
[11] Mihir Bellare,et al. Verifiable partial key escrow , 1997, CCS '97.
[12] Markus Jakobsson,et al. Curbing Junk E-Mail via Secure Classification , 1998, Financial Cryptography.
[13] Moni Naor,et al. Secure and Efficient Metering , 1998, EUROCRYPT.
[14] Stuart G. Stubblebine,et al. Publicly Verifiable Lotteries: Applications of Delaying Functions , 1998, Financial Cryptography.
[15] Matthew K. Franklin,et al. Auditable Metering with Lightweight Security , 1997, J. Comput. Secur..
[16] Fabian Monrose,et al. Distributed Execution with Remote Audit , 1999, NDSS.
[17] Ari Juels,et al. Client puzzles: A cryptographic defense against connection depletion , 1999 .