Abstract
Recovery of data stored in a fault-tolerant and secure way requires encryption and / or decryption of data with secret cryptographic functions, for which a group of processors should be responsible. For this purpose, the here-introduced distributed cryptographic function application protocols (DCFAPs) can be applied. DCFAPs are executed on a set, N, of N processors, in order to apply a secret cryptographic function F, while satisfying the following properties:
-
malicious behaviour of up to T processors from Ndoes not inhibit application of F
-
any group of N-T or more processors from Nis capable of applying F
-
T or fewer colluding processors from Nare unable to compute or apply F.
Preview
Unable to display preview. Download preview PDF.
References
De Santis, A., et al., How to Share a Function Securely, in: Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montréal, 1994, pp.522–533.
Lamport, L., et al., The Byzantine Generals Problem, in: ACM Transactions on Programming Languages and Systems, Vol.4, No.3, July 1982, pp.382–401.
MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam, the Netherlands, North Holland, 1978.
Pease, M., Shostak, R., and Lamport, L., Reaching agreement in the presence of faults, in: Journal of the ACM, Vol. 27, No.2, April 1980, pp. 228–234.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Postma, A., Krol, T., Molenkamp, E. (1997). Distributed cryptographic function application protocols. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028499
Download citation
DOI: https://doi.org/10.1007/BFb0028499
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63696-0
Online ISBN: 978-3-540-69628-5
eBook Packages: Springer Book Archive