Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model

2009 ◽  
pp. 127-137 ◽  
Author(s):  
Giovanni Di Crescenzo
Keyword(s):  
Public Key ◽  
Zero Knowledge ◽  
Round Complexity

From Laconic Zero-Knowledge to Public-Key Cryptography

2018 ◽  
pp. 674-697 ◽  
Author(s):  
Itay Berman ◽  
Akshay Degwekar ◽  
Ron D. Rothblum ◽  
Prashant Nalini Vasudevan
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Zero Knowledge

scholarly journals Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)

1994 ◽  
Vol 1 (39) ◽  
Author(s):  
Ivan B. Damgård ◽  
Oded Goldreich ◽  
Avi Wigderson
Keyword(s):  
Protocol Design ◽  
Zero Knowledge ◽  
Round Complexity ◽  
Large Round ◽  
Interactive Hashing

In <em>Crypto93</em>, Damgård showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the <em>honest</em> verifier can be transformed into a protocol (for the same problem) that is zero-knowledge <em>in general</em>. His transformation was based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung, and thus the resulting protocol had very large round-complexity.

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations

2010 ◽  
pp. 189-204 ◽  
Author(s):  
S. Dov Gordon ◽  
Hoeteck Wee ◽  
David Xiao ◽  
Arkady Yerukhimovich
Keyword(s):  
Zero Knowledge ◽  
Round Complexity

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.

Zero-Knowledge Protocols for Code-Based Public-Key Encryption

2015 ◽  
Vol E98.A (10) ◽  
pp. 2139-2151 ◽  
Author(s):  
Rong HU ◽  
Kirill MOROZOV ◽  
Tsuyoshi TAKAGI
Keyword(s):  
Public Key ◽  
Public Key Encryption ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document