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.
Kapitel 12
A. G. Konheim, Cryptography: A Primer, John Wiley & Sons, 1981.
D. E. R. Denning, Cryptography and Data Security, Addison-Wesley, 1982.
O. Goldreich und L. Lovasz, Modern Cryptography, Probabilistic Proofs and Pseudo-randomness, Springer-Verlag, 1999.
O. Goldreich, Foundations of Cryptography: Basic Tools, Cambridge University Press, 2001.
R. L. Rivest, „Cryptography,“ in Handbook of Theoretical Computer Science, Vol. A, J. van Leeuwen, Hrsg., Elsevier und MIT Press, 1990, S. 717–55.
Journal of Cryptology, abgekürzt als J. Crypt; herausgegeben vom Springer-Verlag.
Cryptologia; herausgegeben von der Militärakademie der Vereinigten Staaten.
W. Diffie und M. Hellman, „New Directions in Cryptography,“ IEEE Trans. Inform. Theory IT-22 (1976), S. 644–54.
R. L. Rivest, A. Shamir und L. M. Adleman, „A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,“ Comm. Assoc. Comput. Mach. 21 (1978), S. 120–6.
M. O. Rabin, „Digitalized Signatures and Public-Key Functions as Intractable as Factorization,“ Technical Report MIT/LCS/TR-212, Mass. Inst. of Tech., Cambridge, MA, 1979.
M. E. Hellman, „The Mathematics of Public-Key Cryptography,“ Scientific American 241:2 (1979), S. 146–57.
A. Shamir, R. L. Rivest und L. M. Adleman, „Mental Poker,“ in The Mathematical Gardner, D. A. Klarner, Hrsg., Wadsworth International, Belmont, CA, 1981.
R. J. Lipton, „How to Cheat at Mental Poker,“ Proc. AMS Short Course on Cryptology, American Mathematical Society, 1981.
S. Goldwasser und S. Micali, „Probabilistic Encryption,“ J. Comput. Syst. Sci. 28 (1984), S. 270–99.
A. Shamir, „How to Share a Secret,“ Comm. Assoc. Comput. Mach. 22 (1979), S. 612–13.
M. Blum, „How to Exchange (Secret) Keys,“ ACM Trans. Comput. Syst. 1 (1983), S. 175–93.
A. C. Yao, „How to Generate and Exchange Secrets,“ Proc. 27th IEEE Symp. on Foundations of Computer Science, IEEE Press, S. 162–7, 1986.
S. Goldwasser, S. Micali und C. Rackoff, „The Knowledge Complexity of Interactive Proof Systems,“ SIAM J. Comput. 18 (1989), S. 186–208.
C. Lund, L. Fortnow, H. Karloff und N. Nisan, „Algebraic Methods for Interactive Proof Systems,“ J. Assoc. Comput. Mach. 39 (1992), S. 859–68.
A. Shamir, „IP = PSPACE,“ J. Assoc. Comput. Mach. 39 (1992), S. 869–77.
M. Naor, Y. Naor und O. Reingold, „Applied Kid Cryptography, or How to Convince Your Children That You Are Not Cheating,“ unveröffentlichtes Manuskript, 1999.
O. Goldreich, S. Micali und A. Wigderson, „Proofs that Yield Nothing But Their Validity, or All Languages in NP Have Zero-Knowledge Proof Systems,“ J. Assoc. Comput. Mach. 38 (1991), S. 691–729.
U. Feige, S. Goldwasser, L. Lovász, S. Safra und M. Szegedy, „Approximating Clique is Almost NP-complete,“ J. Assoc. Comput. Mach., 43 (1996), S. 268–92.
S. Arora und S. Safra, „Probabilistic Checking of Proofs: A New Characterization of NP,“ J. Assoc. Comput. Mach., 45 (1998), S. 70–122.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Kryptografie und zuverlässige Interaktion. In: Algorithmik. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-37437-X_12
Download citation
DOI: https://doi.org/10.1007/3-540-37437-X_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24342-7
Online ISBN: 978-3-540-37437-4
eBook Packages: Life Science and Basic Disciplines (German Language)