Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Card-Based Secure Ranking Computations

Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone

Published Jan 1, 2019• 8 citations
Publisher
DOI
10.1007/978-3-030-36412-0_37

Related papers

Secure Multiparty Computation of Ranking Using a Deck of Cards

Ken Takashima, Yuta Abe, Tatsuya Sasaki +4 more

IEICE Technical Report; IEICE Tech. Rep.•Jul 18, 2018•0 citations

Secure Computation of Any Boolean Function Based on Any Deck of Cards

Kazumasa Shinagawa, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2019•17 citations

Five-Card Secure Computations Using Unequal Division Shuffle

Akihiro Nishimura, Takuya Nishida, Yu‐ichi Hayashi +2 more

Lecture notes in computer science•Jan 1, 2015•22 citations

Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function

Reo Eriguchi, Kazumasa Shinagawa

Lecture notes in computer science•Jul 14, 2026•0 citations

Secure Multi-Party Computation Using Polarizing Cards

Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt +5 more

Lecture notes in computer science•Jan 1, 2015•13 citations

Card-based protocols for securely computing the conjunction of multiple variables

Takaaki Mizuki

Theoretical Computer Science•Feb 2, 2016•37 citations