Skip to main content
SpringerLink
Log in

Six-Card Secure AND and Four-Card Secure XOR

  • Conference paper
Frontiers in Algorithmics (FAW 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5598))

Included in the following conference series:

Abstract

There have existed several “card-based protocols” for secure computations of a Boolean function such as AND and XOR. The best result currently known is that AND and XOR can be securely computed using 8 cards and 10 cards, respectively. In this paper, we improve the result: we design a 6-card AND protocol and a 4-card XOR protocol. Thus, this paper succeeds in reducing the number of required cards for secure computations.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balogh, J., Csirik, J.A., Ishai, Y., Kushilevitz, E.: Private computation using a PEZ dispenser. Theoretical Computer Science 306, 69–84 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. den 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)

    Chapter  Google Scholar 

  3. Crépeau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319–330. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  4. Albert, M.H., Aldred, R.E.L., Atkinson, M.D., van Ditmarsch, H.P., Handley, C.C.: Safe communication for card players by combinatorial designs for two-step protocols. Australasian Journal of Combinatorics 33, 33–46 (2005)

    MathSciNet  MATH  Google Scholar 

  5. Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Communications of the ACM 39(5), 77–85 (1996)

    Article  Google Scholar 

  6. Fischer, M.J., Wright, R.N.: Bounds on secret key exchange using a random deal of cards. Journal of Cryptology 9, 71–99 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Mizuki, T., Shizuya, H., Nishizeki, T.: Characterization of optimal key set protocols. Discrete Applied Mathematics 131(1), 213–236 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Mizuki, T., Uchiike, F., Sone, H.: Securely computing XOR with 10 cards. Australasian Journal of Combinatorics 36, 279–293 (2006)

    MathSciNet  MATH  Google Scholar 

  9. Moran, T., Naor, M.: Basing cryptographic protocols on tamper-evident seals. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 285–297. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Moran, T., Naor, M.: Polling with physical envelopes: a rigorous analysis of a human-centric protocol. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 88–108. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theoretical Computer Science 191, 173–183 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Salomaa, A.: Caesar and DNA. Views on cryptology. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 39–53. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Salomaa, A.: Public-Key Cryptography, 2nd edn. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  14. Stiglic, A.: Computations with a deck of cards. Theoretical Computer Science 259, 671–678 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cyberscience Center, Tohoku University, Aramaki-Aza-Aoba 6–3, Aoba-ku, Sendai, 980–8578, Japan

    Takaaki Mizuki & Hideaki Sone

Authors
  1. Takaaki Mizuki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hideaki Sone
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science,, City University of Hong Kong, No. 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China

    Xiaotie Deng

  2. Computer Science Department, Cornell University, 5144 Upson Hall, NY 14853, Ithaca, USA

    John E. Hopcroft

  3. Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, 330027, Nanchang, China

    Jinyun Xue

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mizuki, T., Sone, H. (2009). Six-Card Secure AND and Four-Card Secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02270-8_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02269-2

  • Online ISBN: 978-3-642-02270-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation