2018
DOI: 10.3934/mfc.2018015
|View full text |Cite
|
Sign up to set email alerts
|

Cryptographic algorithms for privacy-preserving online applications

Abstract: Privacy in online applications has drawn tremendous attention in recent years. With the development of cloud-based applications, protecting users' privacy while guaranteeing the expected service from the server has become a significant issue. This paper surveyed the most popular cryptographic algorithms in privacy-preserving online applications to provide a tutorial-like introduction to researchers in this area. Particularly, this paper focuses on introduction to homomorphic encryption, secret sharing, secure … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 65 publications
0
5
0
Order By: Relevance
“…Formally, n number of clients {P 1 , P 2 , … , P n } want to calculate a global function f {I 1 , I 2 , … , I n } from their individual dataset I i . A protocol is considered SMPC if it ensures (Li et al 2018): (i) the function f {I 1 , I 2 , … , I n } is accurate, and (2) no private information of I n is disclosed to other participants. To improve the privacy of FL, SMPC is frequently used.…”
Section: Secure Multi-party Computation-based Approachmentioning
confidence: 99%
“…Formally, n number of clients {P 1 , P 2 , … , P n } want to calculate a global function f {I 1 , I 2 , … , I n } from their individual dataset I i . A protocol is considered SMPC if it ensures (Li et al 2018): (i) the function f {I 1 , I 2 , … , I n } is accurate, and (2) no private information of I n is disclosed to other participants. To improve the privacy of FL, SMPC is frequently used.…”
Section: Secure Multi-party Computation-based Approachmentioning
confidence: 99%
“…Homomorphic encryption [148] is a form of encryption. Formally, an encryption algorithm En is called homomorphic over an operator if fulfilling the criterion En(m 1 ) En(m 2 ) = En(m 1 m 2 ), ∀m 1 , m 2 ∈ M, where M denotes a set of plaintext [98]. According to the supported operators, homomorphic encryption methods can be divided into two categories: partially homomorphic encryption [134] and fully homomorphic encryption [176].…”
Section: Cryptographic Techniquesmentioning
confidence: 99%
“…Formally, a dealer distributes a secret s to n participants, each of whom is allocated one share. Then, the (t, n)-threshold secret sharing is defined by fulfilling the following criteria [98]: (1) For an arbitrary subset of m participants with m t, the secret s can be reconstructed from m shares, and (2) for an arbitrary subset of m participants with m < t, the secret s cannot be reconstructed from m shares. The methods proposed in References [12,156] are two widely used (t, n)-threshold secret sharing methods.…”
Section: Cryptographic Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…For the privacy protection of the query content, the asymmetric key encryption algorithm of RSA(Rivest-Shamir-Adleman) is adopted through the research and study of the secure multi-party computing model (Li et al, 2018). Through the combination of the two methods, a better privacy protection effect is achieved.…”
mentioning
confidence: 99%