Paper 2025/630

Charge Your Clients: Payable Secure Computation and Its Applications

Cong Zhang, Tsinghua University
Liqiang Peng, Alibaba Group (China)
Weiran Liu, Alibaba Group (China)
Shuaishuai Li, Zhongguancun Laboratory
Meng Hao, Singapore Management University
Lei Zhang, Alibaba Group (China)
Dongdai Lin, Institute of Information Engineering, Chinese Academy of Sciences
Abstract

The online realm has witnessed a surge in the buying and selling of data, prompting the emergence of dedicated data marketplaces. These platforms cater to servers (sellers), enabling them to set prices for access to their data, and clients (buyers), who can subsequently purchase these data, thereby streamlining and facilitating such transactions. However, the current data market is primarily confronted with the following issues. Firstly, they fail to protect client privacy, presupposing that clients submit their queries in plaintext. Secondly, these models are susceptible to being impacted by malicious client behavior, for example, enabling clients to potentially engage in arbitrage activities. To address the aforementioned issues, we propose payable secure computation, a novel secure computation paradigm specifically designed for data pricing scenarios. It grants the server the ability to securely procure essential pricing information while protecting the privacy of client queries. Additionally, it fortifies the server's privacy against potential malicious client activities. As specific applications, we have devised customized payable protocols for two distinct secure computation scenarios: Keyword Private Information Retrieval (KPIR) and Private Set Intersection (PSI). We implement our two payable protocols and compare them with the state-of-the-art related protocols that do not support pricing as a baseline. Since our payable protocols are more powerful in the data pricing setting, the experiment results show that they do not introduce much overhead over the baseline protocols. Our payable KPIR achieves the same online cost as baseline, while the setup is about slower than it. Our payable PSI needs about more communication cost than that of baseline protocol, while the runtime is slower than it depending on the network setting.

Note: This is the full version of a paper published in TIFS 2025, where we have added a payable PSI construction based on [CGT12].

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision. Transactions on Information Forensics & Security (TIFS)
Keywords
Payable Secure ComputationKeyword PIRPSI
Contact author(s)
zhangcong @ mail tsinghua edu cn
plq270998 @ alibaba-inc com
weiran lwr @ alibaba-inc com
liss @ zgclab edu cn
menghao303 @ gmail com
zongchao zl @ taobao com
ddlin @ iie ac cn
History
2025-04-11: approved
2025-04-07: received
See all versions
Short URL
https://ia.cr/2025/630
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/630,
      author = {Cong Zhang and Liqiang Peng and Weiran Liu and Shuaishuai Li and Meng Hao and Lei Zhang and Dongdai Lin},
      title = {Charge Your Clients: Payable Secure Computation and Its Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/630},
      year = {2025},
      url = {https://eprint.iacr.org/2025/630}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.