paper-with-me

Papers

The Fire Thief Is Also the Keeper: Balancing Usability and Privacy in Prompts

2024-06-20 · Zhili Shen, Zihang Xi, Ying He, Wei Tong, Jingyu Hua, Sheng Zhong

The rapid adoption of online chatbots represents a significant advancement in artificial intelligence. However, this convenience brings considerable privacy concerns, as prompts can inadvertently contain sensitive information exposed to large language models (LLMs). Limited by high computational costs, reduced task usability, and excessive system modifications, previous works based on local deployment, embedding perturbation, and homomorphic encryption are inapplicable to online prompt-based LLM applications. To address these issues, this paper introduces Prompt Privacy Sanitizer (i.e., ProSan), an end-to-end prompt privacy protection framework that can produce anonymized prompts with contextual privacy removed while maintaining task usability and human readability. It can also be seamlessly integrated into the online LLM service pipeline. To achieve high usability and dynamic anonymity, ProSan flexibly adjusts its protection targets and strength based on the importance of the words and the privacy leakage risk of the prompts. Additionally, ProSan is capable of adapting to diverse computational resource conditions, ensuring privacy protection even for mobile devices with limited computing power. Our experiments demonstrate that ProSan effectively removes private information across various tasks, including question answering, text summarization, and code generation, with minimal reduction in task performance.

📄 PDF Abstract BibTeX arXiv:2406.14318

Code (0)

등록된 구현이 없습니다.

Tasks

Code GenerationQuestion AnsweringText Summarization

Methods 이 논문이 사용한 방법론

Golden Queue Managers 설명 없음

Similar Papers 제목 키워드 기반

Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach

2021-09-21 · Jonatas B. C. Chagas, Markus Wagner

We tackle the Thief Orienteering Problem (ThOP), an academic multi-component problem that combines two classical combinatorial problems, namely the Knapsack Problem and the Orienteering Problem. In the ThOP, a thief has …

Benchmarking

Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints

2024-10-08 · Michał Antkiewicz, Paweł B. Myszkowski

The paper presents a new balanced selection operator applied to the proposed Balanced Non-dominated Tournament Genetic Algorithm (B-NTGA) that actively uses archive to solve multi- and many-objective NP-hard combinatoria…

Combinatorial OptimizationScheduling

Semantic Motion Correction Via Iterative Nonlinear Optimization and Animation

2022-03-28 · Sairamvinay Vijayaraghavan, Jinxiao Song, Wan-Jhen Lin, Michael J Livanos

Here, we present an end-to-end method to create 2D animation for a goalkeeper attempting to block a penalty kick, and then correct that motion using an iterative nonlinear optimization scheme. The input is a raw video th…

object-detectionObject Detection

Firefly Algorithm: Recent Advances and Applications

2013-08-18 · Xin-She Yang, Xing-Shi He

Nature-inspired metaheuristic algorithms, especially those based on swarm intelligence, have attracted much attention in the last ten years. Firefly algorithm appeared in about five years ago, its literature has expanded…

What drives a goalkeepers' decisions?

2022-11-01 · Samer Fatayri, Kirill Serykh, Egor Gumin

In soccer games, the goalkeeper's performance is an important factor to the success of the whole team. Despite the goalkeeper's importance, little attention has been paid to their performance in events and tracking data.…

Position