A Note on Single-Cut Full-Open Protocols
Kazumasa Shinagawa, Koji Nuida

TL;DR
This paper introduces three new single-cut full-open protocols in card-based cryptography, enabling secure computation of three- and four-variable functions through random cuts and card revelations.
Contribution
It presents novel protocols for three- and four-variable functions using single-cut full-open techniques in card-based cryptography.
Findings
Two protocols for three-variable functions
One protocol for four-variable functions
Protocols ensure secure computation with card shuffles
Abstract
Card-based cryptography is a research area that realizes cryptographic protocols such as secure computation by applying shuffles to sequences of cards that encode input values. A single-cut full-open protocol is one that obtains an output value by applying a random cut to an input sequence of cards, after which all cards are opened. In this paper, we propose three single-cut full-open protocols: two protocols for three-variable functions and one protocol for a four-variable function.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
