Skip to main content
SpringerLink
Log in

Distributed cryptographic function application protocols

  • Session 15: Protocols
  • Conference paper
  • First Online:
Book cover Information and Communications Security (ICICS 1997)

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

Included in the following conference series:

  • 227 Accesses

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. 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.

    Article  Google Scholar 

  3. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam, the Netherlands, North Holland, 1978.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Twente, P.O.Box 217, NL 7500 AE, Enschede, the Netherlands

    Andrè Postma, Thijs Krol & Egbert Molenkamp

Authors
  1. Andrè Postma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thijs Krol
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Egbert Molenkamp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation