Advertisement

Efficient Private PEZ Protocols for Symmetric Functions

  • Yoshiki AbeEmail author
  • Mitsugu Iwamoto
  • Kazuo Ohta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11891)

Abstract

A private PEZ protocol is a variant of secure multi-party computation performed using a (long) PEZ dispenser. The original paper by Balogh et al. presented a private PEZ protocol for computing an arbitrary function with n inputs. This result is interesting, but no follow-up work has been presented since then, to the best of our knowledge. We show herein that it is possible to shorten the initial string (the sequence of candies filled in a PEZ dispenser) and the number of moves (a player pops out a specified number of candies in each move) drastically if the function is symmetric. Concretely, it turns out that the length of the initial string is reduced from \(\mathcal {O}(2^n!)\) for general functions in Balogh et al.’s results to \(\mathcal {O}(n\cdot n!)\) for symmetric functions, and \(2^n\) moves for general functions are reduced to \(n^2\) moves for symmetric functions. Our main idea is to utilize the recursive structure of symmetric functions to construct the protocol recursively. This idea originates from a new initial string we found for a private PEZ protocol for the three-input majority function, which is different from the one with the same length given by Balogh et al. without describing how they derived it.

Keywords

Private PEZ protocol Multi-party computation Symmetric functions Threshold functions 

Notes

Acknowledgements

The authors would like to thank the reviewers for their helpful comments and suggestions. They are also grateful to Mr. Shota Yamamoto for insightful discussions.

References

  1. 1.
    Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theoret. Comput. Sci. 306(13), 69–84 (2003).  https://doi.org/10.1016/S0304-3975(03)00210-X. http://linkinghub.elsevier.com/retrieve/pii/S030439750300210XMathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Boer, B.: More efficient match-making and satisfiability The Five Card Trick. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 208–217. Springer, Heidelberg (1990).  https://doi.org/10.1007/3-540-46885-4_23CrossRefGoogle Scholar
  3. 3.
    Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols for any boolean function. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 110–121. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-17142-5_11CrossRefGoogle Scholar
  4. 4.
    Watanabe, Y., Kuroki, Y., Suzuki, S., Koga, Y., Iwamoto, M., Ohta, K.: Card-based majority voting protocols with three inputs using three cards. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), pp. 218–222. IEEE (2018)Google Scholar
  5. 5.
    Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 160–164. IEEE, November 1982.  https://doi.org/10.1109/SFCS.1982.38, http://ieeexplore.ieee.org/document/4568388/

Copyright information

© International Association for Cryptologic Research 2019

Authors and Affiliations

  1. 1.The University of Electro-CommunicationsChofushiJapan

Personalised recommendations