Skip to main content

Capability-Based Financial Instruments

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1962)


Every novel cooperative arrangement of mutually suspicious parties interacting electronically - every smart contract - effectively requires a new cryptographic protocol. However, if every new contract requires new cryptographic protocol design, our dreams of cryptographically enabled electronic commerce would be unreachable. Cryptographic protocol design is too hard and expensive, given our unlimited need for new contracts.

Just as the digital logic gate abstraction allows digital circuit designers to create large analog circuits without doing analog circuit design, we present cryptographic capabilities as an abstraction allowing a similar economy of engineering effort in creating smart contracts. We explain the E system, which embodies these principles, and show a covered-call-option as a smart contract written in a simple security formalism independent of cryptography, but automatically implemented as a cryptographic protocol coordinating five mutually suspicious parties.


These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, log in via an institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. George H. Bodnar and William S. Hopwood, 1987. “Accounting Information Systems”, 3rd ed. Boston: Allyn and Bacon.

    Google Scholar 

  2. David Chaum, “Blind Signatures for Untraceable Payments,” in Advances in Cryptology Proceedings of Crypto 82, D. Chaum, R.L. Rivest, & A.T. Sherman (Eds.), Plenum, pp. 199–203.

    Google Scholar 

  3. Alonzo Church, “The Calculi of Lambda Conversion ”, Annals of Mathematical Studies no. 6. Princeton University Press (Princeton, 1941). Reprinted by Klaus Reprint Corp. (New York, 1965).

    Google Scholar 

  4. Tyler Close, “Droplet Security”, 1999,

  5. Dennis and E. Van Horn, “Programming semantics for multiprogrammed computations,” CACM, vol. 9, pp. 143155, Mar. 1966. (I-B5, II-B1, II-E).

    Google Scholar 

  6. Jed E. Donnelley, “Managing Domains in a Network Operating System” (1981) Proceedings of the Conference on Local Networks and Distributed Office Systems, Online, pp. 345–361.

    Google Scholar 

  7. Leendert van Doorn, Martín Abadi, Michael Burrows, and Edward P. Wobber. “Secure Network Objects” in Proceedings of the 1996 IEEE Symposium on Security and Privacy, pages 211–221. IEEE Computer Society, May 1996

  8. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides, “Design Patterns: Elements of Reusable Object-Oriented Software” Addison-Wesley Professional Computing, 1995.

    Google Scholar 

  9. Edited by Adele Goldberg and Alan Kay “Smalltalk 72 Instruction Manual”, Xerox PARC, March 1976.

    Google Scholar 

  10. James Gosling, Bill Joy, Guy Steele, Chapter 7 of “The Java Language Specification”, Addison-Wesley, 1996.

    Google Scholar 

  11. Mark Granovetter, “The Strength of Weak Ties”, in: American Journal of Sociology (1973) Vol. 78, pp.1360–1380.

    Article  Google Scholar 

  12. Norm Hardy, “Synergy, Rights Amplification, Sibling Communication, and Sealing”,

  13. Norm Hardy, “The KeyKOS Architecture”, Operating Systems Review, September 1985, pp. 8–25. Updated at

  14. Carl Hewitt, Peter Bishop, Richard Stieger, “A Universal Modular Actor Formalism for Artificial Intelligence”, Proceedings of the 1973 International Joint Conference on Artificial Intelligence, pp. 235–246.

    Google Scholar 

  15. Kenneth Kahn, and Mark S. Miller, “Language Design and Open Systems”, in, Bernardo Huberman (ed.), Ecology of Computation (Elsevier Science Publishers/North-Holland, 1988).

    Google Scholar 

  16. Philip MacKenzie and Jeffrey Sorensen, “Anonymous Investing: Hiding the Identities of Stockholders”, Matthew Franklin, ed., Financial Cryptography, Proceedings of the Third International Conference, 1999, Springer Lecture Notes in Computer Science, 1648.

    Chapter  Google Scholar 

  17. Mark S. Miller, Daniel G. Bobrow, Eric Dean Tribble, and Jacob Levy, “Logical Secrets”, in: Shapiro, Ehud, (ed.), Concurrent Prolog: Collected Papers (MIT Press, Cambridge, MA, 1987).

    Google Scholar 

  18. James H. Morris, “Protection in Programming Languages”, CACM 16(1): 15–21, 1973.

    Article  Google Scholar 

  19. David Parnas, “On the Criteria To Be Used in Decomposing Systems into Modules”, CACM, vol 15, num. 12, Dec. 1972.

    Google Scholar 

  20. Jonathan Rees, “A Security Kernel Based on the Lambda-Calculus”, (MIT, Cambridge, MA, 1996) MIT AI Memo No. 1564.

    Google Scholar 

  21. Ronald L. Rivest, Adi Shamir, Len Adelman, “A Method for Obtaining Digital Signatures and Public Key Cryptosystems,” MIT LCS Technical Memorandum 82 (Revised August 1977) at 10.

  22. Jerome H. Saltzer, Michael D. Schroeder, “The Protection of Information in Computer Systems”, Proceedings of the IEEE. Vol. 63, No. 9 (September 1975), pp. 1278–1308.

    Article  Google Scholar 

  23. Robert D. Sansom, D. P. Julian, Richard Rashid, “Extending a Capability Based System Into a Network Environment” (1986) Research sponsored by DOD, pp. 265–274.

    Google Scholar 

  24. Bruce Schneier, “Why Cryptography Is Harder Than It Looks”, Counterpane Systems, 1996,

  25. George Selgin, “The Theory of Free Banking: Money Supply Under Competitive Note Issue”, Rowman & Littlefield, 1988.

    Google Scholar 

  26. Andrew Shalit, “The Dylan Reference Manual: The Definitive Guide to the New Object-Oriented Dynamic Language”, Addison Wesley, 1996, chapter on Modules

  27. Claude E. Shannon, “A Mathematical Theory of Communication,” Bell System Technical Journal, vol. 27, pp. 379–423 and 623-656, July and October, 1948.

  28. Jonathan S. Shapiro, “EROS: A Capability System”, Ph.D. thesis, University of Pennsylvania, 1999.

  29. Nick Szabo, “Formalizing and Securing Relationships on Public Networks”, First Monday, vol 2 no 9, updated copy at

  30. Andrew S. Tanenbaum, Sape J. Mullender, Robbert van Renesse, “Using Sparse Capabilities in a Distributed Operating System” (1986) Proc. Sixth Int’l Conf. On Distributed Computing Systems, IEEE, pp. 558–563.

  31. Eric Dean Tribble, Mark S. Miller, Norm Hardy, Dave Krieger, “Joule: Distributed Application Foundations”,, 1995.

  32. Ann Wollrath and Jim Waldo, “Trail: RMI” in “The Java Tutorial”,, 1999.

  33. William Wulf et al, “HYDRA: The kernel of a multiprocessor operating system,” CACM, vol. 17, pp. 337–345, June 1974. (I-A2, II-B3, III-A).

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Miller, M.S., Morningstar, C., Frantz, B. (2001). Capability-Based Financial Instruments. In: Frankel, Y. (eds) Financial Cryptography. FC 2000. Lecture Notes in Computer Science, vol 1962. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42700-1

  • Online ISBN: 978-3-540-45472-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics