Six-card secure and AND four-card secure XOR

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

66 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationFrontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings
Pages358-369
Number of pages12
DOIs
Publication statusPublished - 2009 Nov 9
Event3rd International Frontiers of Algorithmics Workshop, FAW 2009 - Hefei, China
Duration: 2009 Jun 202009 Jun 23

Publication series

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

Other

Other3rd International Frontiers of Algorithmics Workshop, FAW 2009
CountryChina
CityHefei
Period09/6/2009/6/23

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Six-card secure and AND four-card secure XOR'. Together they form a unique fingerprint.

Cite this