Sebery J.Cryptography.An introduction to computer security.1989

References 661

490.J.G. Steiner, B.C. Neuman, and J.I. Schiller. Kerberos: An authentication service for open network systems. In Proceedings of the USENIX Winter Conference, pages 191{202, Dallas, TX, February 1988.

491.Jacques Stern. A new identi cation scheme based on syndrome decoding. In D.R. Stinson, editor, Advances in Cryptology (CRYPTO'93). Lecture Notes in Computer Science No. 773, pages 13{21. Springer, Berlin Heidelberg New York, 1994.

492.D.R. Stinson. Some constructions and bounds for authentication codes. In A.M. Odlyzko, editor, Advances in Cryptology - CRYPTO'86, Lecture Notes in Computer Science No. 263 pages 418{425. Springer, Berlin Heidelberg New York, 1987.

493.D.R. Stinson. A construction for authentication/secrecy codes from certain combinatorial designs. In Carl Pomerance, editor, Advances in Cryptology (CRYPTO'87). Lecture Notes in Computer Science No. 293, pages 355{366. Springer, Berlin Heidelberg New York, 1988.

494.D.R. Stinson. Combinatorial characterizations of authentication codes. In J. Feigenbaum, editor, Advances in Cryptology (CRYPTO'91). Lecture Notes in Computer Science No. 576, pages 62{73. Springer, Berlin Heidelberg New York, 1992.

495.D.R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography, 2:357{390, 1992.

496.D.R. Stinson. Combinatorial designs and cryptography. In Surveys in Combinatorics. London Mathematical Society Lecture Notes Series, Vol.187, pages 257{287. Cambridge University Press, Cambridge, 1993.

497.D.R. Stinson. Cryptography: Theory and Practice. CRC, Boka Raton, FL,, 1995.

498.M. Stonebraker. Implementation of integrity constraints and views by query modi cation. In Proceedings of International Conference on Management of Data (SIGMOD'75), pages 65{78.ACM, 1975.

499.A.P. Street and W.D. Wallis. Combinatorics: A First Course. CBRC, Winnipeg, 1982.

500.A. Tanenbaum. Computer Networks. Prentice-Hall, Englewood Cli s, NJ, 1981.

501.A. Tanenbaum. Distributed Operating Systems. Prentice-Hall, Englewood Cli s, NJ, 1995.

502.A. Tanenbaum and A. Woodhull. Operating Systems: Design and Implementation. Prentice-Hall, Englewood Cli s, NJ, 1997.

503.J. Tardo and K. Alagappan. SPX: global authentication using public key certi cates. In Proceedings of 12th IEEE Symposium on Research in Security and Privacy, pages 232{244. UEEE 1991.

504.W.T. Tener. Discovery: An expert system in the commercial data security environment. In Proceedings of the 4th IFIP TC11 International Conference on Security, pages 261{ 268, 1989.

505.H. Teng, K. Chen, and S. Lu. Security audit trail analysis using inductively generated predictive rules. In Proceedings of the 6th Conference on Arti cial Intelligence Applications, pages 24{29. IEEE, 1990.

506.H.S. Teng, K. Chen, and S.C. Lu. Adaptive real-time anomaly detection using inductively generated sequential patterns. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 278{284. IEEE, 1990.

662 References

507.M.B. Thuraisingham. A multilevel secure object-oriented data model. In Proceedings of the 12th National Computer Security Conference, pages 579{590. . NIST/NCSC, October 1989.

508.Jean-Pierre Tillich and Gilles Zemor. Hashing with sl2. In Y. Desmedt, editor, Advances in Cryptology (CRYPTO'94). Lecture Notes in Computer Science No. 839, pages 40{49. Springer, Berlin Heidelberg New York, 1994.

509.L. Tombak. New results on unconditionally secure authentication systems. PhD thesis, Department of Computer Science, University of Wollongong, Australia, 1995.

510.M. Tompa and H. Woll. How to share a secret with cheaters. Journal of Cryptology, 1(2):133{138, 1988.

511.R.P. Trueblood, H.R. Hartson, and J.J. Martin. MULTISAFE - a modular multiprocessing approach to secure database management. ACM Transactions on Database Systems, 8(3):382{409, 1983.

512.G. Tsudik. Message authentication with one-way hash functions. ACM SIGCOMM, Computer Communication Review, 22(5):29{38, October 1992.

513.E.M. Valcarce, G.W. Hoglund, L. Jansen, and L. Baillie. Essense: An experiment in knowledge-based security monitoring and control. In Proceedings of the 3rd USENIX Unix Security Symposium, pages 155{170, 1992.

514.J. van Tilburg. Security-Analysis of a Class of Cryptosystems Based on Linear ErrorCorrecting Codes. Royal PTT Nederland NV, PTT Research, Leidschendam, 1994.

515.S. von Solms and D. Naccache. On blind signatures and perfect crimes. Computers and Security, 11:581{583, 1992.

516.V.L. Voydock and S.T. Kent. Security mechanism in high-level network protocols. ACM Computing Surveys, 15(2):135{171, 1983.

517.N.R. Wagner. Shared database access using composed encryption keys. In Proceedings of the 1982 IEEE Symposium on Security and Privacy, pages 104{110. IEEE, 1982.

518.M. Walker. Information-theoretic bounds for authentication systems. Journal of Cryptology, 3(2):131{143, 1990.

519.W.D. Wallis, A. Penfold Street, and J. Seberry Wallis. Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Mathematics No. 292. Springer, Berlin Heidelbeg New York, 1972.

520.M. Wang and A. Goscinski. The development and testing of the identity-based conference key distribution system for the RHODOS distributed system. In Y. Deswarte, G. Eizenberg, and J.-J. Quisquater, editors, Proceedings of the Second European Symposium on Research in Computer Security (ESORICS'92). Lecture Notes in Computer Science No. 648, pages 209{228. Springer, Berlin Heidelberg New York, 1992.

521.R. Wang. Flash in the pan ? Virus Bulletin, August 1998. See http://www.virusbtn.com/VirusInformation/cih.html.

522.A.F. Webster and S.E. Tavares. On the design of S-boxes. In H.C. Williams, editor, Advances in Cryptology (CRYOTO'85). Lecture Notes in Computer Science No. 218 pages 523{534 Springer, Berlin Heidelberg New York, 1986.

523.M.N. Wegman and J.L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265{279, 1981.

References 663

524.W.R.E. Weiss and A. Baur. Analysis of audit and protocol data using methods from arti cial intelligence. In Proceedings of the 13th National Computer Security Conference, pages 109{114, 1990.

525.D.L. Wells and C.M. Eastman. A preliminary study of traÆc analysis in encrypted databases. In E.L. Gallizzi, J. Elam, and R.H. Sprague Jr. , editors, Proceedings of the 18th Hawaii International Conference on System Sciences 1985, pages 373{382. Hawaii International Conference on System Sciences, Honolulu, 1985.

526.I. Whalley. Hare krsna: ISKCON too far! Virus Bulletin, August 1996.

527.G.B. White, E.A. Fish, and U.W. Pooch. Cooperating security managers: A peer-based intrusion detection system. IEEE Network, 10(1):20{23, 1996.

528.R.A. Whitehurst and T.F. Lunt. The SeaView veri cation. In Proceedings of the 2nd Workshop on Foundations of Computer Security, pages 125{132. IEEE, 1989.

529.M.J. Wiener. EÆcient DES key search. Presented at Crypto'93 rump session, August 20, 1993.

530.H.S. Wilf. Algorithms and Complexity. Prentice-Hall, Englewood Cli s, NJ, 1986.

531.K. Wilkinson, P. Lyngbaek, and W. Hasan. The Iris architecture and implementation.

IEEE Transaction on Knowledge and Data Engineering, 2(1):63{75, 1990.

532.H.C. Williams. A modi cation of the RSA public-key encryption procedure. IEEE Transactions on Information Theory, IT-26(6):726{729, November 1980.

533.H.C. Williams. An m3 public-key encryption scheme. In H.C. Williams, editor, Advances in Cryptology - CRYPTO'85, Lecture Notes in Computer Science No. 218, pages 358{ 368. Springer, Berlin Heidelberg New York, 1986.

534.C.P. Williams and S.H. Clearwater. Explorations in Quantum Computing. Springer, Berlin Heidelberg New York, 1998.

535.J. Wilson. Views as the security objects in a multilevel secure relational database management system. In Proceedings of the 1988 IEEE Symposium on Security and Privacy, pages 70{84. IEEE, 1988.

536.J.R. Winkler. A unix prototype for intrusion and anomaly detection in secure networks. In Proceedings of the 13th National Computer Security Conference, pages 115{124, 1990.

537.J.R. Winkler and L.C Landry. Intrusion and anomaly detection, ISOA update. In

Proceedings of the 15th National Computer Security Conference, pages 272{281, 1992.

538.R.S. Winternitz. Producing a one-way hash function from DES. In D. Chaum, editor,

Advances in Cryptology (CRYPTO'83), pages 203{207. Plenum, New York.

539.J. Wood and D.H. Barnes. A practical distributed secure system. In System Security { The Technical Challenge: Proceedings of the International Conference, pages 49{60, London, October 1985. Online, London.

540.W. Wulf, R. Levin, and S. Harbison. Hydra: An Experimental Computer System. McGraw-Hill, New York, 1981.

541.A.C. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pages 80{91. IEEE, 1982.

542.R. Yarlagadda and J.E. Hershey. Analysis and synthesis of bent sequences. IEE Proceedings (Part E), 136:112{123, 1989.

664 References

543.D.M. Zamboni. Saint: security analysis integration tool. In Proceedings of the Systems Administration, Networking and Security Conference, 1996.

544.C. Zaniolo. Design of relational views over network schemas. In P.A. Bernstein, editor,

Proceedings of ACM International Conference on Management of Data (SIGMOD'79), pages 179{190, ACM, Boston, 1979

545.Y. Zheng, T. Hardjono, and J. Pieprzyk. The sibling intractable function family (SIFF): notion, construction and applications. IEICE Trans. Fundamentals, E76-A:4{13, January 1993.

546.Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. In Advances in Cryptology (EUROCRYPT'89). Lecture Notes in Computer Science No. 434, pages 412{422. Springer, Berlin Heidelberg New York, 1989.

547.Y. Zheng, T. Matsumoto, and H. Imai. Structural properties of one-way hash functions. In A.J. Menezes and S.A. Vanstone, editors, Advances in Cryptology (CRYPTO'90), pages 285{302. Lecture Notes in Computer Science No. 537. Springer, Berlin Heidelberg New York, 1991.

548.Y. Zheng, J. Pieprzyk, and J. Seberry. HAVAL { A one-way hashing algorithm with variable length of output. In J. Seberry and Y. Zheng, editors, Advances in Cryptology (AUSCRYPT'92). Lecture Notes on Computer Science No. 718, pages 83{104. Springer, Berlin Heidelberg New York, 1993.