Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards

DOI10.1007/978-3-319-26059-4_7zbMath1388.94078OpenAlexW2273934861MaRDI QIDQ3467159

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

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

multi-party computationcard-based protocolpolygon cardsshuffle complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Card-based Protocols Using Triangle Cards ⋮ Card-based zero-knowledge proof protocols for graph problems and their computational model ⋮ A single shuffle is enough for secure card-based computation of any Boolean circuit ⋮ Securely computing the \(n\)-variable equality function with \(2n\) cards ⋮ Physical zero-knowledge proof for ripple effect