Secure grouping protocol using a deck of cards

DOI10.1007/978-3-319-72089-0_8MaRDI QIDQ1705722zbMATH OpenOpenAlexFDO

Authors Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka, Yûji Hashimoto

Publication date 16 March 2018

Full work available at URL https://arxiv.org/abs/1709.07785

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)

Abstract: We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an information-theoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.

Recommendations

• Card-Based Secure Sorting Protocol
• Card-based cryptographic protocols with a standard deck of cards using private operations
• scientific article; zbMATH DE number 176546
• Card-based cryptographic protocols using a minimal number of cards
• Efficient and secure multiparty computations using a standard deck of playing cards
• scientific article; zbMATH DE number 2080254
• scientific article; zbMATH DE number 4191563
• A secure additive protocol for card players
• scientific article; zbMATH DE number 2080991
• Card-based protocols for securely computing the conjunction of multiple variables

Cited in

(10)

• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Physical zero-knowledge proof for ripple effect
• Efficient generation of a card-based uniformly distributed random derangement
• Efficient card-based protocols for generating a hidden random permutation without fixed points
• Efficient card-based zero-knowledge proof for Sudoku
• Card-based protocols for secure ranking computations
• A single shuffle is enough for secure card-based computation of any Boolean circuit
• Card-based zero-knowledge proof for Sudoku
• Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
• Card-Based Secure Sorting Protocol

This page was built for publication: Secure grouping protocol using a deck of cards

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