Practical card-based cryptography

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

29 Citations (Scopus)

Abstract

It is known that secure multi-party computations can be achieved using a number of black and red physical cards (with identical backs). In previous studies on such card-based cryptographic protocols, typically an ideal situation where all players are semi-honest and all cards of the same suit are indistinguishable from one another was assumed. In this paper, we consider more realistic situations where, for example, some players possibly act maliciously, or some cards possibly have scuff marks, so that they are distinguishable, and propose methods to maintain the secrecy of players' private inputs even under such severe conditions.

Original languageEnglish
Title of host publicationFun with Algorithms - 7th International Conference, FUN 2014, Proceedings
PublisherSpringer-Verlag
Pages313-324
Number of pages12
ISBN (Print)9783319078892
DOIs
Publication statusPublished - 2014 Jan 1
Event7th International Conference on Fun with Algorithms, FUN 2014 - Sicily, Italy
Duration: 2014 Jul 12014 Jul 3

Publication series

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

Other

Other7th International Conference on Fun with Algorithms, FUN 2014
CountryItaly
CitySicily
Period14/7/114/7/3

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Practical card-based cryptography'. Together they form a unique fingerprint.

Cite this