Securely computing the n-variable equality function with 2n cards

DOI10.1007/978-3-030-59267-7_3MaRDI QIDQ5918602zbMATH OpenOpenAlexFDO

Authors 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

card-based cryptographydoubly symmetric functionequality functionsecure multi-party computationsymmetric function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• Card-based cryptographic protocols for three-input functions using private operations
• Card-based cryptographic protocols with a standard deck of cards using private operations
• Secure computation of any Boolean function based on any deck of cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Secure computations through checking suits of playing cards
• A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT

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

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