Search results

1 – 10 of over 3000
Article
Publication date: 4 April 2016

Anneke Soraya Hidayat, Gil-Je Lee, Eun-Jun Yoon and Kee-Young Yoo

The detection of an adversary in secret image sharing has been a problematic side in the reconstruction phase. Some of verifiable secret sharing solutions have been proposed to…

Abstract

Purpose

The detection of an adversary in secret image sharing has been a problematic side in the reconstruction phase. Some of verifiable secret sharing solutions have been proposed to solve the problem. However, there is some computational limitation in the previous schemes. The purpose of this paper is to analyze the importance of consistency for detecting an adversary in a secure reconstruction phase. Strong t-consistency assures the correctness of reconstructed secret as long as participants P ∈ N and n(P) = t. Consistency is a solution for preventing the participant to be absent and helps the dealer to easily detect the adversary without an additional verification step.

Design/methodology/approach

This paper focuses on secure reconstruction, and uses two different approaches, namely, single-secret and multi-secret, to experiment the relationship between the given variable (t,m,n) and the adversaries by observing the quality test result, polynomial approach and visualization.

Findings

The results show that t and m are inversely proportional to the image quality without respect to the polynomial approach. The reconstruction phase is declared as securely conducted when m = 2t − 1, for both single- and multi-secret approaches.

Originality/value

The application of consistency is a considerable step for securing the secret from an adversary by combining the reconstruction phase and the consistency combination at once, removing the need for additional separate verification steps for decreasing the computational time, especially in secret image sharing.

Details

International Journal of Pervasive Computing and Communications, vol. 12 no. 1
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 3 May 2011

Doru Tsaganea

The purpose of this paper is to explain the tendency of escalation of a regular bilateral arms race, or the arms race spiral.

132

Abstract

Purpose

The purpose of this paper is to explain the tendency of escalation of a regular bilateral arms race, or the arms race spiral.

Design/methodology/approach

Inspired by the Richardson‐type models, a system of two differential equations is used for describing a bilateral arms race. But the variation of one adversary's armaments and/or military expenditures is not associated with the amount of the other's armaments and/or military expenditures as it is usually done in this type of model. It is linked instead with their variation, as it practically happens in governments' decision‐making processes.

Findings

The association of the two variations suggests that when one adversary tends to match the increase of the other's armaments and/or military expenditures, these tend to increase to infinity for a given fixed point in time.

Originality/value

The mathematical result indicates that the tendency of completely matching the increase of adversary's armaments or military expenditures acts as an accelerator that causes the continuous escalation of the arms race. Therefore, as long as a substantial change in the relationship between the two adversaries – implying a complete change of the model's coefficients – does not happen, the arms race escalates, and the so‐called spiral is observed.

Book part
Publication date: 7 October 2010

Patrick T. Hester and Sankaran Mahadevan

This chapter develops a methodology to assist critical facility operators in designing physical protection systems to defend against a single adversary (thief, saboteur…

Abstract

This chapter develops a methodology to assist critical facility operators in designing physical protection systems to defend against a single adversary (thief, saboteur, terrorist, etc.) attack. The developed methodology utilizes a multicriteria decision-making approach that balances the competing goals of minimal security system cost and maximum system performance. The methodology utilizes a network-based approach to facility security system design and analysis, which locates physical protection (detection, delay, and response) elements throughout a facility. These elements enable the facility owner to prevent attacks through deterrence and to defeat the adversary if he or she chooses to attack. The developed approach results in the ability for the facility operator to assess relative facility and/or infrastructure safety, and make decisions regarding how to optimally allocate resources for physical protection elements to balance cost and performance. A hypothetical example is discussed which demonstrates the usefulness of the developed methodology.

Details

Applications in Multicriteria Decision Making, Data Envelopment Analysis, and Finance
Type: Book
ISBN: 978-0-85724-470-3

Article
Publication date: 1 February 1994

Mark E. Keating, Dean G. Pruitt, Rachael A. Eberle and Joseph M. Mikolic

A variety of strategies were identified in interview‐based chronologies of ordinary interpersonal conflicts. Verbal confrontation with the adversary was the most common strategy…

Abstract

A variety of strategies were identified in interview‐based chronologies of ordinary interpersonal conflicts. Verbal confrontation with the adversary was the most common strategy and usually preceded other approaches. Efforts to arrange mediation and arbitration were extremely rare, though third parties were approached for other reasons in most of the cases. It was possible to distinguish complainants from respondents in 61 percent of the cases. Respondents employed more problem solving and apology than complainants, while complainants employed marginally more pressure tactics.

Details

International Journal of Conflict Management, vol. 5 no. 2
Type: Research Article
ISSN: 1044-4068

Article
Publication date: 30 August 2022

Trung Ha and Tran Khanh Dang

In the digital age, organizations want to build a more powerful machine learning model that can serve the increasing needs of people. However, enhancing privacy and data security…

Abstract

Purpose

In the digital age, organizations want to build a more powerful machine learning model that can serve the increasing needs of people. However, enhancing privacy and data security is one of the challenges for machine learning models, especially in federated learning. Parties want to collaborate with each other to build a better model, but they do not want to reveal their own data. This study aims to introduce threats and defenses to privacy leaks in the collaborative learning model.

Design/methodology/approach

In the collaborative model, the attacker was the central server or a participant. In this study, the attacker is on the side of the participant, who is “honest but curious.” Attack experiments are on the participant’s side, who performs two tasks: one is to train the collaborative learning model; the second task is to build a generative adversarial networks (GANs) model, which will perform the attack to infer more information received from the central server. There are three typical types of attacks: white box, black box without auxiliary information and black box with auxiliary information. The experimental environment is set up by PyTorch on Google Colab platform running on graphics processing unit with labeled faces in the wild and Canadian Institute For Advanced Research-10 data sets.

Findings

The paper assumes that the privacy leakage attack resides on the participant’s side, and the information in the parameter server contains too much knowledge to train a collaborative machine learning model. This study compares the success level of inference attack from model parameters based on GAN models. There are three GAN models, which are used in this method: condition GAN, control GAN and Wasserstein generative adversarial networks (WGAN). Of these three models, the WGAN model has proven to obtain the highest stability.

Originality/value

The concern about privacy and security for machine learning models are more important, especially for collaborative learning. The paper has contributed experimentally to private attack on the participant side in the collaborative learning model.

Details

International Journal of Web Information Systems, vol. 18 no. 2/3
Type: Research Article
ISSN: 1744-0084

Keywords

Book part
Publication date: 15 July 2020

Yvonne R. Masakowski

Advances in Artificial Intelligence (AI) technologies and Autonomous Unmanned Vehicles are shaping our daily lives, society, and will continue to transform how we will fight…

Abstract

Advances in Artificial Intelligence (AI) technologies and Autonomous Unmanned Vehicles are shaping our daily lives, society, and will continue to transform how we will fight future wars. Advances in AI technologies have fueled an explosion of interest in the military and political domain. As AI technologies evolve, there will be increased reliance on these systems to maintain global security. For the individual and society, AI presents challenges related to surveillance, personal freedom, and privacy. For the military, we will need to exploit advances in AI technologies to support the warfighter and ensure global security. The integration of AI technologies in the battlespace presents advantages, costs, and risks in the future battlespace. This chapter will examine the issues related to advances in AI technologies, as we examine the benefits, costs, and risks associated with integrating AI and autonomous systems in society and in the future battlespace.

Details

Artificial Intelligence and Global Security
Type: Book
ISBN: 978-1-78973-812-4

Keywords

Article
Publication date: 10 October 2022

Nidhi Sharma and Ravindara Bhatt

Privacy preservation is a significant concern in Internet of Things (IoT)-enabled event-driven wireless sensor networks (WSNs). Low energy utilization in the event-driven system…

Abstract

Purpose

Privacy preservation is a significant concern in Internet of Things (IoT)-enabled event-driven wireless sensor networks (WSNs). Low energy utilization in the event-driven system is essential if events do not happen. When events occur, IoT-enabled sensor network is required to deal with enormous traffic from the concentration of demand data delivery. This paper aims to explore an effective framework for safeguarding privacy at source in event-driven WSNs.

Design/methodology/approach

This paper discusses three algorithms in IoT-enabled event-driven WSNs: source location privacy for event detection (SLP_ED), chessboard alteration pattern (SLP_ED_CBA) and grid-based source location privacy (GB_SLP). Performance evaluation is done using simulation results and security analysis of the proposed scheme.

Findings

The sensors observe bound events or sensitive items within the network area in the field of interest. The open wireless channel lets an opponent search traffic designs, trace back and reach the start node or the event-detecting node. SLP_ED and SLP_ED_CBA provide better safety level results than dynamic shortest path scheme and energy-efficient source location privacy protection schemes. This paper discusses security analysis for the GB_SLP. Comparative analysis shows that the proposed scheme is more efficient on safety level than existing techniques.

Originality/value

The authors develop the privacy protection scheme in IoT-enabled event-driven WSNs. There are two categories of occurrences: nominal events and critical events. The choice of the route from source to sink relies on the two types of events: nominal or critical; the privacy level required for an event; and the energy consumption needed for the event. In addition, phantom node selection scheme is designed for source location privacy.

Details

International Journal of Pervasive Computing and Communications, vol. 19 no. 5
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 18 October 2019

Hamid Mohtadi and Bryan Weber

The proliferation of terrorism worldwide raises the risk that terrorist strategies could evolve from conventional methods (e.g. suicide attacks) to biological, chemical and even…

Abstract

Purpose

The proliferation of terrorism worldwide raises the risk that terrorist strategies could evolve from conventional methods (e.g. suicide attacks) to biological, chemical and even radioactive and nuclear attacks (commonly abbreviated as CBRN) which are potentially much more dangerous. The authors make three contributions toward a better understanding of this risk and how it responds to counterterrorism measures.

Design/methodology/approach

The authors develop a game that captures the terrorists’ potential strategic substitution between conventional and CBRN-type attacks; the authors calibrate the parameters of the game to real data using a novel calibration method and a partially unique dataset; they estimate the heavy-tailed distribution of attack severity and thus the probability of a successful attack, the underlying effort to launch an attack and the intrinsic difficulty of launching different types of attacks.

Findings

The authors find that in equilibrium, CBRN attacks, though less likely and more difficult to execute, are more deadly. In the end, the trade-off between, on one hand, the greater difficulty of carrying out a CBRN attack, and on the other, the greater deadliness of such an attack, points to a level of optimal counterterrorism spending by governments that weighs toward defending against CBRN attacks. The authors discuss these results and compare them with the actual level of counterterrorism spending by the US Government.

Originality/value

The framework of the game allows for substitution between the conventional and CBRN weapon types. These aspects of this paper, together with the unique calibration methodology, and the use of some unique terrorism data for the first time, are what distinguish this work from similar game theoretic papers in this area.

Details

Indian Growth and Development Review, vol. 13 no. 2
Type: Research Article
ISSN: 1753-8254

Keywords

Article
Publication date: 5 September 2016

Aisha Aseeri and Omaimah Bamasag

In the past few years, HB-like protocols have gained much attention in the field of lightweight authentication protocols due to their efficient functioning and large potential…

Abstract

Purpose

In the past few years, HB-like protocols have gained much attention in the field of lightweight authentication protocols due to their efficient functioning and large potential applications in low-cost radio frequency identification tags, which are on the other side spreading so fast. However, most published HB protocols are vulnerable to man-in-the-middle attacks such as GRS or OOV attacks. The purpose of this research is to investigate security issues pertaining to HB-like protocols with an aim of improving their security and efficiency.

Design/methodology/approach

In this paper, a new and secure variant of HB family protocols named HB-MP* is proposed and designed, using the techniques of random rotation. The security of the proposed protocol is proven using formal proofs. Also, a prototype of the protocol is implemented to check its applicability, test the security in implementation and to compare its performance with the most related protocol.

Findings

The HB-MP* protocol is found secure against passive and active adversaries and is implementable within the tight resource constraints of today’s EPC-type RFID tags. Accordingly, the HB-MP* protocol provides higher security than previous HB-like protocols without sacrificing performance.

Originality/value

This paper proposes a new HB variant called HB-MP* that tries to be immune against the pre-mentioned attacks and at the same time keeping the simple structure. It will use only lightweight operations to randomize the rotation of the secret.

Details

International Journal of Pervasive Computing and Communications, vol. 12 no. 3
Type: Research Article
ISSN: 1742-7371

Keywords

Article
Publication date: 1 June 1997

Zhengxin Chen

Examines the relationship between systems and their users from the knowledge discovery perspective. Recently knowledge discovery in databases has made important progress, but it…

539

Abstract

Examines the relationship between systems and their users from the knowledge discovery perspective. Recently knowledge discovery in databases has made important progress, but it may also bring some potential problems to database design, such as issues related to database security, as an unauthorized user may derive highly sensitive knowledge from unclassified data. There is a need for a comprehensive study on knowledge discovery in human‐computer symbiosis. Borrowing terms from algorithm design and artificial intelligence literature, proposes a notion called database‐user adversarial partnership. This notion is general enough to cover various knowledge discovery and security issues related to databases and their users. Furthermore, the notion of database‐user adversarial partnership can be further generalized into system‐user adversarial partnership. Opportunities provided by knowledge discovery techniques and potential social implications are discussed and illustrated by examples.

Details

Kybernetes, vol. 26 no. 4
Type: Research Article
ISSN: 0368-492X

Keywords

1 – 10 of over 3000