Abstract. In this paper, we propose a new ID-based threshold signature scheme from the bilinear pairings, which is provably secure in the random oracle model under the bilinear Diffie–Hellman assumption. Our scheme adopts the approach that the private key associated with an identity rather than

Digital signatures are an important primitive for building secure systems and are used in most real world security protocols. However, almost all popular signature schemes are either based on the factoring as-sumption (RSA) or the hardness of the discrete logarithm problem (DSA/ECDSA). In the case

protocols offer an efficient method to achieve an authenticati-on and a secure communication between two parties who share a secret key. For past decade, many protocols were proposed. Some of the properties of the most dominant protocols are based on the Diffie-Hellman messages or RSA assumption. Hence

updates from valid issuers. At the same time it is essential- for security and commercial reasons- to prove the authenticity of the device to other integrated systems to prevent product counterfeiting. The most widely used algorithms for digital signatures, RSA and ECDSA, depend on finite field engines

proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern’s scheme to 1/2 per round for the q-SD scheme. Our threshold ring signature scheme uses random linear codes over the field Fq, secure in the random

necessary permission from this third party to let Chalmers University of Technology and University of Gothenburg store the Work electronically and make it accessible on the Internet.

necessarily representing the official policies or endorsements, either express or implied, of ARO,

valid. Next, we prove that PKENO can be built out of robust non-interactive threshold publickey cryptosystems, a primitive seemingly weaker than identity-based encryption. Using the new transformation, we construct two efficient PKENO schemes: one based on the Decisional Diffie-Hellman assumption (in

individual. Unlike previous works, we do not make any simplifying assumption on the matching algorithm or use generic multiparty computation protocols in our constructions. We employ a commonly-used algorithm that works by first comparing minutia pairs from the two fingerprints based on their types

An approach based on Extreme Value Theory as a measure to quantify market risk of equity securities and portfolios