Abstract
The security of networked computers must be dramatically improved. Other research disciplines may be useful in achieving this goal. Some topics being studied in computer security are being investigated in cryptography also. We overview some progress made in cryptography in these topics. We propose how increasing the use of cryptography in computer security can be helpful in designing more secure hardware and software for a future generation of computers.
Parts of the author's research were supported by NSF Grant NCR-9004879 and NSF Grant NCR-9106327.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adleman, L. M.: An abstract theory of computer viruses. In Advances in Cryptology — Crypto '88, Proceedings (Lecture Notes in Computer Science 403) (1990) S. Goldwasser, Ed. Springer-Verlag pp. 354–374.
Bengio, S., Brassard, G., Desmedt, Y. G., Goutier, C., Quisquater, J.-J.: Secure implementations of identification systems. Journal of Cryptology 4 (1991) 175–183.
Beth, T., Desmedt, Y.: Identification tokens — or: Solving the chess grandmaster problem. In Advances in Cryptology — Crypto '90, Proceedings (Lecture Notes in Computer Science 537) (1991) A. J. Menezes and S. A. Vanstone, Eds. Springer-Verlag pp. 169–176.
Blakley, G. R.: Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc. (1979) pp. 313–317.
Burmester, M., Desmedt, Y. G., Itoh, T., Sakurai, K., Shizuya, H.: Divertible and subliminal-free zero-knowledge proofs of languages. Submitted for outside publication.
Burmester, M. V. D., Desmedt, Y.: All languages in NP have divertible zero-knowledge proofs and arguments under cryptographic assumptions. In Advances in Cryptology, Proc. of Eurocrypt '90 (Lecture Notes in Computer Science 473) (1991) I. Damgård, Ed. Springer-Verlag pp. 1–10.
Caron, T. R., Silverman, R. D.: Parallel implementation of the quadratic sieve. J. of Supercomputing 1 (1988) 273–290.
Davida, G. I., Desmedt, Y. G.: Passports and visas versus IDs. Computers & Security 11 (1992) 253–258.
Denning, D. E. R.: Cryptography and Data Security. Addison-Wesley Reading, MA 1982.
Denning, D. E. R.: An intrusion-detection model. IEEE Transactions on Software Engineering SE-13 (1987) 222–232.
Desmedt, Y. G.: Abuse-free cryptosystems: Particularly subliminal-free authentication and signature. Submitted to the Journal of Cryptology, under revision April 1989.
Desmedt, Y.: Is there an ultimate use of cryptography? In Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263) (1987) A. Odlyzko, Ed. Springer-Verlag pp. 459–463.
Desmedt, Y.: Major security problems with the “unforgeable” (Feige-)Fiat-Shamir proofs of identity and how to overcome them. In Securicom 88, 6th worldwide congress on computer and communications security and protection (March 15–17, 1988) SEDEP Paris France pp. 147–159.
Desmedt, Y.: Society and group oriented cryptography: a new concept. In Advances in Cryptology, Proc. of Crypto '87 (Lecture Notes in Computer Science 293) (1988) C. Pomerance, Ed. Springer-Verlag pp. 120–127.
Desmedt, Y.: Subliminal-free authentication and signature. In Advances in Cryptology, Proc. of Eurocrypt '88 (Lecture Notes in Computer Science 330) (May 1988) C. G. Günther, Ed. Springer-Verlag pp. 23–33.
Desmedt, Y.: Abuses in cryptography and how to fight them. In Advances in Cryptology — Crypto '88, Proceedings (Lecture Notes in Computer Science 403) (1990) S. Goldwasser, Ed. Springer-Verlag pp. 375–389.
Desmedt, Y.: Making conditionally secure cryptosystems unconditionally abusefree in a general context. In Advances in Cryptology — Crypto '89, Proceedings (Lecture Notes in Computer Science 435) (1990) G. Brassard, Ed. Springer-Verlag pp. 6–16.
Desmedt, Y., Goutier, C., Bengio, S.: Special uses and abuses of the Fiat-Shamir passport protocol. In Advances in Cryptology, Proc. of Crypto '87 (Lecture Notes in Computer Science 293) (1988) C. Pomerance, Ed. Springer-Verlag pp. 21–39.
Desmedt, Y., Yung, M.: Unconditional subliminal-freeness in unconditional authentication systems. In Proceedings 1991 IEEE International Symposium on Information Theory (Budapest, Hungary, June 24–28, 1991) p. 176.
Fairfield, R. C., Mortenson, R. L., Coulthart, K. B.: An LSI random number generator (RNG). In Advances in Cryptology. Proc. of Crypto 84 (Lecture Notes in Computer Science 196) (1985) G. R. Blakley and D. Chaum, Eds. Springer-Verlag pp. 203–230.
Feige, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. Journal of Cryptology 1 (1988) 77–94.
Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology, Proc. of Crypto '86 (Lecture Notes in Computer Science 263) (1987) A. Odlyzko, Ed. Springer-Verlag pp. 186–194.
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, STOC (May 25–27, 1987) pp. 218–229.
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. Siam J. Comput. 18 (1989) 186–208.
Jones, T. C., Seberry, J.: Authentication without secrecy. ARS Combinatoria 21 (1986) 115–121.
Kemmerer, R.: Shared resource matrix methodology: A practical approach to identifying covert channels. ACM Trans. Comput. Syst. 1 (1983) 256–277.
Kemmerer, R., McHugh, J., Haigh, J., Young, W.: Experience using two covert channel analysis techniques of a real system design. In Proc. 1986 Symp.Security and Privacy, IEEE (1986) pp. 14–24.
Kümmerle, K.: High bandwidth communication systems: Where do we go? May 1992. Guest Speaker at IEEE Infocom '92, Florence, Italy.
Lampson, B. W.: A note on the confinement problem. Comm. ACM 16 (1973) 613–615.
Lenstra, A. K., Manasse, M. S.: Factoring by electronic mail. In Advances in Cryptology, Proc. of Eurocrypt '89 (Lecture Notes in Computer Science 434) (1990) J.-J. Quisquater and J. Vandewalle, Eds. Springer-Verlag pp. 355–371.
Micali, S.: Fair public-key cryptosystems. Presented at Crypto '92, Santa Barbara, California, U.S.A., to appear in Advances in Cryptology — Crypto '92, Proceedings (Lecture Notes in Computer Science), Springer-Verlag Augustus 16–20, 1992.
Morain, F.: Distributed primality proving and the primality of (23539 + 1)/3. In Advances in Cryptology, Proc. of Eurocrypt '90 (Lecture Notes in Computer Science 473) (1991) I. Damgård, Ed. Springer-Verlag pp. 110–123.
Newberry, M.: Active intruder Detection: Some Aspects of Computer Security and User Authentification. PhD thesis University of New South Wales, ADFA, Department of Computer Science Canberra, Australia 1991.
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In Proceedings of the 10-th Annual ACM Symp. on Principles of Distributed Computing (August 19–21, 1991) pp. 51–60.
Poras, P. A., Kemmerer, R. A.: Covert flow trees: a technique for identifying and analyzing covert storage channels. In Proc. of the 1991 IEEE Symposium on Security and Privacy (May 1991) IEEE Computer Society Press pp. 36–51.
Purdy, G. B.: A high security log-in procedure. Commun. ACM 17 (1974) 442–445.
Quisquater, J.-J.: Signatures, identifications et controles d'accès. Lecture given at INRIA (France) December 16, 1986.
Quisquater, J.-J., Delescaille, J.-P.: How easy is collision search? Application to DES. In Advances in Cryptology, Proc. of Eurocrypt '89 (Lecture Notes in Computer Science 434) (1990) J.-J. Quisquater and J. Vandewalle, Eds. Springer-Verlag pp. 429–434.
Quisquater, J.-J., Desmedt, Y. G.: Chinese lotto as an exhaustive code-breaking machine. Computer 24 (1991) 14–22.
Shamir, A.: How to share a secret. Commun. ACM 22 (1979) 612–613.
Simmons, G. J.: Verification of treaty compliance-revisited. In Proc. of the 1983 IEEE Symposium on Security and Privacy (April 25–27, 1983) IEEE Computer Society Press pp. 61–66.
Simmons, G. J.: The prisoners' problem and the subliminal channel. In Advances in Cryptology. Proc. of Crypto 83 (1984) D. Chaum, Ed. Plenum Press N.Y. pp. 51–67.
Simmons, G. J.: The subliminal channel and digital signatures. In Advances in Cryptology. Proc. of Eurocrypt 84 (Lecture Notes in Computer Science 209) (1985) T. Beth, N. Cot, and I. Ingemarsson, Eds. Springer-Verlag, Berlin pp. 364–378.
Simmons, G. J.: The secure subliminal channel (?). In Advances in Cryptology: Crypto '85, Proceedings (Lecture Notes in Computer Science 218) (1986) H. C. Williams, Ed. Springer-Verlag pp. 33–41.
Simmons, G. J.: How to insure that data acquired to verify treaty compliance are trustworthy. Proc. IEEE 76 (1988) 621–627.
Simmons, G. J.: Contemporary cryptology: A foreword. In Contemporary Cryptology, G. J. Simmons, Ed. IEEE Press 1992 pp. vii–xv.
Simmons, G. J.: An introduction to shared secret and/or shared control schemes and their application. In Contemporary Cryptology, G. J. Simmons, Ed. IEEE Press 1992 pp. 441–497.
T7001 random number generator. AT&T, Data Sheet May 1985.
U.S. Department of Defense. Department of Defense Trusted Computer System Evaluation Criteria August 15, 1983. Also known as the Orange Book.
White, S. R.: Covert distributed processing with computer viruses. In Advances in Cryptology — Crypto '89, Proceedings (Lecture Notes in Computer Science 435) (1990) G. Brassard, Ed. Springer-Verlag pp. 616–619.
Wilkes, M. V.: Time-Sharing computer systems. American Elsevier New York 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag
About this paper
Cite this paper
Desmedt, Y. (1992). Breaking the traditional computer security research barriers. In: Deswarte, Y., Eizenberg, G., Quisquater, JJ. (eds) Computer Security — ESORICS 92. ESORICS 1992. Lecture Notes in Computer Science, vol 648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013895
Download citation
DOI: https://doi.org/10.1007/BFb0013895
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56246-7
Online ISBN: 978-3-540-47488-3
eBook Packages: Springer Book Archive