Conclusion
The protocol work that started off a quarter of a century ago may have seemed at the time like a minor detail within the larger project of designing robust distributed systems. Yet it has already grown into the main unifying theme of security engineering. Application-level protocols, and especially those from which an attacker can harvest data over many runs, open up new problems. The resulting analysis techniques are set to invade the world of composable security and the world of multiparty computation. The influence and consequences of Roger’s contribution just keep on growing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burrows, M., Abadi, M., and Needham, R.M., ‘A logic of authentication,’ ACM Trans. on Computer Systems, vol. 8,no. 1, pp. 18–36, 1990.
Needham, R.M., and Schroeder, R.M., ‘Using encryption for authentication in large networks of computers.’ Comm. ACM, vol. 21,no. 12, pp. 993–999, 1978.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Anderson, R., Bond, M. (2004). Protocol Analysis, Composability and Computation. In: Herbert, A., Jones, K.S. (eds) Computer Systems. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/0-387-21821-1_3
Download citation
DOI: https://doi.org/10.1007/0-387-21821-1_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20170-2
Online ISBN: 978-0-387-21821-2
eBook Packages: Springer Book Archive