Actively revealing card attack on card-based protocols

DOI10.1007/S11047-020-09838-8zbMATH Open1530.94045OpenAlexW3131134720MaRDI QIDQ6136456FDOQ6136456

Authors: Ken Takashima, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone 

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

cryptographysecure multiparty computationscard-based protocolsactive security

Mathematics Subject Classification ID

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

Cites Work

• How to share a secret
• Computations with a deck of cards
• Secure multiparty computations without computers
• 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
• Title not available (Why is that?)
• 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
• Foundations for actively secure card-based cryptography
• Analysis of information leakage due to operative errors in card-based protocols

Cited In (2)

• Title not available (Why is that?)
• Information leakage due to operative errors in card-based protocols

This page was built for publication: Actively revealing card attack on card-based protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136456)