AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
type: Item
instance of: scholarly article
title: AC-RRNS: anti-collusion secured data sharing scheme for cloud storage
zbMATH Open document ID: 1448.94249
author: Andrei Tchernykh
author: Mikhail Babenko
author: Nikolay Chervyakov
author: Vanessa Miranda-López
author: Viktor Kuchukov
author: Jorge M. Cortés-Mendoza
author: Maxim Deryabin
author: Nikolay Kucherov
author: Gleb Radchenko
author: Arutyun Avetisyan
published in: International Journal of Approximate Reasoning
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 68M11
zbMATH DE Number: 7025873
zbMATH Keywords: uncertainty
zbMATH Keywords: collusion
zbMATH Keywords: multi-cloud
zbMATH Keywords: cloud computing
zbMATH Keywords: secret sharing schemes
zbMATH Keywords: residue number system
MaRDI profile type: Publication
full work available at URL: j.ijar.2018.07.010
OpenAlex ID: W2886039949
cites work: Distance properties of expander codes
cites work: Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
cites work: Collusion-secure fingerprinting for digital data
cites work: Improved proxy re-encryption schemes with applications to secure distributed storage
cites work: Network Coding for Distributed Storage Systems
cites work: A new technique for fast number comparison in the residue number system
cites work: On expander codes
cites work: Q4341739
cites work: Q3043938
cites work: Expander codes
cites work: Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
cites work: Q5553682
cites work: The Mixed-Radix Chinese Remainder Theorem and Its Applications to Residue Comparison
cites work: Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
cites work: Residue-to-binary converters based on new Chinese Remainder Theorems
cites work: A uniform-complexity treatment of encryption and zero-knowledge
cites work: Towards an understanding of cloud services under uncertainty: a possibilistic approach
cites work: Idle regulation in non-clairvoyant scheduling of parallel jobs
Wikidata QID: Q129426748
DOI: 10.1016/J.IJAR.2018.07.010
description: scientific article; zbMATH DE number 7025873