Skip to main content
SpringerLink
Log in

Single-Shuffle Card-Based Protocols with Six Cards per Gate

  • Conference paper
  • First Online:
Information Security and Cryptology – ICISC 2023 (ICISC 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14562))

Included in the following conference series:

  • 66 Accesses

Abstract

Card-based cryptography refers to a secure computation with physical cards, and the number of cards and shuffles measures the efficiency of card-based protocols. This paper proposes new card-based protocols for any Boolean circuits with only a single shuffle. Although our protocols rely on Yao’s garbled circuit as in previous single-shuffle card-based protocols, our core construction idea is to encode truth tables of each Boolean gate with fewer cards than previous works while being compatible with Yao’s garbled circuit. As a result, we show single-shuffle card-based protocols with six cards per gate, which are more efficient than previous single-shuffle card-based protocols.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The reason utilizing eight cards in [26] comes from this point.

References

  1. Abe, Y., Hayashi, Y., Mizuki, T., Sone, H.: Five-card AND protocol in committed format using only practical shuffles. In: 5th ACM on ASIA Public-Key Cryptography Workshop, APKC ’18, pp. 3–8. ACM, New York (2018). https://doi.org/10.1145/3197507.3197510

  2. Abe, Y., Hayashi, Y., Mizuki, T., Sone, H.: Five-card AND computations in committed format using only uniform cyclic shuffles. New Gener. Comput. 39(1), 97–114 (2021). https://doi.org/10.1007/s00354-020-00110-2

    Article  Google Scholar 

  3. den Boer, B.: More efficient match-making and satisfiability: the five card trick. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology - EUROCRYPT ’89. Lecture Notes in Computer Science, vol. 434, pp. 208–217. Springer, Berlin (1989). https://doi.org/10.1007/3-540-46885-4_23

    Chapter  Google Scholar 

  4. Crépeau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) Advances in Cryptology - CRYPTO’ 93. Lecture Notes in Computer Science, vol. 773, pp. 319–330. Springer, Berlin (1994). https://doi.org/10.1007/3-540-48329-2_27

    Chapter  Google Scholar 

  5. Kastner, J., Koch, A., Walzer, S., Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: The minimum number of cards in practical card-based protocols. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology-ASIACRYPT 2017. LNCS, vol. 10626, pp. 126–155. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70700-6_5

    Chapter  Google Scholar 

  6. Koch, A.: The landscape of security from physical assumptions. In: IEEE Information Theory Workshop, pp. 1–6. IEEE, NY (2021). https://doi.org/10.1109/ITW48936.2021.9611501

  7. Koch, A., Walzer, S.: Foundations for actively secure card-based cryptography. In: Farach-Colton, M. (ed.) 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 157, pp. Art.-Nr.: 17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI) (2020). https://doi.org/10.4230/LIPIcs.FUN.2021.17

  8. Koch, A., Walzer, S., Härtel, K.: Card-based cryptographic protocols using a minimal number of cards. In: Iwata, T., Cheon, J. (eds.) Advances in Cryptology - ASIACRYPT 2015. Lecture Notes in Computer Science(), vol. 9452, pp. 783–807. Springer, Berlin (2015). https://doi.org/10.1007/978-3-662-48797-6_32

    Chapter  Google Scholar 

  9. Koyama, H., Toyoda, K., Miyahara, D., Mizuki, T.: New card-based copy protocols using only random cuts. In: ASIA Public-Key Cryptography Workshop, pp. 13–22. ACM, NY (2021), https://doi.org/10.1145/3457338.3458297

  10. Kuzuma, T., Isuzugawa, R., Toyoda, K., Miyahara, D., Mizuki, T.: Card-based single-shuffle protocols for secure multiple-input AND and XOR computations. In: APKC ’22: Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop, APKC@AsiaCCS 2022, Nagasaki, Japan, 30 May 2022, pp. 51–58. ACM (2022)

    Google Scholar 

  11. Miyamoto, K., Shinagawa, K.: Graph automorphism shuffles from pile-scramble shuffles. New Gener. Comput. 40, 199–223 (2022). https://doi.org/10.1007/s00354-022-00164-4

    Article  Google Scholar 

  12. Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) Frontiers in Algorithmics. Lecture Notes in Computer Science, vol. 5598, pp. 358–369. Springer, Berlin (2009). https://doi.org/10.1007/978-3-642-02270-8_36

    Chapter  Google Scholar 

  13. Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australas. J. Combin. 36, 279–293 (2006)

    MathSciNet  Google Scholar 

  14. Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theor. Comput. Sci. 191(1–2), 173–183 (1998). https://doi.org/10.1016/S0304-3975(97)00107-2

    Article  MathSciNet  Google Scholar 

  15. Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols for any boolean function. In: Jain, R., Jain, S., Stephan, F. (eds.) Theory and Applications of Models of Computation. LNCS, vol. 9076, pp. 110–121. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17142-5_11

    Chapter  Google Scholar 

  16. Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: An implementation of non-uniform shuffle for secure multi-party computation. In: ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC ’16, pp. 49–55. ACM, New York (2016). https://doi.org/10.1145/2898420.2898425

  17. Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Pile-shifting scramble for card-based protocols. IEICE Trans. Fundam. 101(9), 1494–1502 (2018). https://doi.org/10.1587/transfun.E101.A.1494

    Article  Google Scholar 

  18. Nishimura, A., Nishida, T., Hayashi, Y.I., Mizuki, T., Sone, H.: Card-based protocols using unequal division shuffles. Soft. Comput. 22, 361–371 (2018)

    Article  Google Scholar 

  19. Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Five-card secure computations using unequal division shuffle. In: Dediu, A.H., Magdalena, L., Martín-Vide, C. (eds.) Theory and Practice of Natural Computing. LNCS, vol. 9477, pp. 109–120. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26841-5_9

    Chapter  Google Scholar 

  20. Ruangwises, S., Itoh, T.: AND protocols using only uniform shuffles. In: van Bevern, R., Kucherov, G. (eds.) Computer Science-Theory and Applications. LNCS, vol. 11532, pp. 349–358. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19955-5_30

    Chapter  Google Scholar 

  21. Saito, T., Miyahara, D., Abe, Y., Mizuki, T., Shizuya, H.: How to implement a non-uniform or non-closed shuffle. In: Martín-Vide, C., Vega-Rodríguez, M.A., Yang, M.S. (eds.) Theory and Practice of Natural Computing. LNCS, vol. 12494, pp. 107–118. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-63000-3_9

    Chapter  Google Scholar 

  22. Shinagawa, K., Miyamoto, K.: Automorphism shuffles for graphs and hypergraphs and its applications. IEICE Trans. Fundam. E106.A(3), 306–314 (2023). https://doi.org/10.1587/transfun.2022CIP0020

  23. Shinagawa, K., Nuida, K.: A single shuffle is enough for secure card-based computation of any boolean circuit. Discret. Appl. Math. 289, 248–261 (2021)

    Article  MathSciNet  Google Scholar 

  24. Stiglic, A.: Computations with a deck of cards. Theor. Comput. Sci. 259(1–2), 671–678 (2001). https://doi.org/10.1016/S0304-3975(00)00409-6

    Article  MathSciNet  Google Scholar 

  25. Toyoda, K., Miyahara, D., Mizuki, T., Sone, H.: Six-card finite-runtime XOR protocol with only random cut. In: ACM Workshop on ASIA Public-Key Cryptography, APKC ’20, pp. 2–8. ACM, New York (2020). https://doi.org/10.1145/3384940.3388961

  26. Tozawa, K., Morita, H., Mizuki, T.: Single-shuffle card-based protocol with eight cards per gate. In: Genova, D., Kari, J. (eds.) Unconventional Computation and Natural Computation. Lecture Notes in Computer Science, vol. 14003, pp. 171–185. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-34034-5_12

    Chapter  Google Scholar 

  27. Ueda, I., Miyahara, D., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Secure implementations of a random bisection cut. Int. J. Inf. Sec. 19(4), 445–452 (2020). https://doi.org/10.1007/s10207-019-00463-w

    Article  Google Scholar 

  28. Ueda, I., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: How to implement a random bisection cut. In: Martin-Vide, C., Mizuki, T., Vega-Rodriguez, M. (eds.) Theory and Practice of Natural Computing. Lecture Notes in Computer Science(), vol. 10071, pp. 58–69. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49001-4_5

    Chapter  Google Scholar 

  29. Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162–167. IEEE Computer Society (1986). http://dblp.uni-trier.de/db/conf/focs/focs86.html/Yao86

