Search Results

The border, or the approximative, model of algebraic computation (VP) is quite popular due to the Geometric Complexity Theory (GCT) approach to P≠NP conjecture, and its complex analytic origins. On the flip side, the definition of the border is ...

We prove a lower bound on the probability of Shor’s order-finding algorithm successfully recovering the order r in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the algorithm, a high ...

Problem definition: Smart contract improves the supply chain efficiency by enabling the supplier’s commitment to postshipment financing decisions, which mitigates the bank’s lending risk exposure and thereby reduces the financing cost. This paper ...

This paper is about quantum factoring all integers in an interval. Our goal is to be able to factor all positive integers N < 1,000. We reached this goal on a D-Wave 2000 qubit processor by minimizing (N – (p × q))² by using one routine that calls the ...

In this paper, we propose a mathematical model for determining the exact value of the reliability of Mobile Ad hoc (MANET) and Wireless Sensor (WSN) Networks which are considered in this research as a collection of Imperfect Stochastic Networks (ISN). ...

In [8], Kaltofen proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen's work, many questions remain unanswered regarding the complexity ...

Suppose that the private key of discrete logarithm-based or factoring-based public-key primitive is obtained by concatenating the outputs of a linear congruential generator. How seriously is the scheme weakened as a result__ __

While linear congruential ...

Proxy re-encryption (PRE) realizes delegation of decryption rights, enabling a proxy holding a re-encryption key to convert a ciphertext originally intended for Alice into an encryption of the same message for Bob, and cannot learn anything about the ...

To improve the decapsulation efficiency of HK09 (proposed by Hofheinz and Kiltz in Eurocrypt 2009), we propose a new skill to remove the exponent GCD operation. In the proposed scheme, the decapsulation efficiency is improved by 38.9% (instantiated over ...

The cipher text consistency check that can be implemented publicly has practical significance, and it is always an interested studying aspect to construct cryptographic algorithm without pairings in the field of cryptographic. On the other hand, it is ...

The terminal-pair reliability problem, i.e. the problem of determining the probability that there exists at least one path of working edges connecting the terminal nodes, is known to be NP-hard. Thus, bounding algorithms are used to cope with large ...

We revisit the notion of additively homomorphic encryption with a double decryption mechanism (DD-PKE), which allows for additions in the encrypted domain while having a master decryption procedure that can decrypt all properly formed ciphertexts by ...

We propose a new variant of HK09 (proposed by Hofheinz and Kiltz in Eurocrypt 2009) which improves the decapsulation efficiency at the price of a slightly increased key size. Compared with the original HK09 scheme the decapsulation efficiency is ...

We propose a new variant of HK09 (Proposed by Hofheinz and Kiltz in Eurocrypt2009) which simplifies the decapsulation. Our result is a tradeoff between the efficiency of encapsulation and decapsulation. Compared with original HK09 the efficiency of ...

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in ...

The determination of the reliability value for technical systems whose components are subjected to random failure possesses a wide range of applicability, e.g. in data communication networks, computer architectures and electrical power networks. The ...

We provide constructions for key assignment schemes that are provably secure under the factoring assumption in the standard model. Our first construction is for simple "chain" hierarchies, and achieves security against key recovery attacks with a tight ...

Laih and Kuo developed two highly secure and efficient signature schemes based on factoring and discrete logarithms. Unfortunately, their schemes require many keys for signing document and verifying signature. Li, Tzeng, and Hwang improved one of their ...

When using cryptography, there is frequently the misconception that if the keys are properly stored and are not given away, then the user is safe, if he uses a strong encryption algorithm. SETUPs exploit this common misconception, be embedding secret ...