Barrington Plays Cards: The Complexity of Card-based Protocols
Computational Complexity
2020-10-19 v1
Abstract
In this paper we study the computational complexity of functions that have efficient card-based protocols. Card-based protocols were proposed by den Boer [EUROCRYPT '89] as a means for secure two-party computation. Our contribution is two-fold: We classify a large class of protocols with respect to the computational complexity of functions they compute, and we propose other encodings of inputs which require fewer cards than the usual 2-card representation.
Cite
@article{arxiv.2010.08445,
title = {Barrington Plays Cards: The Complexity of Card-based Protocols},
author = {Pavel Dvořák and Michal Koucký},
journal= {arXiv preprint arXiv:2010.08445},
year = {2020}
}