Blockchain Papers

Yacov Yacobi, Zahava Shmuely

No abstract is available for this record.

Bo Yang, Yong Yu, Fagen Li, Ying Sun

No abstract is available for this record.

Melissa Chase, Anna Lysyanskaya

No abstract is available for this record.

Shafi Goldwasser, Rafail Ostrovsky

No abstract is available for this record.

Guilin Wang, Joonsang Baek, Duncan S. Wong, Feng Bao

No abstract is available for this record.

Dario Catalano, Ivan Visconti

No abstract is available for this record.

Xiao-Yun Jia, Shou-Shan Luo, Ping Chen, Chaowei Yuan

A publicly verifiable encryption scheme allows any entity to verify whether a ciphertext hides the same message as committed but without revealing it. This paper presents an efficient publicly verifiable encryption scheme based on RSA and extends zero-knowledge proof of knowledge, which is not only suitable for one-recipient RSA encryption, but also can be applied to multi-recipient situation. It is more efficient than other encryption schemes.

Dai Jun

In this paper, we describe a new zero-knowledge proof procotol based on the discrete logarithm and higherorder non-linear variable coefficient differential transformation. By using the high order differential state sequence, the casuality of the system and the capability of resistance to identity deception and differential attacks is enhanced. By introduction of differential transformation method and input-output table into zero-knowledge proof protocol, a new research field for cryptography of zero-knowledge proof identity authentication is thus opened up.

Zehui Wang, Zhiguo Zhang

No abstract is available for this record.

Lin Hua

This paperproposes a new zeroknowledge proofprotocolofidentification which combinesthe characteristics of the ECC and zero knowledge proof.As compared with the protocol with its security based on the hard for resolving the big number problem,the proposed protocol has more advantages than the former in the quantity of computing and traffic.

Yaling Zhang

This paper proposes a forward-secure undeniable digital signature scheme based on zero-knowledge proof.By combining the undeniable digital signature with the forward-secure digital signature,the new scheme keeps the general property of undeniable digital signature,and has the character of forward-secure,namely,the loss can be reduced to the lowest once the secret key is lost(or stolen).The scheme has some features such as undeniable and unforgeable of the digital signature,and the size of key and signature are short.The idea of zero-knowledge proof is used in key update protocol,which guarantees key update is secure.The scheme is secure under the assumption of standard intractability problems.

Pingshui Wang

Digital signature has been a basal means of identity authentication in era of network information.To improve the security of the digital signature schemes based on zero-knowledge proof technology,the problem of signature forgery by the signer in digital signature schemes based on the zero-knowledge concept is studied,the potential problem of these schemes are analyzed,a modified scheme for obtaining against such forgery without any increase of computation complexity is proposed,the feasibility,security and computation complexity of the modified scheme is concretely analyzed.

Gao Ji-zhong

Zero-knowledge proof is a protocol, and ElGamal's digital signature is widely applied. Gives a GMR module of zero-knowledge proof about ElGamal's digital signature which has little computation, high reliability, and easy to implement.

Xun Zhou

A zero-knowledge proof(ZKP) is a powerful tool which can be used and already be used for many cryptographic applications.But for the completeness property and the soundness property the existing zero-knowledge proofs are iterative in nature.The multiple communication rounds makes ZKPs unsuitable in practice.In this thesis,propose a new ZKP protocol which runs in one-round while ensure the completeness property and the soundness property.On the other hand,extend ZKPs to elliptic curves.At last,proposed a necessary condition which was needed by constructing a one-round zero-knowledge proofs protocol.

Fagen Li, Xiangjun Xin, Yupu Hu

An identity-based signcryption scheme with (t,n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t,n) threshold scheme and zero knowledge proof for the equality of two discrete logarithms based on the bilinear map. In this scheme, any third party can verify the validity of the signature, but only more than t members in the recipient group can cooperatively recover the message m. As compared to the Zhang et al.'s signcryption scheme with (t,n) shared unsigncryption based on discrete logarithms, the proposed scheme has the following advantages: it provides both public verifiability and forward security; the key management problem is simplified because of using identity-based cryptosystem.

Baozheng Yu, Congwei Xu

Recently, M. Sekhar gave a digital signature scheme with message recovery, where only a specific verifier can directly check the validity of the signature. A third party can distinguish a valid signature through a zero-knowledge proof protocol. However we find that the proposed scheme is insecure. A forgery attack strategy on M. Sekhar's scheme has been designed; anyone who has a valid signature can forge a signature on an arbitrary message. An improved signature scheme, which can resist the forgery attack and a zero-knowledge proof protocol with which a third party can distinguish a valid signature are presented. Also, the security of the improved scheme is analyzed

Pino Caballero‐Gil, Carlos Bruno-Castañeda

This work addresses the subject of mathematics education at secondary schools from a current and stimulating point of view intimately related to computational science. Cryptology is a captivating way of introducing into the classroom different mathematical subjects such as functions, matrices, modular arithmetic, combinatorics, equations, statistics and proofs, which usually are recognized as difficult for many students. Special attention is paid here to the concepts of proof and verification through the definition of zero-knowledge cryptographic protocols. Many other different cryptographic and cryptanalytic activities (building and breaking ciphers, respectively) and modern cryptographic applications such as secret-sharing protocols are also proposed as resources for motivating mathematics learning and for achieving a significant improvement in student understanding of several algebraic, analytical and statistical concepts.

Qianhong Wu, Yi Mu, Willy Susilo, Fangguo Zhang

No abstract is available for this record.

Tianqi Yang

An improved confirmer digital signature scheme was presented based on the analysis of the disadvantages of traditional confirmer signature algorithm and the introduction of zero-knowledge proof. In this scheme, signer need not directly provide his signature to the information, he just need to provide a zero-knowledge to prove that he has the information signature. This zero-knowledge proof includes the signer's identity information. Compared with the traditional confirmer signature algorithms, the improved scheme is simpler and more efficient, and has higher security.

Toru Nakanishi, Nobuo Funabiki

No abstract is available for this record.

John Malone-Lee

No abstract is available for this record.

Chunming Tang, Zhuojun Liu

Blum integers (BL), which has extensively been used in the domain of cryptography, are integers with form p , where p and q are di#erent primes both 3 mod 4 and k 1 and k 2 are odd integers. These integers can be divided two types: 1) M = pq, 2) M = p at least one of k 1 and k 2 is greater than 1.

Ping Li, Yaping Lin

It's essential on algorithm design of designated confirmer signatures to construct proofs satisfying security requirements such as unforgetablility, non-transferability, invisibility and zero-knowledge. A designated confirmer signature protocol (RSA-DCSV) is proposed, based on RSA encryption and signature schemes in forms of RSA extended modular computations. Proofs for a designated verifier are considered. Security analysis on RSA-DCSV is also addressed.

Dalu Zhang, Min Liu, Zhe Yang

A protocol for zero-knowledge proofs of identity based on ElGamal on conic is proposed in this paper. The solution to a hard puzzle is divided into two parts, and the P (prover) provides one of them according to the V (verifier) 's random bit. The eavesdropper cannot obtain any useful knowledge about the P (prover) 's identity during the process of authentication. No adversary in this protocol can cheat each other or get the privacy of each other. The security of this protocol relies on the discrete logarithm problem on conic over finite fields. Compared with those identification protocols implemented on elliptic, these kinds of identification protocols implemented on conic can be designed and implemented easier. Corresponding to the simple version, a parallel version is presented subsequently. The characteristic of ZKp and security of the simple version is proved. The trait of our identification protocol is given. We also analyzed the "soundness ", the "completeness ", before analyzed the amount of computation in the protocol. A simple solution considering t/sub timeout/ is proposed to prevent a potential leak of our protocol. Some problems need to be solved in the future is brought forward at the end of this paper.