Securely computing the \(n\)-variable equality function with \(2n\) cards

DOI10.1007/978-3-030-59267-7_3OpenAlexW3106729330MaRDI QIDQ5918602

Suthee Ruangwises, Toshiya Itoh

Publication date: 22 December 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-59267-7_3

zbMATH Keywords

symmetric functionsecure multi-party computationcard-based cryptographydoubly symmetric functionequality function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Card-based cryptographic protocols with a standard deck of cards using private operations ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT ⋮ Card-based cryptographic protocols for three-input functions using private operations

This page was built for publication: Securely computing the \(n\)-variable equality function with \(2n\) cards