Collusion resistant secret sharing scheme for secure data storage and processing over cloud

Lakshmi, V S; Deepthi, S. Aruna; Deepthi, P. P.

doi:10.1016/j.jisa.2021.102869

Cited by 11 publications

(5 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Moreover, they possess the additive homomorphic properties required to compute linear operations (sum, mean etc) in encrypted domain. In this work, we utilize the design of LFSR based random vector over Fq [20].…”

Section: Proposed Homomorphic Encryption Scheme Based On Polar Codesmentioning

confidence: 99%

“…If the initial states of LFSR are linearly independent, then keystreams will also be linearly independent. However, only L linearly independent initial states can be generated by an LFSR of length L. A scheme for generating L linearly independent initial states from an initial key, k of length L through cyclic shifting operation is also proposed [20]. Since the initial states derived through cyclic shifts lacks security, a more secure method is proposed.…”

Section: ) Key Generationmentioning

confidence: 99%

See 1 more Smart Citation

RSDA: A Reliable and Secure Data Aggregation Scheme for Smart Grid

Lakshmi V S

2024

jes

View full text Add to dashboard Cite

Smart grids are modern power distribution systems that utilize advanced technologies to optimize energy generation, distribution, and consumption. The huge amount of data generated by various sources, such as smart meters, sensors, and other devices, can be aggregated for efficient energy management, supporting demand response etc. However, this data can contain sensitive information about individual’s energy usage patterns, behaviour, and preferences, which raises several privacy concerns. Data reliability is another major issue, as the data send from the smart meters to the aggregators may get corrupted due to errors introduced by the communication channel. In this paper, a private-key additive homomorphic encryption scheme based on polar codes is proposed for privacy preserving data aggregation. The proposed scheme not only ensures data confidentiality but also provide data reliability. The security of this scheme relies on the difficulty in decoding the codeword and is achieved by embedding security in the generator matrix and error vector. Security analysis shows that the proposed scheme is resistant against all known attacks against private-key code-based cryptosystems. The performance analysis is evaluated in terms of error performance, communication overhead and computational complexity. The performance comparison with related additive homomorphic encryption scheme shows the efficiency of the proposed scheme.

show abstract

Section: Proposed Homomorphic Encryption Scheme Based On Polar Codesmentioning

confidence: 99%

Section: ) Key Generationmentioning

confidence: 99%

RSDA: A Reliable and Secure Data Aggregation Scheme for Smart Grid

Lakshmi V S

2024

jes

View full text Add to dashboard Cite

show abstract

“…A modified ramp secret sharing (MRSS) approach was designed in [19] to minimize the storage overhead with privacypreserving data processing applications.…”

Section: Related Workmentioning

confidence: 99%

Bgnba-oco Based Privacy Preserving Attribute Based Access Control With Data Duplication for Secure Storage in Cloud

Pavithra

Prakash

Vennila³

2023

Preprint

View full text Add to dashboard Cite

Cloud computing technology offers flexible and expedient services which carry a variety of profits for both societies as well as individuals. In the epoch of data explosion, customers and business establishments require to store enormous data. The exception of cloud service advantages, data confidentiality becomes a challenging aspect to be covered as far as executing data access control. The implementation of Attribute-based Encryption in a Cloud Computing (CC) environment solves the demanding topic of outsourced data enabling fine-grained and pliable access control. In this work, a method called Boneh Goh Nissim Bilinear Attribute-based Optimal Cache Oblivious (BGNBA-OCO) access control and secure de-duplication for data storage in cloud computing is proposed. First, Boneh Goh Nissim Privacy Preserving Revocable Attribute-based Encryption is designed that reinforces attribute revocation and avert the discharge of sensitive information. Moreover, to prevent disclosure of access patterns Optimal Cache Oblivious algorithm is employed to hide the access patterns in cloud storage using rand pattern matching. It also supports updating both encrypted data and access control policies to minimize communication and computation overhead of data duplication and encryption processes concurrently. In this way, secure data sharing is performed to achieve higher data confidentiality and integrity. The analyzed results indicate that the BGNBA-OCO method offers an efficient solution in terms of achieving higher data confidentiality, and integrity, and minimizing the communication as well as computation overhead than the conventional techniques.

show abstract

“…Pesquisas envolvendo a privacidade de dados na área da saúde vem crescendo cada dia mais. Podemos citar, por exemplo, os trabalhos de Ermakova & Fabian (2013); Sarosh et al (2021); Lakshmi et al (2021), que utilizam Secret Sharing para tal finalidade.…”

Section: Introductionunclassified