[HTML][HTML] Efficient card-based zero-knowledge proof for Sudoku
Abstract In 2009, Gradwohl, Naor, Pinkas, and Rothblum proposed physical zero-knowledge
proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols …
proof protocols for Sudoku. That is, for a puzzle instance of Sudoku, their excellent protocols …
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 …
Card-based ZKP protocols for Takuzu and Juosan
Takuzu and Juosan are logical Nikoli games in the spirit of Sudoku. In Takuzu, a grid must
be filled with 0's and 1's under specific constraints. In Juosan, the grid must be filled with …
be filled with 0's and 1's under specific constraints. In Juosan, the grid must be filled with …
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 …
[HTML][HTML] Practical card-based implementations of Yao's millionaire protocol
Yao's millionaire protocol enables Alice and Bob to know whether or not Bob is richer than
Alice by using a public-key cryptosystem without revealing the actual amounts of their …
Alice by using a public-key cryptosystem without revealing the actual amounts of their …
Foundations for actively secure card-based cryptography
Card-based cryptography, as first proposed by den Boer (EUROCRYPT 1989), enables
secure multiparty computation using only a deck of playing cards. Many protocols as of yet …
secure multiparty computation using only a deck of playing cards. Many protocols as of yet …
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 protocols for any boolean function
Card-based protocols that are based on a deck of physical cards achieve secure multi-party
computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy …
computation with information-theoretic secrecy. Using existing AND, XOR, NOT, and copy …
Computational model of card-based cryptographic protocols and its applications
T Mizuki, H Shizuya - IEICE Transactions on Fundamentals of …, 2017 - search.ieice.org
Card-based protocols enable us to easily perform cryptographic tasks such as secure
multiparty computation using a deck of physical cards. Since the first card-based protocol …
multiparty computation using a deck of physical cards. Since the first card-based protocol …
Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen
Akari, Takuzu, Kakuro and KenKen are logic games similar to Sudoku. In Akari, a labyrinth
on a grid has to be lit by placing lanterns, respecting various constraints. In Takuzu a grid …
on a grid has to be lit by placing lanterns, respecting various constraints. In Takuzu a grid …