Saeideh Kabirirad - Profile on Academia.edu (original) (raw)

Papers by Saeideh Kabirirad

A Blockchain-Based Approach for Data Storage in Drug Supply Chain

2023 9th International Conference on Web Research (ICWR)

Traceability and auditability are essential features in supply chain management and construction.... more Traceability and auditability are essential features in supply chain management and construction. However, from the customers' perspective, trust is the most critical aspect of these systems. Additionally, relying on third parties for trade in centralized systems is indispensable. Blockchain-based drug traceability provides a potential solution to create a platform for an immutable, trustworthy, accountable, and transparent system in the pharmaceutical supply chain. Furthermore, we present a model for storing pharmaceutical supply chain data using blockchain, which leverages the key advantages of blockchain and smart contracts. Our proposed solution is based on hyperledger Besu and is complete and cost-effective in terms of the privacy and confidentiality of the blockchain network. Additionally, our proposed model addresses the challenges of storing large data in the blockchain, which we intend to solve by using the IPFS storage system. In such a system, instead of storing big data, we store their abstracts in the blockchain to reduce the load pressure of the chain and realize efficient information queries.

Forgery Attack on An Outsourced Attribute-Based Signature Scheme

2022 27th International Computer Conference, Computer Society of Iran (CSICC)

Another Security Weakness in an Authenticated Group Key Agreement

Journal of Internet Technology, 2010

Recently, Hwang et al. [1] showed that the authenticated group key agreement protocol proposed by... more Recently, Hwang et al. [1] showed that the authenticated group key agreement protocol proposed by Dutta and Barua [2] suffers from an impersonation attack and proposed an improvement to fix the problem. The goal of this paper is to prove that both the scheme of [2] and its improved version have another security weakness. In [2], it is claimed that the protocol has the ability to detect the presence of a corrupted group member so that if an invalid message is sent, then this can be detected by all legitimate members of the group. In this paper, we show that this claim is not true even in the improved version. We prove that two malicious participants can prohibit legitimate participants from obtaining the same shared key and remain completely unnoticed.

High-speed GPU implementation of a secret sharing scheme based on cellular automata

The Journal of Supercomputing, 2019

Parallel implementation provides a solution for the problem of accelerating cellular automata (CA... more Parallel implementation provides a solution for the problem of accelerating cellular automata (CA)-based secret sharing schemes and make them appropriate for bulk data sharing and real-time applications. By presenting new platforms, we need new implementation techniques to run algorithms as fast as possible on the platform. In this paper, we present a new implementation of a CA-based secret sharing scheme using the Graphic Processing Unit (GPU). We propose a new data arrangement that reduces the total number of accesses to the memories in GPU. Our algorithm further reduces the amount of data required by each thread and at the same time achieves a high cache hit rate. Also, it can achieve coalesced memory accesses to optimal use of the global memory bandwidth. The proposed method obtains speedup up to four times faster than the best previous GPU implemented CA-based multi-secret sharing schemes.

Wireless Personal Communications, 2010

In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participant... more In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t -1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if nt of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage,

THIRD INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2019), 2019

Cellular automata (CA) are discrete dynamical system formed by a finite array of identical object... more Cellular automata (CA) are discrete dynamical system formed by a finite array of identical objects called cells. Each cell is endowed with a state which changes at every time-step depending on the states of its adjacent cells at previous time-steps. This feature provides confusion and therefore makes CA attractive in cryptography. This paper presents an authenticated image encryption algorithm based on CA. To accelerate the process, we divide the image into blocks and use a permutation algorithm to apply chaos on the blocks and then use CA-based algorithm to change the pixels. The authentication mechanism of our scheme, adjustable to the desired level, can detect slight tampering in the cipher image before full decryption. Existing image encryption schemes usually cannot provide parallel processing capability and high sensitivity to changes simultaneously. This study tries to overcome this drawback as well. We show that our proposal fulfills desired security properties including large key space and robustness against statistical, differential and chosen-plaintext attacks.

IACR Cryptol. ePrint Arch., 2015

