Year: 2026
Type: article
Abstract: Card-based protocols perform secure computation using physical playing cards, and their efficiency is primarily evaluated by two metrics: the number of cards and the number of shuffles. In this paper, we present three new card-based protocols that reduce the number of cards. The first protocol supports any Boolean circuit and decreases the number of cards. The second protocol extends the first to a committed-format version, while the third is specialized for Boolean circuits without a branched input, achieving an even smaller number of cards. All the proposed protocols are based on Yao’s garbled-circuit framework, similar to previous single-shuffle card-based protocols. Our main contribution is a novel encoding method that represents the truth table of each Boolean gate with fewer cards than existing schemes. Consequently, our protocols require only six cards per gate in a single-shuffle execution, providing a significant improvement in efficiency over prior work. Furthermore, by incorporating the card-based free-XOR introduced by Manabe–Shinagawa, we can further reduce the number of cards in certain configurations.
Source: New Generation Computing
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,390
Awards: 十分統計量に基づくシミュレーションベース安全性の深化, サステナブルな分散型秘密計算基盤, 共役化理論に基づくカードベース暗号の数理構造の解明, Foundations of Security Quantification by Integrating Information, Computation, and Cryptography Theories, Trustworthy IoTシステム設計基盤の構築, New theory for security analysis: from information inequality to computational inequality, G6034680128, G6881311421, G7519076097, 暗号通貨に基づく秘密計算の物理暗号への応用, 真に高機能暗号の社会展開に資する物理・視覚暗号, 公開鍵暗号の識別不可能性に対する総合的評価技術の開発, G8919455824, G9001264496
OpenAlex ID: W7221758907