Efficient and secure multiparty computations using a standard deck of playing cards

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

It is known that secure multiparty computation can be performed using physical cards with identical backs, and numerous cardbased cryptographic protocols have been proposed. Almost all existing protocols require multiple cards that have the same pattern on their face sides; thus, a standard deck of playing cards cannot be used for executing these protocols. However, there is one exception: Niemi and Renvall’s protocols, proposed in 1999, can be used with standard playing cards. In this paper, we continue their efforts to improve secure multiparty computation using a standard deck of playing cards, and propose efficient AND, XOR, and copy protocols that require significantly fewer shuffles compared to previous protocols.

Original languageEnglish
Title of host publicationCryptology and Network Security - 15th International Conference, CANS 2016, Proceedings
EditorsGiuseppe Persiano, Sara Foresti
PublisherSpringer Verlag
Pages484-499
Number of pages16
ISBN (Print)9783319489643
DOIs
Publication statusPublished - 2016
Event15th International Conference on Cryptology and Network Security, CANS 2016 - Milan, Italy
Duration: 2016 Nov 142016 Nov 16

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10052 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th International Conference on Cryptology and Network Security, CANS 2016
CountryItaly
CityMilan
Period16/11/1416/11/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Efficient and secure multiparty computations using a standard deck of playing cards'. Together they form a unique fingerprint.

Cite this