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

Counterfeit Coin Problem Can be Extended to Secure Multiparty Computation

Shohei Kaneko, Yang Li, Kazuo Sakiyama, Daiki Miyahara

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-20026-6_2

Related papers

Statistically Secure Multiparty Computation of a Biased Coin

Amir Zarei, Staal A. Vinterbo

Lecture notes in computer science•Dec 20, 2024•0 citations

Symmetric cryptographic solution to Yao’s millionaires’ problem and an evaluation of secure multiparty computations

Shundong Li, Wang Daoshun, Dai Yiqi +1 more

Information Sciences•Jul 25, 2007•39 citations

On Anomaly Identification and the Counterfeit Coin Problem

Eldin Wee Chuan Lim

We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterfeit coin can be determined and expressed as a simple relation. We further suggest a possible application of this methodology to error detection in quantum information processing.

arXiv:0905.0085•May 1, 2009•2 citations

Quantum Coins

Michele Mosca, Douglas Stebila

One of the earliest cryptographic applications of quantum information was to create quantum digital cash that could not be counterfeited. In this paper, we describe a new type of quantum money: quantum coins, where all coins of the same denomination are represented by identical quantum states. We state desirable security properties such as anonymity and unforgeability and propose two candidate quantum coin schemes: one using black box operations, and another using blind quantum computation.

arXiv:0911.1295•Nov 6, 2009•0 citations

Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography

Ivan Damgård, Yuval Ishai, Mikkel Krøigaard

Lecture notes in computer science•Jan 1, 2010•183 citations

A New Approach to Round-Optimal Secure Multiparty Computation

Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain

Lecture notes in computer science•Jan 1, 2017•47 citations
We address a well-known problem in combinatorics involving the identification of counterfeit coins with a systematic approach. The methodology can be applied to cases where the total number of coins is exceedingly large such that brute force or enumerative comparisons become impractical. Based on the principle behind this approach, the minimum effort necessary for identification of the counterfeit coin can be determined and expressed as a simple relation. We further suggest a possible application of this methodology to error detection in quantum information processing.