Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nitish M. Uplavikar

dblp:232/5592 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0001-8509-9596ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Security and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Privacy and data protection · 72% Cryptographic protocols and secure computation · 28%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval
search engines
0.512021
Lucene-P$^2$2: A Distributed Platform for Privacy-Preserving Text-Based Search · IEEE Trans. Dependable Secur. Comput. 2021
Privacy and data protection
privacy-preserving search
0.512021
Lucene-P$^2$2: A Distributed Platform for Privacy-Preserving Text-Based Search · IEEE Trans. Dependable Secur. Comput. 2021
Privacy and data protection
privacy-preserving machine learning
0.312018
Privacy-Preserving Multi-task Learning · ICDM 2018
Cryptographic protocols and secure computation
secure multiparty computation
0.312018
Privacy-Preserving Multi-task Learning · ICDM 2018
Distributed systems › peer-to-peer systems
distributed search
0.112021
Lucene-P$^2$2: A Distributed Platform for Privacy-Preserving Text-Based Search · IEEE Trans. Dependable Secur. Comput. 2021
Machine learning › Efficient and distributed learning › distributed training
distributed multi-task learning
0.112018
Privacy-Preserving Multi-task Learning · ICDM 2018

Methods — techniques the papers use, named apart from their topics

cryptographic protocols · 1.5secure aggregation · 0.7cryptographic techniques · 0.7
YearPublicationVenuePosition
2021 Lucene-P$^2$2: A Distributed Platform for Privacy-Preserving Text-Based Search
abstract
Information retrieval (IR) plays an essential role in daily life. However, currently deployed IR technologies, e.g., Apache Lucene – open-source search software, are insufficient when the information is protected or deemed to be private. For example, submitting a query to a publicly available search engine (e.g., Bing or Google) requires disclosing potentially delicate facts (e.g., thoughts about abortion), as well as the websites the user considers interesting. Similarly, when a private database contains sensitive information needed by the user, it cannot be searched freely. Over the past decade, various approaches, generally referred to as private information retrieval, have been proposed to obfuscate queries and responses, but they are limited in that the retrieved information is inadequate to compute relevancy. To address such limitations, this article introduces the necessary techniques to build Lucene-P$^2$that allows one party to discover whether a second party harbors any relevant textual information without either party disclosing any information.
Nitish M. Uplavikar, Bradley A. Malin, Wei Jiang 0026
IEEE Trans. Dependable Secur. Comput.1
2018 Privacy-Preserving Multi-task Learning
abstract
Multi-task learning (MTL), improving learning performance by transferring information between related tasks, has drawn more and more attention in the data mining field. To tackle tasks whose data are stored at different locations (or nodes), distributed MTL was proposed. It not only enhances the learning performance but also improves the computing efficiency since it transforms the original centralized computing framework into a distributed computing framework under which computations can be done in parallel. The major drawback of the distributed MTL is a potential violation of confidentiality when the data stored at each node contain sensitive information (e.g., medical records). Some distributed MTL algorithms were designed to protect the original by only transferring aggregate information (e.g., supports or gradients) from each node to a server who combines the received information to produce the desired models. However, since aggregate data may still leak sensitive information, the security guarantee of the existing solutions cannot be formally proved or verified. Thus, the goal of this paper is to develop a provable privacy-preserving multi-task learning (PP-MTL) protocol that incorporates the state of the art cryptographic techniques to achieve the best security guarantee. We also conducted experiments to demonstrate the efficiency of our proposed method.
Kunpeng Liu 0001, Nitish M. Uplavikar, Yanjie Fu
ICDM2