Multi-party computation with small shuffle complexity using regular polygon cards

DOI10.1007/978-3-319-26059-4_7MaRDI QIDQ3467159zbMATH OpenOpenAlexFDO

Authors Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

Publication date 27 January 2016

Published in Provable Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26059-4_7

zbMATH Keywords

card-based protocolmulti-party computationpolygon cardsshuffle complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Card-based cryptographic protocols using a minimal number of cards
• Secure multi-party computation using polarizing cards
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Card-based protocols for any Boolean function

Cited in

(8)

• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Card-based zero-knowledge proof protocols for graph problems and their computational model
• Card-based protocols using triangle cards
• scientific article; zbMATH DE number 1941259 (Why is no real title available?)
• Securely computing the \(n\)-variable equality function with \(2n\) cards
• Physical zero-knowledge proof for ripple effect
• A physical zero-knowledge proof for Sumplete, a puzzle generated by ChatGPT
• Card-based cryptography meets 3D printer

This page was built for publication: Multi-party computation with small shuffle complexity using regular polygon cards

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