Abstract
Since the introduction of the concept of digital signatures based on public key techniques, a number of additional features have been added, and many new protocols have emerged.
This is a preview of subscription content, log in via an institution to check access.
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
M. Bellare & S. Goldwasser, Verifiable Partial Key Escrow, Proc. 4th ACM Conference on Computer and Communications Security, April 1997
H. Cohen, A course in Computational Algebraic Number Theory, Springer Graduate Texts in Mathematics 138, Springer 1993
D. A. Cox, Primes of the Form x2 + ny2, Wiley Interscience, 1989
J. R. Goldman The Queen of Mathematics, A Historically Motivated Guide to Number Theory A. K. Peters, Ltd., 1998
P. Landrock, Fermat pairs, to appear
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_21
Download citation
DOI: https://doi.org/10.1007/3-540-49135-X_21
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