DISTRIBUTED CONTINGENCY LOGIC AND SECURITY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

RAMEZANIAN RAHIM

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2018 | Volume:10 | Issue:2 Page(s): 107-115

Download Full-Text

Persian Verion

View:

587

Download:

309

Cites:

Information Journal Paper

Title

DISTRIBUTED CONTINGENCY LOGIC AND SECURITY

Author(s)

RAMEZANIAN RAHIM | Issue Writer Certificate

Keywords

CONTINGENCY LOGICQ1

DISTRIBUTED CONTINGENCYQ1

SECRET SHARINGQ1

MITM ATTACKQ1

Abstract

In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper we propose distributed CONTINGENCY LOGIC, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingent in a group of agent if and only if it is not follow from the knowledge of all individual agents put together. We formalize SECRET SHARING scheme (a security property that is built upon ignorance of all agents), and a man in the middle attack to a weak protocol in our logic. We also illustrate a condition where disclose a secret may hide another one for ever. Finally we prove the main theorems of every logics, soundness and completeness. We also prove that the distributed CONTINGENCY LOGIC is more expressive than the classical CONTINGENCY LOGIC and the epistemic logic.

Cites

No record.

References

No record.

Cite

APA: Copy

RAMEZANIAN, RAHIM. (2018). DISTRIBUTED CONTINGENCY LOGIC AND SECURITY. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 10(2 ), 107-115. SID. https://sid.ir/paper/241807/en

Vancouver: Copy

RAMEZANIAN RAHIM. DISTRIBUTED CONTINGENCY LOGIC AND SECURITY. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2018;10(2 ):107-115. Available from: https://sid.ir/paper/241807/en

IEEE: Copy

RAHIM RAMEZANIAN, “DISTRIBUTED CONTINGENCY LOGIC AND SECURITY,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 10, no. 2 , pp. 107–115, 2018, [Online]. Available: https://sid.ir/paper/241807/en

Related Journal Papers