Skip to main content

Granular Computing on Binary Relations Analysis of Conflict and Chinese Wall Security Policy

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2475))

Abstract

In this paper, a study of the granular computing on binary relations is presented. The result is applied to the analysis of conflict of interests relation(CIR) and the Chinese wall security policy (CWSP).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David D. C. Brewer and Michael J. Nash: “The Chinese Wall Security Policy” IEEE Symposium on Security and Privacy, Oakland, May, 1988, pp. 206–214

    Google Scholar 

  2. T. Y. Lin, “Chinese Wall Security Policy-An Aggressive Model”, Proceedings of the Fifth Aerospace Computer Security Application Conference, December 4–8, 1989, pp. 286–293.

    Google Scholar 

  3. T. Y. Lin “Granular Computing on Binary Relations I: Data Mining and Neighborhood Systems.” In: Rough Sets In Knowledge Discovery, A. Skoworn and L. Polkowski (eds), Physica-Verlag, 1998, 107–121

    Google Scholar 

  4. T. Y. Lin “Chinese Wall Security Model and Conflict Analysis,” the 24th IEEE Computer Society International Computer Software and Applications Conference (Compsac2000) Taipei, Taiwan, Oct 25–27, 2000

    Google Scholar 

  5. Z. Pawlak, “On Conflicts,” Int J. of Man-Machine Studies, 21 pp. 127–134, 1984

    Article  MATH  Google Scholar 

  6. Z. Pawlak, Analysis of Conflicts, Joint Conference of Information Science, Research Triangle Park, North Carolina, March 1–5, 1997, 350–352.

    Google Scholar 

  7. Polkowski, L., Skowron, A., and Zytkow, J., (1995), Tolerance based rough sets. In: T.Y. Lin and A. Wildberger (eds.), Soft Computing: Rough Sets, Fuzzy Logic Neural Networks, Uncertainty Management, Knowledge Discovery, Simulation Councils, Inc. San Diego CA, 1995, 55–58.

    Google Scholar 

  8. Lotfi A. Zadeh “Some Reflections on Information Granulation and its Centrality in Granular Computing, Computing with Words, the Computational Theory of Perceptions and Precisiated Natural Language,” In: Data Mining, Rough Sets and Granular Computing, T. Y. Lin, Y. Y. Yao, L. Zadeh (eds), Physica-Verlag, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, T.Y. (2002). Granular Computing on Binary Relations Analysis of Conflict and Chinese Wall Security Policy. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds) Rough Sets and Current Trends in Computing. RSCTC 2002. Lecture Notes in Computer Science(), vol 2475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45813-1_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-45813-1_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44274-5

  • Online ISBN: 978-3-540-45813-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics