发表机构
Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University（朱拉隆功大学工程学院计算机工程系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文针对虚拟玩家模拟模型，提出Play-Minimum和Sorting两个通用基于卡片的计算协议，为该模型的计算能力研究提供了基础原语。
AI 中文摘要
玩家模拟是基于卡片的密码学领域的新方向，目前已开发出用于模拟《老女仆》《UNO》《总统》等实体卡片游戏中虚拟玩家的协议。与传统基于卡片的安全计算不同，玩家模拟有额外约束：卡片代表持久游戏状态，每次操作后需保留虚拟玩家手牌中剩余卡片，且游戏中每张卡片最好对应一张实体卡片。本文研究虚拟玩家模拟模型中的通用基于卡片的计算，聚焦于卡片具有公开已知等级的游戏，提出两个基础协议：一是Play-Minimum协议，当牌组中所有卡片值不同时，该协议可安全选择并打出虚拟玩家手牌中值最小的卡片，利用对称性也可打出值最大的卡片；二是Sorting协议，可安全将虚拟玩家手牌按非降序排列，且适用于多张卡片值相同的情况。这些协议提供了独立于特定卡片游戏的通用计算原语，为理解虚拟玩家模拟模型的计算能力迈出了一步。
英文摘要
Player simulation has recently emerged as a new direction in card-based cryptography, with protocols developed for simulating virtual players in physical card games such as Old Maid, UNO, and President. Unlike conventional card-based secure computation, player simulation imposes additional constraints: the cards represent a persistent game state, the remaining cards in a virtual player's hand must be preserved after each action, and it is desirable to represent each card in the game by a single physical card. In this paper, we study generic card-based computation in the virtual player simulation model. We focus on games whose cards admit a publicly known ranking and propose two fundamental protocols. First, we present the Play-Minimum protocol, which securely selects and plays the minimum-value card from a virtual player's hand when all cards in the deck have distinct values. By symmetry, the protocol can also be used to play the maximum-value card. Second, we present the Sorting protocol, which securely arranges a virtual player's hand in nondecreasing order and remains applicable when multiple cards have the same value. These protocols provide generic computational primitives independent of any particular card game and constitute a step toward understanding the computational capabilities of the virtual player simulation model.