Recently an image encryption scheme based on chaotic maps and memory cellular automata has been p... more Recently an image encryption scheme based on chaotic maps and memory cellular automata has been proposed. In this paper, the security of the scheme is evaluated and it is demonstrated that the scheme can be broken by chosen plain-text attack. Having one or more monochrome plain-images and their corresponding cipherimages, a part of key-stream can be retrieved. Furthermore, it is discovered that the scheme can be broken by brute search attack with efficient time complexity, and it is also vulnerable to differential attack. Meanwhile, we provide experimental results to support the proposed attacks and suggest several improvements to make scheme stronger.

A (t,n)-multi secret image sharing scheme based on Boolean operations

Journal of Visual Communication and Image Representation

Abstract In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are s... more Abstract In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are shared among n users so that participation of at least t of them is needed to recover the shared images. Due to the high volume of images and computing complexity of secret sharing schemes, recent Boolean-based approaches are highly desirable. Unfortunately, to the best of our knowledge, existing literature on Boolean-based MSIS schemes only supports two cases: ( 2 , n ) and ( n , n ) . In ( n , n ) -schemes, we lose fault tolerancy such that in the absence of even one share, secret images can not be recovered. On the other hand, ( 2 , n ) -MSIS seems to be quite restrictive for the wide range of applications that might occur in practice. It is therefore a challenging problem to propose a Boolean-based ( t , n ) -MSIS for t ≠ 2 , n . The aim of this paper is to solve this problem. We further provide formal proofs of security as well as comparison with existing literature.

The most important security concern in group key exchange protocols is the semantic security of t... more The most important security concern in group key exchange protocols is the semantic security of the produced shared key which dictates that outsiders should not be able to learn anything about the key. It is also challenging for these protocols to retain their security even in the presence of dishonest insiders who do not follow the protocol specifications. In this paper, we propose an identitybased group key exchange protocol which addresses these security concerns. We prove that our scheme achieves semantic security in a well-known adversarial model. We then show that the success probability of recognizing dishonest insiders in the proposed scheme is almost one. We further provide a comparison between our protocol and some other schemes in terms of computation and communication cost, as well as security properties.

Int. J. Netw. Secur., 2016

The most important security concern in group key exchange protocols is the semantic security of t... more The most important security concern in group key exchange protocols is the semantic security of the produced shared key which dictates that outsiders should not be able to learn anything about the key. It is also challenging for these protocols to retain their security even in the presence of dishonest insiders who do not follow the protocol specifications. In this paper, we propose an identity-based group key exchange protocol which addresses these security concerns. We prove that our scheme achieves semantic security in a well-known adversarial model. We then show that the success probability of recognizing dishonest insiders in the proposed scheme is almost one. We further provide a comparison between our protocol and some other schemes in terms of computation and communication cost, as well as security properties.

High-speed GPU implementation of a secret sharing scheme based on cellular automata

The Journal of Supercomputing

