Related papers: Some Results on the Counterfeit Coins Problem
We prove Union-Closed sets conjecture.
We analyse the security of some variants of the CFS code-based digital signature scheme. We show how the adoption of some code-based hash-functions to improve the efficiency of CFS leads to the ability of an attacker to produce a forgery…
The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing…
Publicly verifiable quantum money is a protocol for the preparation of quantum states that can be efficiently verified by any party for authenticity but is computationally infeasible to counterfeit. We develop a cryptographic scheme for…
A moment problem is presented for a class of signed measures which are termed pseudo-positive. Our main result says that for every pseudo-positive definite functional (subject to some reasonable restrictions) there exists a representing…
Credit card fraud has emerged as major problem in the electronic payment sector. In this survey, we study data-driven credit card fraud detection particularities and several machine learning methods to address each of its intricate…
In this paper some new ways of generalizing perfect numbers are investigated, numerical results are presented and some conjectures are established.
In the paper, there are new found methods to determine the range of every exceptional element in exceptional set, we can solve Twin primes problem and Goldbach Conjecture problem basically.
In this note we prove a weighted version of the Khintchine inequalities.
We prove Bitcoin is secure under temporary dishonest majority. We assume the adversary can corrupt a specific fraction of parties and also introduce crash failures, i.e., some honest participants are offline during the execution of the…
A variant of the well-known Knapsack Problem is studied in this paper, where pairs of items are conflicting, and cannot be selected at the same time. This configures a set of hard constraints. The problem, which can be used to model real…
We present an analysis of Wiesner's quantum money scheme, as well as some natural generalizations of it, based on semidefinite programming. For Wiesner's original scheme, it is determined that the optimal probability for a counterfeiter to…
We establish basic results on subrings of finite commutative rings and closely related rings. Among other applications we calculate the number of maximal subrings of a finite commutative local ring.
In a quantum money scheme, a bank can issue money that users cannot counterfeit. Similar to bills of paper money, most quantum money schemes assign a unique serial number to each money state, thus potentially compromising the privacy of the…
The Sequential Multiple Knapsack Problem is a special case of Multiple knapsack problem in which the items sizes are divisible. A characterization of the optimal solutions of the problem and a description of the convex hull of all the…
Quantum money is a cryptographic protocol in which a mint can produce a quantum state, no one else can copy the state, and anyone (with a quantum computer) can verify that the state came from the mint. We present a concrete quantum money…
We derive various weighted summation identities, including binomial and double binomial identities, for Tribonacci numbers. Our results contain some previously known results as special cases.
Identities and inequalities for the cosine and sine functions are obtained.
In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in hypercubes is equivalent to the coin weighing problem. Then…
In this paper, we survey some recent results on the Artin conjecture and discuss some aspects for the Artin conjecture.