Actively revealing card attack on card-based protocols

DOI10.1007/s11047-020-09838-8zbMath1530.94045OpenAlexW3131134720MaRDI QIDQ6136456

Hideaki Sone, Daiki Miyahara, Ken Takashima, Takaaki Mizuki

Publication date: 31 August 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-020-09838-8

zbMATH Keywords

cryptographycard-based protocolssecure multiparty computationsactive security

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Cites Work

• Unnamed Item
• Secure multiparty computations without computers
• Analysis of information leakage due to operative errors in card-based protocols
• Card-based cryptography meets formal verification
• Efficient card-based zero-knowledge proof for Sudoku
• Card-based protocols for secure ranking computations
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Practical card-based implementations of Yao's millionaire protocol
• Card-Based Cryptographic Protocols Using a Minimal Number of Cards
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
• How to share a secret
• The Five-Card Trick Can Be Done with Four Cards
• More Efficient Match-Making and Satisfiability The Five Card Trick
• Six-Card Secure AND and Four-Card Secure XOR
• Computations with a deck of cards