Public-key cryptography
A Salomaa - 2013 - books.google.com
Cryptography, secret writing, is enjoying a scientific renaissance following the seminal
discovery in 1977 of public-key cryptography and applications in computers and …
discovery in 1977 of public-key cryptography and applications in computers and …
Six-card secure AND and four-card secure XOR
T Mizuki, H Sone - International Workshop on Frontiers in Algorithmics, 2009 - Springer
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 …
function such as AND and XOR. The best result currently known is that AND and XOR can …
Card-based cryptographic protocols using a minimal number of cards
Secure multiparty computation can be done with a deck of playing cards. For example, den
Boer (EUROCRYPT'89) devised his famous “five-card trick”, which is a secure two-party …
Boer (EUROCRYPT'89) devised his famous “five-card trick”, which is a secure two-party …
How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition
We propose a technique to construct physical Zero-Knowledge Proof (ZKP) protocols for
puzzles that require a single loop draw feature. Our approach is based on the observation …
puzzles that require a single loop draw feature. Our approach is based on the observation …
Secure implementations of a random bisection cut
By using a deck of cards, it is possible to realize a secure multiparty computation. In
particular, since a new shuffling operation, called a random bisection cut, was devised in …
particular, since a new shuffling operation, called a random bisection cut, was devised in …
Card-based cryptographic logical computations using private operations
H Ono, Y Manabe - New Generation Computing, 2021 - Springer
This paper proposes new card-based cryptographic protocols to calculate logic functions
with the minimum number of cards using private operations under the semi-honest model …
with the minimum number of cards using private operations under the semi-honest model …
The five-card trick can be done with four cards
T Mizuki, M Kumamoto, H Sone - … on the Theory and Application of …, 2012 - Springer
The “five-card trick” invented by Boer allows Alice and Bob to securely compute the AND
function of their secret inputs using five cards—three black cards and two red cards—with …
function of their secret inputs using five cards—three black cards and two red cards—with …
A formalization of card-based cryptographic protocols via abstract machine
T Mizuki, H Shizuya - International Journal of Information Security, 2014 - Springer
Consider a face-down card lying on the table such that we do not know whether its suit color
is black or red. Then, how do we make identical copies of the card while kee** its color …
is black or red. Then, how do we make identical copies of the card while kee** its color …
Efficient card-based protocols for generating a hidden random permutation without fixed points
R Ishikawa, E Chida, T Mizuki - … 2015, Auckland, New Zealand, August 30 …, 2015 - Springer
Consider the holiday season, where there are n players who would like to exchange gifts.
That is, we would like to generate a random permutation having no fixed point. It is known …
That is, we would like to generate a random permutation having no fixed point. It is known …
Physical zero-knowledge proof for Makaro
Makaro is a logic game similar to Sudoku. In Makaro, a grid has to be filled with numbers
such that: given areas contain all the numbers up to the number of cells in the area, no …
such that: given areas contain all the numbers up to the number of cells in the area, no …