A brief survey on secure multi-party computing in the presence of rational parties

Wang, Yilei; Li, Tao; Qin, Haoran; Jin, Li; Gao, Wei; Liu, Zhe; Xu, Qiuliang

doi:10.1007/s12652-015-0299-2

Cited by 15 publications

(11 citation statements)

References 76 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simultaneously, due to an attribute-based encryption algorithm, topics such as the revocation or update of permission are also one of the directions that need to be studied in the future. We will continue to refine our approach in conjunction with some other research [37,[54][55][56][57].…”

Section: Discussionmentioning

confidence: 99%

BFR‐SE: A Blockchain‐Based Fair and Reliable Searchable Encryption Scheme for IoT with Fine‐Grained Access Control in Cloud Environment

Gao

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Due to capacity limitations, large amounts of data generated by IoT devices are often stored on cloud servers. These data are usually encrypted to prevent the disclosure, which significantly affects the availability of this data. Searchable encryption (SE) allows a party to store his data created by his IoT devices or mobile in encryption on the cloud server to protect his privacy while retaining his ability to search for data. However, the general SE techniques are all pay-then-use. The searchable encryption service providers (SESP) are considered curious but honest, making it unfair and unreliable. To address these problems, we combined ciphertext-policy attribute-based encryption, Bloom filter, and blockchain to propose a blockchain-based fair and reliable searchable encryption scheme (BFR-SE) in this paper. In BFR-SE, we constructed an attribute-based searchable encryption model that can provide fine-grained access control. The data owner stores the indices on SESP and stores some additional auxiliary information on the blockchain. After a data user initiates a request, SESP must return the correct and integral search results before the deadline. Otherwise, the data user can send an arbitration request, and the blockchain will make a ruling. The blockchain will only perform arbitrations based on auxiliary information when disputes arise, saving the computing resources on-chain. We analyzed the security and privacy of BFR-SE and simulated our scheme on the EOS blockchain, which proves that BFR-SE is feasible. Meanwhile, we provided a thorough analysis of storage and computing overhead, proving that BFR-SE is practical and has good performance.

show abstract

Section: Discussionmentioning

confidence: 99%

BFR‐SE: A Blockchain‐Based Fair and Reliable Searchable Encryption Scheme for IoT with Fine‐Grained Access Control in Cloud Environment

Gao

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…In [26], the deep learning task was addressed. Besides the above related work, several fundamental secure algorithms, such as dynamic homomorphic encryption [27,28], authentication [29,30], and light-weight multiparty computation [31], which have also been considered in the malicious model, have been proposed. However, to the best of our knowledge, no existing study has considered a method for outsourcing computation in the malicious model.…”

Section: Ppdm With Multiparticipant Data Storage and Computationmentioning

confidence: 99%

Securely Outsourcing ID3 Decision Tree in Cloud Computing

Jiang

Wang

et al. 2018

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

With the wide application of Internet of Things (IoT), a huge number of data are collected from IoT networks and are required to be processed, such as data mining. Although it is popular to outsource storage and computation to cloud, it may invade privacy of participants’ information. Cryptography-based privacy-preserving data mining has been proposed to protect the privacy of participating parties’ data for this process. However, it is still an open problem to handle with multiparticipant’s ciphertext computation and analysis. And these algorithms rely on the semihonest security model which requires all parties to follow the protocol rules. In this paper, we address the challenge of outsourcing ID3 decision tree algorithm in the malicious model. Particularly, to securely store and compute private data, the two-participant symmetric homomorphic encryption supporting addition and multiplication is proposed. To keep from malicious behaviors of cloud computing server, the secure garbled circuits are adopted to propose the privacy-preserving weight average protocol. Security and performance are analyzed.

show abstract

“…That means the inner data process is protected by the trusted platform and anyone (even the platform managers) could not damage the data on the application platform. Also we assume that all communications go through a security channel (Wang et al, 2015b;Wang et al, 2015c;Wang et al, 2015d) between tenants and service providers. By this assumption, we mainly pay attention to attack behaviours such as tamper, delete or forge tenant's data on the physical storage of each data node from external and internal.…”

Section: Attack Modelmentioning

confidence: 99%

MT-DIPS: a new data duplication integrity protection scheme for multi-tenants sharing storage in SaaS

Zhang

2018

IJGUC

View full text Add to dashboard Cite

In SaaS, the data sharing storage mode and tenant isolation requirement present new challenge to traditional remote data duplication protection schemes. This paper aims at the new requirement of tenant data duplication protection in SaaS and presents a tuple sampling-based tenant duplication protection mechanism MT-DIPS (Duplication Integrity Protection Scheme for Multi-Tenants). Instead of data block sampling, MT-DIPS accommodates the data isolation requirement of different tenants by sampling tenants physical data tuples. Through periodical random sampling, MT-DIPS reduces the complexity on service provider side of verification object construction and eliminates the resource waste. Analysis and the experimental results show that if the damage rate of tenant data tuples is about 1%, the random sampling data number is about 5% of the total number of tuples. MT-DIPS makes use of homomorphism labels with auxiliary authentication structure to allow trusted third party verification without disclosing tenant data to relieve the verification burden on tenants' client sides.

show abstract

A brief survey on secure multi-party computing in the presence of rational parties

Cited by 15 publications

References 76 publications

BFR‐SE: A Blockchain‐Based Fair and Reliable Searchable Encryption Scheme for IoT with Fine‐Grained Access Control in Cloud Environment

BFR‐SE: A Blockchain‐Based Fair and Reliable Searchable Encryption Scheme for IoT with Fine‐Grained Access Control in Cloud Environment

Securely Outsourcing ID3 Decision Tree in Cloud Computing

MT-DIPS: a new data duplication integrity protection scheme for multi-tenants sharing storage in SaaS

Contact Info

Product

Resources

About