scholarly journals Correction to: Enhancing security and privacy of images on cloud by histogram shifting and secret sharing

2017 ◽  
Vol 77 (13) ◽  
pp. 17307-17307
Author(s):  
Min-Ying Wu ◽  
Min-Chieh Yu ◽  
Jenq-Shiou Leu ◽  
Sheng-Kai Chen
2017 ◽  
Vol 77 (13) ◽  
pp. 17285-17305 ◽  
Author(s):  
Min-Ying Wu ◽  
Min-Chieh Yu ◽  
Jenq-Shiou Leu ◽  
Sheng-Kai Chen

Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 25
Author(s):  
Georgia Tsaloli ◽  
Gustavo Banegas ◽  
Aikaterini Mitrokotsa

Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers. These computations often rely on the aggregation of data collected from multiple clients, while the clients want to guarantee that the results are correct and, thus, an output that can be publicly verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information. In this paper, we propose an approach, called verifiable additive homomorphic secret sharing (VAHSS), to achieve practical and provably secure aggregation of data, while allowing for the clients to protect their secret data and providing public verifiability i.e., everyone should be able to verify the correctness of the computed result. We propose three VAHSS constructions by combining an additive homomorphic secret sharing (HSS) scheme, for computing the sum of the clients’ secret inputs, and three different methods for achieving public verifiability, namely: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three constructions, we provide a detailed correctness, security, and verifiability analysis and detailed experimental evaluations. Our results demonstrate the efficiency of our proposed constructions, especially from the client side.


2019 ◽  
Vol 8 (2) ◽  
pp. 6544-6548

The cloud computing paradigm is being used because there is no need to setup additional IT infrastructure such as hardware and software, its low up-front cost. Security and privacy of data is important in day to today life especially for applications that uses cloud computing such as social media. Customer information that is stored at Cloud is crucial that needs to be protected against potential intruders. There is threat to maintain the data in transit and data at cloud due to different possible attacks. Due to this there is growing need of privacy and security of data. In this paper, the privacy and issues, privacy preservation techniques are addressed. In addition to this, in order to protect the data, the secret sharing algorithm is implemented and analyzed. The shamir’s secret sharing (k,n) algorithm is used to split the data into n partial shares which can be distributed in cloud. The user collects at least k partial shares to reconstruct the complete data. It is observed that if the file size is increased, the data recovery time is also increased. The paper concludes with privacy preservation guidelines.


2014 ◽  
Vol 543-547 ◽  
pp. 3632-3635
Author(s):  
Hui Juan Xie ◽  
Wei She ◽  
Chang Hao Han

Cloud computing system preserves the security and privacy of a user's data by replicating data among several clouds and by using the secret sharing approach. It uses the database management system DBMS (data source) to manage and control the operations between the clients and them ulti-clouds inside a cloud service provider [1]. Generally speaking, The Shamir's threshold scheme is suitable for the shares in the cloud computing. The Shamir's threshold scheme as a secret sharing scheme will attract more attention in the cloud computing in future.


2020 ◽  
Vol 2020 (2) ◽  
pp. 397-415
Author(s):  
Bailey Kacsmar ◽  
Chelsea H. Komlo ◽  
Florian Kerschbaum ◽  
Ian Goldberg

AbstractSecret sharing schemes are desirable across a variety of real-world settings due to the security and privacy properties they can provide, such as availability and separation of privilege. However, transitioning secret sharing schemes from theoretical research to practical use must account for gaps in achieving these properties that arise due to the realities of concrete implementations, threat models, and use cases. We present a formalization and analysis, using Ellison’s notion of ceremonies, that demonstrates how simple variations in use cases of secret sharing schemes result in the potential loss of some security properties, a result that cannot be derived from the analysis of the underlying cryptographic protocol alone. Our framework accounts for such variations in the design and analysis of secret sharing implementations by presenting a more detailed user-focused process and defining previously overlooked assumptions about user roles and actions within the scheme to support analysis when designing such ceremonies. We identify existing mechanisms that, when applied to an appropriate implementation, close the security gaps we identified. We present our implementation including these mechanisms and a corresponding security assessment using our framework.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huiyong Wang ◽  
Mingjun Luo ◽  
Yong Ding

Biometric based remote authentication has been widely deployed. However, there exist security and privacy issues to be addressed since biometric data includes sensitive information. To alleviate these concerns, we design a privacy-preserving fingerprint authentication technique based on Diffie-Hellman (D-H) key exchange and secret sharing. We employ secret sharing scheme to securely distribute fragments of critical private information around a distributed network or group, which softens the burden of the template storage center (TSC) and the users. To ensure the security of template data, the user’s original fingerprint template is stored in ciphertext format in TSC. Furthermore, the D-H key exchange protocol allows TSC and the user to encrypt the fingerprint template in each query using a random one-time key, so as to protect the user’s data privacy. Security analysis indicates that our scheme enjoys indistinguishability against chosen-plaintext attacks and user anonymity. Through experimental analysis, we demonstrate that our scheme can provide secure and accurate remote fingerprint authentication.


Sign in / Sign up

Export Citation Format

Share Document