Scalable and Soundness Verifiable Outsourcing Computation in Marine Mobile Computing

Outsourcing computation with verifiability is a merging notion in cloud computing, which enables lightweight clients to outsource costly computation tasks to the cloud and efficiently check the correctness of the result in the end. This advanced notion is more important in marine mobile computing since the oceangoing vessels are usually constrained with less storage and computation resources. In such a scenario, vessels always firstly outsource data set and perform a function computing over them or at first outsource computing functions and input data set into them. However, vessels may choose which delegation computation type to outsource, which generally depends on the actual circumstances. Hence, we propose a scalable verifiable outsourcing computation protocol (SV-OC) in marine cloud computing at first and extract a single-mode version of it (SM-SV-OC), where both protocols allow anyone who holds verification tokens to efficiently verify the computed result returned from cloud. In this way, the introduced “scalable” property lets vessels adjust the protocol to cope with different delegation situations in practice. We additionally prove both SV-OC and SM-SV-OC achieving selective soundness in the random oracle model and evaluate their performance in the end.

Download Full-text

ID-based key-insulated signcryption with equality test in cloud computing

SN Applied Sciences ◽

10.1007/s42452-021-04469-9 ◽

2021 ◽

Vol 3 (4) ◽

Author(s):

Seth Alornyo ◽

Kingsford Kissi Mireku ◽

Mustapha Adamu Mohammed ◽

Daniel Adu-Gyamfi ◽

Michael Asante

Keyword(s):

Cloud Computing ◽

Random Oracle Model ◽

Random Oracle ◽

Harsh Environments ◽

Secret Key ◽

Secret Keys ◽

Security Property ◽

Equality Test ◽

Chosen Ciphertext Attack ◽

Chosen Message Attack

AbstractKey-insulated encryption reduces the problem of secret key exposure in hostile setting while signcryption cryptosystem attains the benefits of digitally signing a ciphertext and public key cryptosystem. In this study, we merge the primitives of parallel key-insulation cryptosystem and signcryption with equality test to construct ID-based parallel key-insulated signcryption with a test for equality (ID-PKSET) in cloud computing. The construction prevent data forgery, data re-play attacks and reduces the leakage of secret keys in harsh environments. Our scheme attains the security property of existential unforgeable chosen message attack (EUF-CMA) and indistinquishable identity chosen ciphertext attack (IND-ID-CCA2) using random oracle model.

Download Full-text

Revisiting Anonymous Two-Factor Authentication Schemes for IoT-Enabled Devices in Cloud Computing Environments

Security and Communication Networks ◽

10.1155/2019/2516963 ◽

2019 ◽

Vol 2019 ◽

pp. 1-13 ◽

Cited By ~ 5

Author(s):

Ping Wang ◽

Bin Li ◽

Hongjin Shi ◽

Yaosheng Shen ◽

Ding Wang

Keyword(s):

Cloud Computing ◽

Random Oracle Model ◽

Random Oracle ◽

Replay Attack ◽

Password Guessing Attack ◽

Symmetric Key ◽

Computing Environments ◽

Guessing Attack ◽

Key Techniques ◽

User Friendly

Investigating the security pitfalls of cryptographic protocols is crucial to understand how to improve security. At ICCCS’17, Wu and Xu proposed an efficient smart-card-based password authentication scheme for cloud computing environments to cope with the vulnerabilities in Jiang et al.’s scheme. However, we reveal that Wu-Xu’s scheme actually is subject to various security flaws, such as offline password guessing attack and replay attack. Besides security, user friendly is also another great concern. In 2017, Roy et al. found that in most previous two-factor schemes a user has to manage different credentials for different services and further suggested a user-friendly scheme which is claimed to be suitable for multiserver architecture and robust against various attacks. In this work, we show that Roy et al.’s scheme fails to achieve truly two-factor security and shows poor scalability. At FGCS’18, Amin et al. pointed out that most of existing two-factor schemes are either insecure or inefficient for mobile devices due to the use of public-key techniques and thus suggested an improved protocol by using only light-weight symmetric key techniques. Almost at the same time, Wei et al. also observed this issue and proposed a new scheme based on symmetric key techniques with formal security proofs in the random oracle model. Nevertheless, we point out that both Amin et al.’s and Wei et al.’s schemes cannot achieve the claimed security goals (including the most crucial goal of “truly two-factor security”). Our results invalidate any use of the scrutinized schemes for cloud computing environments.

Download Full-text

Multi-User Searchable Symmetric Encryption with Dynamic Updates for Cloud Computing

