Card-based cryptographic protocols for three-input functions using private operations
type: Item
instance of: scholarly article
title: Card-based cryptographic protocols for three-input functions using private operations
DOI: 10.1007/978-3-030-79987-8_33
author: Yoshifumi Manabe
author: Hibiki Ono
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495042
zbMATH Keywords: card-based cryptographic protocols
zbMATH Keywords: multi-party secure computation
zbMATH Keywords: Boolean functions
zbMATH Keywords: half adder
zbMATH Keywords: symmetric functions
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 33
OpenAlex ID: W3174631320
cites work: More Efficient Match-Making and Satisfiability The Five Card Trick
cites work: Physical zero-knowledge proof for Makaro
cites work: Q4341757
cites work: Interactive physical zero-knowledge proof for Norinori
cites work: Necessary and sufficient numbers of cards for securely computing two-bit output functions
cites work: Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
cites work: The minimum number of cards in practical card-based protocols
cites work: Card-Based Cryptographic Protocols Using a Minimal Number of Cards
cites work: A physical ZKP for Slitherlink: how to perform physical topology-preserving computation
cites work: Practical card-based implementations of Yao's millionaire protocol
cites work: Card-based protocols for securely computing the conjunction of multiple variables
cites work: Voting with a Logarithmic Number of Cards
cites work: The Five-Card Trick Can Be Done with Four Cards
cites work: Six-Card Secure AND and Four-Card Secure XOR
cites work: Q3412148
cites work: Efficient generation of a card-based uniformly distributed random derangement
cites work: Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations
cites work: Secure multiparty computations without computers
cites work: Card-Based Protocols for Any Boolean Function
cites work: Card-based protocols using unequal division shuffles
cites work: Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori
cites work: AND protocols using only uniform shuffles
cites work: Securely computing the \(n\)-variable equality function with \(2n\) cards
cites work: Physical zero-knowledge proof for ripple effect
cites work: Efficient card-based zero-knowledge proof for Sudoku
cites work: The six-card trick: secure computation of three-input equality
cites work: A single shuffle is enough for secure card-based computation of any Boolean circuit
cites work: Computations with a deck of cards
cites work: Card-based protocols for secure ranking computations
cites work: Physical Zero-Knowledge Proof for Suguru Puzzle
description: scientific article; zbMATH DE number 7495042