Parallel implementation provides a solution for the problem of accelerating cellular automata (CA... more Parallel implementation provides a solution for the problem of accelerating cellular automata (CA)-based secret sharing schemes and make them appropriate for bulk data sharing and real-time applications. By presenting new platforms, we need new implementation techniques to run algorithms as fast as possible on the platform. In this paper, we present a new implementation of a CA-based secret sharing scheme using the Graphic Processing Unit (GPU). We propose a new data arrangement that reduces the total number of accesses to the memories in GPU. Our algorithm further reduces the amount of data required by each thread and at the same time achieves a high cache hit rate. Also, it can achieve coalesced memory accesses to optimal use of the global memory bandwidth. The proposed method obtains speedup up to four times faster than the best previous GPU implemented CA-based multi-secret sharing schemes.

Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations

Journal of Information Security and Applications

A Blockchain-Based Approach for Data Storage in Drug Supply Chain

2023 9th International Conference on Web Research (ICWR)

Traceability and auditability are essential features in supply chain management and construction.... more Traceability and auditability are essential features in supply chain management and construction. However, from the customers' perspective, trust is the most critical aspect of these systems. Additionally, relying on third parties for trade in centralized systems is indispensable. Blockchain-based drug traceability provides a potential solution to create a platform for an immutable, trustworthy, accountable, and transparent system in the pharmaceutical supply chain. Furthermore, we present a model for storing pharmaceutical supply chain data using blockchain, which leverages the key advantages of blockchain and smart contracts. Our proposed solution is based on hyperledger Besu and is complete and cost-effective in terms of the privacy and confidentiality of the blockchain network. Additionally, our proposed model addresses the challenges of storing large data in the blockchain, which we intend to solve by using the IPFS storage system. In such a system, instead of storing big data, we store their abstracts in the blockchain to reduce the load pressure of the chain and realize efficient information queries.

Forgery Attack on An Outsourced Attribute-Based Signature Scheme

2022 27th International Computer Conference, Computer Society of Iran (CSICC)

Another Security Weakness in an Authenticated Group Key Agreement

Journal of Internet Technology, 2010

Recently, Hwang et al. [1] showed that the authenticated group key agreement protocol proposed by... more Recently, Hwang et al. [1] showed that the authenticated group key agreement protocol proposed by Dutta and Barua [2] suffers from an impersonation attack and proposed an improvement to fix the problem. The goal of this paper is to prove that both the scheme of [2] and its improved version have another security weakness. In [2], it is claimed that the protocol has the ability to detect the presence of a corrupted group member so that if an invalid message is sent, then this can be detected by all legitimate members of the group. In this paper, we show that this claim is not true even in the improved version. We prove that two malicious participants can prohibit legitimate participants from obtaining the same shared key and remain completely unnoticed.

High-speed GPU implementation of a secret sharing scheme based on cellular automata

The Journal of Supercomputing, 2019

Parallel implementation provides a solution for the problem of accelerating cellular automata (CA... more Parallel implementation provides a solution for the problem of accelerating cellular automata (CA)-based secret sharing schemes and make them appropriate for bulk data sharing and real-time applications. By presenting new platforms, we need new implementation techniques to run algorithms as fast as possible on the platform. In this paper, we present a new implementation of a CA-based secret sharing scheme using the Graphic Processing Unit (GPU). We propose a new data arrangement that reduces the total number of accesses to the memories in GPU. Our algorithm further reduces the amount of data required by each thread and at the same time achieves a high cache hit rate. Also, it can achieve coalesced memory accesses to optimal use of the global memory bandwidth. The proposed method obtains speedup up to four times faster than the best previous GPU implemented CA-based multi-secret sharing schemes.

Wireless Personal Communications, 2010

In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participant... more In a (t, n)-threshold multi-secret sharing scheme, several secrets are shared among n participants in such a way that any t (or more) of them can reconstruct the secrets while a group of (t -1) can not obtain any information. Therefore, when such schemes are used to distribute sensitive information over a network, fault tolerance property is achieved since even if nt of the nodes go out of function, the remaining t nodes suffice to recover the information. In 2009, Wang et al. proposed a verifiable (t, n)-threshold multi-secret sharing scheme (WTS) based on elliptic curves in which the secrets can change periodically [Wireless Pers. Commun., Springer-Verlage,

THIRD INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2019), 2019

Cellular automata (CA) are discrete dynamical system formed by a finite array of identical object... more Cellular automata (CA) are discrete dynamical system formed by a finite array of identical objects called cells. Each cell is endowed with a state which changes at every time-step depending on the states of its adjacent cells at previous time-steps. This feature provides confusion and therefore makes CA attractive in cryptography. This paper presents an authenticated image encryption algorithm based on CA. To accelerate the process, we divide the image into blocks and use a permutation algorithm to apply chaos on the blocks and then use CA-based algorithm to change the pixels. The authentication mechanism of our scheme, adjustable to the desired level, can detect slight tampering in the cipher image before full decryption. Existing image encryption schemes usually cannot provide parallel processing capability and high sensitivity to changes simultaneously. This study tries to overcome this drawback as well. We show that our proposal fulfills desired security properties including large key space and robustness against statistical, differential and chosen-plaintext attacks.

IACR Cryptol. ePrint Arch., 2015

Recently an image encryption scheme based on chaotic maps and memory cellular automata has been p... more Recently an image encryption scheme based on chaotic maps and memory cellular automata has been proposed. In this paper, the security of the scheme is evaluated and it is demonstrated that the scheme can be broken by chosen plain-text attack. Having one or more monochrome plain-images and their corresponding cipherimages, a part of key-stream can be retrieved. Furthermore, it is discovered that the scheme can be broken by brute search attack with efficient time complexity, and it is also vulnerable to differential attack. Meanwhile, we provide experimental results to support the proposed attacks and suggest several improvements to make scheme stronger.

A (t,n)-multi secret image sharing scheme based on Boolean operations

Journal of Visual Communication and Image Representation

Abstract In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are s... more Abstract In ( t , n ) -multi secret image sharing (MSIS) schemes, a number of secret images are shared among n users so that participation of at least t of them is needed to recover the shared images. Due to the high volume of images and computing complexity of secret sharing schemes, recent Boolean-based approaches are highly desirable. Unfortunately, to the best of our knowledge, existing literature on Boolean-based MSIS schemes only supports two cases: ( 2 , n ) and ( n , n ) . In ( n , n ) -schemes, we lose fault tolerancy such that in the absence of even one share, secret images can not be recovered. On the other hand, ( 2 , n ) -MSIS seems to be quite restrictive for the wide range of applications that might occur in practice. It is therefore a challenging problem to propose a Boolean-based ( t , n ) -MSIS for t ≠ 2 , n . The aim of this paper is to solve this problem. We further provide formal proofs of security as well as comparison with existing literature.

The most important security concern in group key exchange protocols is the semantic security of t... more The most important security concern in group key exchange protocols is the semantic security of the produced shared key which dictates that outsiders should not be able to learn anything about the key. It is also challenging for these protocols to retain their security even in the presence of dishonest insiders who do not follow the protocol specifications. In this paper, we propose an identitybased group key exchange protocol which addresses these security concerns. We prove that our scheme achieves semantic security in a well-known adversarial model. We then show that the success probability of recognizing dishonest insiders in the proposed scheme is almost one. We further provide a comparison between our protocol and some other schemes in terms of computation and communication cost, as well as security properties.

Int. J. Netw. Secur., 2016

The most important security concern in group key exchange protocols is the semantic security of t... more The most important security concern in group key exchange protocols is the semantic security of the produced shared key which dictates that outsiders should not be able to learn anything about the key. It is also challenging for these protocols to retain their security even in the presence of dishonest insiders who do not follow the protocol specifications. In this paper, we propose an identity-based group key exchange protocol which addresses these security concerns. We prove that our scheme achieves semantic security in a well-known adversarial model. We then show that the success probability of recognizing dishonest insiders in the proposed scheme is almost one. We further provide a comparison between our protocol and some other schemes in terms of computation and communication cost, as well as security properties.

High-speed GPU implementation of a secret sharing scheme based on cellular automata

The Journal of Supercomputing

Parallel implementation provides a solution for the problem of accelerating cellular automata (CA... more Parallel implementation provides a solution for the problem of accelerating cellular automata (CA)-based secret sharing schemes and make them appropriate for bulk data sharing and real-time applications. By presenting new platforms, we need new implementation techniques to run algorithms as fast as possible on the platform. In this paper, we present a new implementation of a CA-based secret sharing scheme using the Graphic Processing Unit (GPU). We propose a new data arrangement that reduces the total number of accesses to the memories in GPU. Our algorithm further reduces the amount of data required by each thread and at the same time achieves a high cache hit rate. Also, it can achieve coalesced memory accesses to optimal use of the global memory bandwidth. The proposed method obtains speedup up to four times faster than the best previous GPU implemented CA-based multi-secret sharing schemes.

Improvement of (n, n)-multi-secret image sharing schemes based on Boolean operations

Journal of Information Security and Applications