A Note on "New techniques for noninteractive zero-knowledge"

05/04/2018
by   Zhengjun Cao, et al.
0

In 2012, Groth, et al. [J. ACM, 59 (3), 1-35, 2012] developed some new techniques for noninteractive zero-knowledge (NIZK) and presented: the first perfect NIZK argument system for all NP; the first universally composable NIZK argument for all NP in the presence of an adaptive adversary; the first noninteractive zap for all NP, which is based on a standard cryptographic security assumption. These solved several long-standing open questions. In this note, we remark that their basic system is flawed because the prover can cheat the verifier to accept a false claim. Thus, these problems remain open now.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2019

Post-Quantum Zero Knowledge in Constant Rounds

We construct the first constant-round zero-knowledge classical argument ...
research
12/18/2019

Practical Relativistic Zero-Knowledge for NP

In this work we consider the following problem: in a Multi-Prover enviro...
research
02/21/2023

A Note on Noisy Reservoir Computation

In this note we extend the definition of the Information Processing Capa...
research
10/05/2020

Note on Generalized Cuckoo Hashing with a Stash

Cuckoo hashing is a common hashing technique, guaranteeing constant-time...
research
07/08/2021

Consistency of the Maximal Information Coefficient Estimator

The Maximal Information Coefficient (MIC) of Reshef et al. (Science, 201...
research
04/27/2022

Insight into Voting Problem Complexity Using Randomized Classes

The first step in classifying the complexity of an NP problem is typical...
research
02/07/2018

Sparse Linear Discriminant Analysis under the Neyman-Pearson Paradigm

In contrast to the classical binary classification paradigm that minimiz...

Please sign up or login with your details

Forgot password? Click here to reset