Download references

Acknowledgment

This work was supported by JSPS KAKENHI Grant Numbers JP23H00468, JP23H00479, JP23K17455, JP23K16880, JP22H03590, JP21K17702, JP21H03395, JP21H03441, JP18H05289, JST CREST JPMJCR22M1, JPMJCR23M2, and MEXT Leading Initiative for Excellent Young Researchers.

Author information

Authors and Affiliations

  1. The University of Electro-Communications, Tokyo, Japan

    Tomoki Ono, Yohei Watanabe & Mitsugu Iwamoto

  2. Ibaraki University, Ibaraki, Japan

    Kazumasa Shinagawa

  3. National Institute of Advanced Industrial Science and Technology, Tokyo, Japan

    Kazumasa Shinagawa & Yohei Watanabe

  4. Toyohashi University of Technology, Aichi, Japan

    Takeshi Nakai

Authors
  1. Tomoki Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazumasa Shinagawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takeshi Nakai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yohei Watanabe
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Mitsugu Iwamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomoki Ono .

Editor information

Editors and Affiliations

  1. Hansung University, Seoul, Korea (Republic of)

    Hwajeong Seo

  2. Sungshin Women's University, Seoul, Korea (Republic of)

    Suhri Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ono, T., Shinagawa, K., Nakai, T., Watanabe, Y., Iwamoto, M. (2024). Single-Shuffle Card-Based Protocols with Six Cards per Gate. In: Seo, H., Kim, S. (eds) Information Security and Cryptology – ICISC 2023. ICISC 2023. Lecture Notes in Computer Science, vol 14562. Springer, Singapore. https://doi.org/10.1007/978-981-97-1238-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-1238-0_9

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-1237-3

  • Online ISBN: 978-981-97-1238-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation