The Zero-Knowledge Proof Schemes Based on Williams Public-Key Cryptosystem

2012 ◽  
Vol 546-547 ◽  
pp. 526-530
Author(s):  
Qian Zhang ◽  
De Han
Keyword(s):  
Proof Theory ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Zero Knowledge ◽  
Proof Schemes ◽  
Proof Scheme ◽  
Set Up ◽  
Zero Knowledge Proof

In this paper, through introducing the Williams public-key cryptosystem in detail, the analysis of the characteristics of the system, and the combination with zero knowledge proof, we set up a zero-knowledge proof scheme based on Williams public-key cryptosystem. The scheme will enrich the theory of cryptography, and particularly zero-knowledge proof theory.

scholarly journals Non-interactive zero-knowledge proof scheme from RLWE-based key exchange

PLoS ONE ◽  
2021 ◽  
Vol 16 (8) ◽  
pp. e0256372
Author(s):  
Shaofen Xie ◽  
Wang Yao ◽  
Faguo Wu ◽  
Zhiming Zheng
Keyword(s):  
Hash Function ◽  
Key Exchange ◽  
Public Key ◽  
Public Key Encryption ◽  
Zero Knowledge ◽  
Proof Schemes ◽  
Proof Scheme ◽  
Verification Time ◽  
Public Verification ◽  
Zero Knowledge Proof

Lattice-based non-interactive zero-knowledge proof has been widely used in one-way communication and can be effectively applied to resist quantum attacks. However, lattice-based non-interactive zero-knowledge proof schemes have long faced and paid more attention to some efficiency issues, such as proof size and verification time. In this paper, we propose the non-interactive zero-knowledge proof schemes from RLWE-based key exchange by making use of the Hash function and public-key encryption. We then show how to apply the proposed schemes to achieve the fixed proof size and rapid public verification. Compared with previous approaches, our schemes can realize better effectiveness in proof size and verification time. In addition, the proposed schemes are secure from completeness, soundness, and zero-knowledge.

scholarly journals ZERO KNOWLEDGE PASSWORD AUTHENTICATION PROTOCOL

2012 ◽  
pp. 30-34
Author(s):  
NIVEDITA DATTA
Keyword(s):  
Mutual Authentication ◽  
Public Key Cryptography ◽  
Authentication Protocol ◽  
Public Key ◽  
Zero Knowledge ◽  
Password Authentication ◽  
Valuable Data ◽  
Authentication Server ◽  
Simple Protocol ◽  
Zero Knowledge Proof

In many applications, the password is sent as cleartext to the server to be authenticated thus providing the eavesdropper with opportunity to steal valuable data. This paper presents a simple protocol based on zero knowledge proof by which the user can prove to the authentication server that he has the password without having to send the password to the server as either cleartext or in encrypted format. Thus the user can authenticate himself without having to actually reveal the password to the server. Also, another version of this protocol has been proposed which makes use of public key cryptography thus adding one more level of security to the protocol and enabling mutual authentication between the client & server.

scholarly journals Analisis Pola Identifikasi Zero Knowledge Proof Dengan Algoritma Feige Fiat Shamir Menggunakan Blum Blum Shub

2021 ◽  
pp. 7-12
Author(s):  
Cherlina Helena Purnamasari Panjaitan ◽  
Lisda Juliana Pangaribuan
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Public Key ◽  
Key Generation ◽  
Number Generator ◽  
Zero Knowledge ◽  
The Public ◽  
Public Keys ◽  
Generation Test ◽  
Zero Knowledge Proof

Protocol Zero Knowledge Proof is one of the protocols in Cryptography that has a fairly good level of security, because it applies the concept of "Truly Zero Knowledge Proof" which is not leaking any information. This protocol is used in the Fiat Shamir, Guillou Quisquater and Schnorr Feige Algorithms, all of which are Cryptographic Algorithms using private keys and public keys. In the Public key, all three of these Algorithms use a random number generator at the values p and q to get the public key. In this study, the author will generate a public key generation test using CPRNG (Cryptographically-secure Pseudo-Random Number Generator) with the Blum Blum Shub algorithm. The test will be conducted on the Fiat Feige Algorithm, the formation of the key will use the Blum Blum Shub Algorithm, but the Identification Protocol still uses the Fiat Shamir Feige Algorithm. The results of this study show the Feige Fiat Algorithm with the Blum Blum Shub Algorithm as the key builder successfully identifies the pattern sent by the signer.

An Efficient Key Generation of ZHFE Public Key Cryptosystem

2018 ◽  
Vol E101.A (1) ◽  
pp. 29-38
Author(s):  
Yasuhiko IKEMATSU ◽  
Dung Hoang DUONG ◽  
Albrecht PETZOLDT ◽  
Tsuyoshi TAKAGI
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Key Generation
Sign in / Sign up

Export Citation Format

Share Document