Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function
The paper proves that any function can be computed using a single-shuffle full-open card-based protocol for $n$ parties. This was previously unknown as only small functions were known to work with this minimal model. It presents two constructions trading card count for shuffle complexity and relates the problem to Private Simultaneous Messages (PSM) protocols, establishing bounds on required resources.