Abstract
I used to say that the only thing I can trust is what I can prove, but that was when I was a mathematician and now I’m a cryptographer (at least part-time) and then of course that no longer holds. I have to trust for instance that factoring is difficult. It reminds me of a conversation we had about a year ago in the Danish Security Council. Somebody was saying: you know, you don’t know what to trust these days, I’m very careful when I’m on the phone, I never say anything important on the phone. And I said I’m much more cautious, I simply never say anything important, you never know.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Landrock, P. (1998). A New Concept in Protocols: Verifiable Computational Delegation. In: Christianson, B., Crispo, B., Harbison, W.S., Roe, M. (eds) Security Protocols. Security Protocols 1998. Lecture Notes in Computer Science, vol 1550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49135-X_22
Download citation
DOI: https://doi.org/10.1007/3-540-49135-X_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65663-0
Online ISBN: 978-3-540-49135-4
eBook Packages: Springer Book Archive