Fundamenta Informaticae

Solitaire Zero-knowledge

NiemiValtteri, RenvallAri

Published Apr 1, 1999• 1 citation

Abstract

We show how a standard deck of playing cards can be used to implement a secure multiparty protocol to compute any boolean function. Our contribution to previous work: no identical copies of cards a...

DOI: 10.5555/2377856.2377870

Related papers

Solitaire Zero-knowledge

Valtteri Niemi, Ari Renvall

Fundamenta InformaticaeJan 1, 199933 citations

Efficient and Secure Multiparty Computations Using a Standard Deck of Playing Cards

Takaaki Mizuki

Lecture notes in computer scienceJan 1, 201636 citations

Secure Computation of Any Boolean Function Based on Any Deck of Cards

Kazumasa Shinagawa, Takaaki Mizuki

Lecture notes in computer scienceJan 1, 201917 citations

Card-Based Cryptographic Protocols for Three-Input Functions with a Standard Deck of Cards Using Private Operations

Naoki Kobayashi, Yoshifumi Manabe

Lecture notes in computer scienceJan 1, 20251 citation

Secure Multiparty Computation of Ranking Using a Deck of Cards

Ken Takashima, Yuta Abe, Tatsuya Sasaki +4 more

IEICE Technical Report; IEICE Tech. Rep.Jul 18, 20180 citations

Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations

Yoshifumi Manabe, Hibiki Ono

Lecture notes in computer scienceJan 1, 202114 citations