面向相等函数的基于纸牌的覆写协议及其应用
Card-Based Overwriting Protocol for Equality Function and Applications
AI总结：
针对安全多方计算的纸牌协议研究需求，本文提出可安全计算k候选n变量相等函数的覆写协议，并将其技术拓展应用于其他同类函数计算。
摘要：
采用物理扑克牌组这一非常规方法的安全多方计算研究始于1989年，当时den Boer提出了一种用五张纸牌计算逻辑与函数的协议。此后该领域受到众多研究者关注，已开发出多种用于计算各类函数的基于纸牌的协议。本文提出了一种名为覆写协议（overwriting protocol）的基于纸牌的协议，可安全计算k候选n变量相等函数$f: \{0,1,\ldots ,k-1\}^n \rightarrow \{0,1\}$，还将该协议所用技术应用于计算其他同类函数。
英文摘要：
Research in the area of secure multi-party computation with an unconventional method of using a physical deck of playing cards began in 1989 when den Boer proposed a protocol to compute the logical AND function using five cards. Since then, the area has gained interest from many researchers and several card-based protocols to compute various functions have been developed. In this paper, we propose a card-based protocol called the overwriting protocol that can securely compute the $k$-candidate $n$-variable equality function $f: \{0,1,\ldots ,k-1\}^n \rightarrow \{0,1\}$. We also apply the technique used in this protocol to compute other similar functions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