Information ◽

10.3390/info9100242 ◽

2018 ◽

Vol 9 (10) ◽

pp. 242 ◽

Cited By ~ 4

Author(s):

Chen Guo ◽

Xingbing Fu ◽

Yaojun Mao ◽

Guohua Wu ◽

Fagen Li ◽

...

Keyword(s):

Cloud Computing ◽

Random Oracle Model ◽

Random Oracle ◽

Index Structure ◽

Symmetric Encryption ◽

Pseudorandom Functions ◽

Searchable Symmetric Encryption ◽

Security Guarantees ◽

Cloud Servers ◽

Dynamic Updates

With the advent of cloud computing, more and more users begin to outsource encrypted files to cloud servers to provide convenient access and obtain security guarantees. Searchable encryption (SE) allows a user to search the encrypted files without leaking information related to the contents of the files. Searchable symmetric encryption (SSE) is an important branch of SE. Most of the existing SSE schemes considered single-user settings, which cannot meet the requirements for data sharing. In this work, we propose a multi-user searchable symmetric encryption scheme with dynamic updates. This scheme is applicable to the usage scenario where one data owner encrypts sensitive files and shares them among multiple users, and it allows secure and efficient searches/updates. We use key distribution and re-encryption to achieve multi-user access while avoiding a series of issues caused by key sharing. Our scheme is constructed based on the index structure where a bit matrix is combined with two static hash tables, pseudorandom functions and hash functions. Our scheme is proven secure in the random oracle model.

Download Full-text

The Study of Multiple Classes Boosting Classification Method Based on Local Similarity

Algorithms ◽

10.3390/a14020037 ◽

2021 ◽

Vol 14 (2) ◽

pp. 37

Author(s):

Shixun Wang ◽

Qiang Chen

Keyword(s):

Image Retrieval ◽

Loss Function ◽

Single Mode ◽

Local Similarity ◽

Text And Image ◽

Data Set ◽

Standard Data ◽

Weak Learner ◽

Great Progress ◽

Data Points

Boosting of the ensemble learning model has made great progress, but most of the methods are Boosting the single mode. For this reason, based on the simple multiclass enhancement framework that uses local similarity as a weak learner, it is extended to multimodal multiclass enhancement Boosting. First, based on the local similarity as a weak learner, the loss function is used to find the basic loss, and the logarithmic data points are binarized. Then, we find the optimal local similarity and find the corresponding loss. Compared with the basic loss, the smaller one is the best so far. Second, the local similarity of the two points is calculated, and then the loss is calculated by the local similarity of the two points. Finally, the text and image are retrieved from each other, and the correct rate of text and image retrieval is obtained, respectively. The experimental results show that the multimodal multi-class enhancement framework with local similarity as the weak learner is evaluated on the standard data set and compared with other most advanced methods, showing the experience proficiency of this method.

Download Full-text

An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

Mathematical Problems in Engineering ◽

10.1155/2020/7528571 ◽

2020 ◽

Vol 2020 ◽

pp. 1-12

Author(s):

Quanrun Li ◽

Chingfang Hsu ◽

Debiao He ◽

Kim-Kwang Raymond Choo ◽

Peng Gong

Keyword(s):

Quantum Computer ◽

Rapid Development ◽

Random Oracle Model ◽

Random Oracle ◽

Mean Value ◽

Blind Signature ◽

Signature Scheme ◽

Practical Applications ◽

Universal Quantum ◽

Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Download Full-text

A Mathematical Programming Model to Determine Objective Weights for the Interval Extension of TOPSIS

Mathematical Problems in Engineering ◽

10.1155/2018/3783101 ◽

2018 ◽

Vol 2018 ◽

pp. 1-6 ◽

Cited By ~ 1

Author(s):

Hai Shen ◽

Lingyu Hu ◽

Kin Keung Lai

Keyword(s):

Mathematical Programming ◽

Input Data ◽

Programming Model ◽

Multiple Criteria Decision Making ◽

Decision Makers ◽

Mathematical Programming Model ◽

Topsis Method ◽

Data Set ◽

Interval Extension ◽

Interval Valued

Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) method has been extended in previous literature to consider the situation with interval input data. However, the weights associated with criteria are still subjectively assigned by decision makers. This paper develops a mathematical programming model to determine objective weights for the implementation of interval extension of TOPSIS. Our method not only takes into account the optimization of interval-valued Multiple Criteria Decision Making (MCDM) problems, but also determines the weights only based upon the data set itself. An illustrative example is performed to compare our results with that of existing literature.

Download Full-text