Card-based secure ranking computations

DOI10.1007/978-3-030-36412-0_37MaRDI QIDQ2180177zbMATH OpenOpenAlexFDO

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

Publication date 13 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_37

zbMATH Keywords

card-based protocolsdeck of cardsmillionaire problemsecure multiparty computationssecure ranking computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Card-based protocols for secure ranking computations
• Card-Based Secure Sorting Protocol
• Topics in Cryptology – CT-RSA 2006
• Secure computations through checking suits of playing cards
• Efficient and secure multiparty computations using a standard deck of playing cards
• Card-based protocols for securely computing the conjunction of multiple variables
• Advances in Cryptology - EUROCRYPT 2004
• Secure multi-party computation using polarizing cards
• Secure computation of any Boolean function based on any deck of cards
• Securely computing the \(n\)-variable equality function with \(2n\) cards

Cited in

(5)

• Card-based protocols for secure ranking computations
• Practical card-based implementations of Yao's millionaire protocol
• Practical and easy-to-understand card-based implementation of Yao's millionaire protocol
• Topics in Cryptology – CT-RSA 2006
• Card-Based Secure Sorting Protocol

This page was built for publication: Card-based secure ranking computations

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