scholarly journals Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

2007 ◽  
pp. 129-147 ◽  
Author(s):  
Moti Yung ◽  
Yunlei Zhao
Keyword(s):  
Public Key ◽  
Zero Knowledge

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

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.

A new certificateless multiple key agreement scheme

2017 ◽  
Vol 09 (01) ◽  
pp. 1750002 ◽  
Author(s):  
Reza Alimoradi
Keyword(s):  
Key Agreement ◽  
Security Requirements ◽  
Public Key ◽  
Forward Secrecy ◽  
Zero Knowledge ◽  
Public Key Cryptosystems ◽  
Security Properties ◽  
Perfect Forward Secrecy ◽  
Major Shortcoming ◽  
Identity Based

Recently, by changing security requirements of computer networks, many public key schemes are introduced. One major shortcoming of identity-based cryptosystems is key screw. Certificateless public key cryptosystems were introduced to solve this problem. In this paper, a certificateless, public-key, multiple-key-agreement scheme will be offered which has some significant security properties such as perfect forward secrecy, strong security, and zero-knowledge proof. This scheme produces far more shared hidden keys per session in comparison with many existing schemes. In this paper, the security and the efficiency of the proposed scheme will be compared with some well-known current schemes.

scholarly journals An Improved Group Signature Scheme with VLR over Lattices

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Yanhua Zhang ◽  
Ximeng Liu ◽  
Yupu Hu ◽  
Huiwen Jia ◽  
Qikun Zhang
Keyword(s):  
Group Size ◽  
Public Key ◽  
Group Signature ◽  
Knowledge Argument ◽  
Signature Scheme ◽  
Zero Knowledge ◽  
Large Group ◽  
Corrected Version ◽  
Group Signatures ◽  
New Construction

For group signatures (GS) supporting membership revocation, verifier-local revocation (VLR) mechanism is the most flexible choice. As a post-quantum secure cryptographic counterpart of classical schemes, the first dynamic GS-VLR scheme over lattices was put forward by Langlois et al. at PKC 2014; furthermore, a corrected version was shown at TCS 2018. However, both designs are within Bonsai trees and featuring bit-sizes of group public-key and member secret signing key proportional to log    N where N is the group size; therefore, both schemes are not suitable for a large group. In this paper, we provide an improved dynamic GS-VLR over lattices, which is efficient by eliminating a O log    N factor for both sizes. To realize the goal, we adopt a more efficient and compact identity-encoding technique. At the heart of our new construction is a new Stern-type statistical zero-knowledge argument of knowledge protocol which may be of some independent cryptographic interest.

Sign in / Sign up

Export Citation Format

Share Document