Title: Six-Card Secure AND and Four-Card Secure XOR
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.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 124
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot