Aiming at the problem that current schemes can not protect the benefits of proxy signer and message owner at the same time,this paper presents a blind proxy blind signature scheme on elliptic curve. By using Elliptic Curve Cryptography(ECC) and zero-knowledge proof,it has small amount of computing,high security and high implementation efficiency. Security analysis proves that the scheme satisfies the security properties of blind proxy signature scheme and proxy blind signature scheme,and it has strong enforceability.
Abstract- This paper introduces a new intractable security problem whose intractability is due to the NP completeness of multivariate quadratic problem. This novel problem uses quaternion algebra in conjunction with MQ. Starting with the simultaneous multivariate equations, we transform these equations into simultaneous quaternion based multivariate quadratic equations. A new scheme for computational zero knowledge proof based on this problem is proposed. It is proved that according to black box definition of zero knowledge proof (ZKP) system, the proposed scheme is ZKP. Our proof has two lemmas. The proof is done through two lemmas. In the first lemma it is shown that expected polynomial time machine *VM halts in a polynomial time. In the second lemma, it is showed that the probability ensembles
In this paper,two zero-knowledge proof schemes based on the elliptic curve groups are given.Both of the schemes make party A claim to party B that it owns some kind of information,and make party B believe that it indeed owns the information through interactive proof,at the same time,the information is not leaked out.
A proxy signature scheme enables a proxy signer to sign messages on behalf of the original signer. In this paper we propose an efficient proxy signature scheme based on RSA signature scheme, which divides the document M into m blocks and adds some redundant bits to each message block. We also give a kind of algorithm of the zero-knowledge proof of proposed digital signature. This algorithm has characteristics which has little computation, high reliability, and easy to be realized. The proposed signature scheme satisfies the secure requirements and is efficient.
Tompa and Woll constructed a zero-knowledge proof of knowing a square root of $X$ mod $N$, where $N$ is the product of two large, secret primes. In this paper, we construct a zero-knowledge proof of knowing a square root of $X_1$ or $X_2$ mod $N$. Compared with the existing solution to this problem, ours is significantly simpler.
CL-PKC is a kind of public-key cryptosystem,which was proposed recently.It preserves the advantages of non public-key certificate and also has solved the key escrow problem in the ID-PKC.Many people are highly concerned about the design method of safe and efficient signature scheme in the certificateless system.In this paper,we construct a new certificateless undeniable signature by using bilinear pairings and zero-knowledge proof protocol.
This paper proposes a new zero-knowledge proof protocol of identification which combines the characteristics of the ECC and zero-knowledge proof.The proposed protocol has more advantages in the aspect of the quantity of computing and traffic.
Physical Unclonable Functions (PUFs) and Hardware Security
Certificate-based cryptography solves certificate revocation problem and eliminate third-party queries in the traditional PKI and avoid key escrow in the ID-based cryptography. It is a better alternative for the traditional public key system. In this paper, we proposed an efficient certificate based signature scheme based on Schnorr signature and zero-knowledge proof technique. Our proposed scheme doesn't use pairing operator which is the most expensive computation. Then we show that our proposed scheme is proven to be against two forgeable attacks in the random oracles model, and the security is related to that of Schnorr signature.
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing product equations (Eurocrypt 2008) to two related cryptographic problems: compact e-cash (Eurocrypt 2005) and simulatable verifiable random functions (CRYPTO 2007). We present the first efficient compact e-cash scheme that does not rely on a random oracle. To this end we construct efficient GS proofs for signature possession, pseudo randomness and set membership. The GS proofs for pseudorandom functions give rise to a much cleaner and substantially faster construction of simulatable verifiable random functions (sVRF) under a weaker number theoretic assumption. We obtain the first efficient fully simulatable sVRF with a polynomial sized output domain (in the security parameter). 1
Non-interactive zero-knowledge proofs, particularly those constructed on top of bilinear groups, have been significantly studied in cryptography and used in a wide variety of applications in recent years. One very powerful suite of techniques for proofs over bilinear groups is the Groth-Sahai proof system, which provides efficient non-interactive witnessindistinguishable and zero-knowledge proofs without relying on any one assumption or language. The Groth-Sahai suite of proofs has already been used in a number of applications, including group signature schemes, anonymous voting, and anonymous credentials. In this paper, we describe a technique that allows us to prove that two GS commitments open to the same value. We then use this technique to create a non-interactive zero-knowledge protocol that satisfies a stronger version of zero-knowledge than the original GS protocol. Finally, we use both these techniques to provide a new extension of the proof system that makes it into a non-interactive zero-knowledge proof of knowledge of an exponent. We then outline new building blocks based on this technique that can be used in a variety of applications. The main application of our technique will involve using it to construct a fully
In this paper, we proposed a new signature scheme based on elliptic curve cryptography. We combined the two problems, factoring and logarithm problem into both signing and verifying equations. We also give a kind of algorithm of the zero-knowledge proof of proposed digital signature. The new scheme was shown to be secure against the known attacks for signature schemes. This algorithm has characteristics which has little computation, high reliability, and easy to be realized.
A new scheme of dynamic group blind signature based on elliptic curve discrete logarithm problem (ECDLP) which extends the dynamic group blind signature and the knowledge signature to the elliptic curve cyclic group is generalized. The scheme runs in time slice manner and can be proved security with zero knowledge proof. It supports the dynamic addition and deletion of the group members freely. And the length of signature and computational effort for signing and verifying are independent on both the number of group members and the deleted members. So the security and efficiency are enhanced.
A practical publicly verifiable secret sharing (PVSS) is constructed based on the bilinear pairing on elliptic curves, which has all advantages of B. Schoenmakerspsila PVSS and its secret is not the form of discrete logarithm, thus this PVSS is extremely practical. Moreover, in the schemepsilas distribution of shares phase, only using bilinearity of bilinear pairing, anybody can verify whether the participants received correct shares without implementing zero-knowledge proofs, without implementing the non-interactive protocol and without construction so called witness of shares applying Fiat-Shamirpsilas technique. Subsequently, in the schemepsilas reconstruction of secret phase, the released shares may be verified by anybody with the same method. Since the PVSS need not to implement non-interactive protocol to prevent malicious players. Therefore this scheme is simpler, more efficient and practical suitable for some especially case.
Digital signature is used in e-commerce and e-government more and more widely, most because it guarantees the integral-ity, facticity of signature data and undeniability of digital signature. But in practical application it is often needed that more users sign the same paper, so in this case, users need multi-signature. This paper proposed a digital multi-signature scheme based on conic curve over Zn. It can avoid the cheating by signers by Zero-knowledge proof, sending signature again and again by adding time symbol, fabricating signature by embedding signature into point of conic Curve. Its security is based on the difficulties in factor-izing large integer and computing discrete logarithm, so it has stronger dependability and ability of anti-decoding.
A non-interactive zero-knowledge proof protocol based on Elliptic Curve Encryption was proposed,and based this protocol,a publicly verified secret sharing scheme was proposed too.In the scheme,secret and secret shadow were embedded onto the points of Elliptic Curve,anybody can verify them publicly,and only the legitimate participants set can recover the secret key,but knowing nothing about the secret key.This scheme can prevent adversaries from getting the secret,the dealer from distributing improper data and the participants from cheating each other efficiently.Furthermore, it is propitious for the replication and update of secret.