Abstract

This paper shows card-based cryptographic protocols to calculate several Boolean functions using private operations under the semi-honest model. Private operations, introduced by Nakai et al. are the most powerful operations for card-based protocols. We showed that copy, logical AND, and logical XOR can be calculated with the minimum number of cards using three private operations, private random bisection cuts, private reverse cuts, and private reveals. This paper shows that by using these private operations, all of the following Boolean functions can be calculated without additional cards other than the input cards: (1) Any three input Boolean functions, (2) Half adder and full adder, and (3) Any n-input symmetric Boolean functions. The numbers of cards used in these protocols are smaller than the ones without private operations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.