An Observation on Non-Malleable Witness-Indistinguishability and Non-Malleable Zero-Knowledge

Authors:
Zongyang Zhang;Zhenfu Cao;Rong Ma
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China
Venue:
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Year:
2009

Citing 14
Cited 0

The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Witness indistinguishable and witness hiding protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Nonmalleable Cryptography

SIAM Journal on Computing
Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Robust Non-interactive Zero Knowledge

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Zaps and their applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Universally Composable Protocols with Relaxed Set-Up Assumptions

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
New and Improved Constructions of Nonmalleable Cryptographic Protocols

SIAM Journal on Computing
Adaptive One-Way Functions and Applications

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Non-interactive zaps and new techniques for NIZK

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ostrovsky et al. [1] gave the first definition of non-malleable witness-indistinguishable argument systems. A surprising result given by them showed this notion was incomparable with the notion of non-malleable zero-knowledge. However, they only discussed their relations in the interactive setting. In this paper, we make an observation on relation between the two notions in the non-interactive setting. We show the two notions are still incomparable: that is, there are non-malleable non-interactive zero-knowledge proof systems that are not non-malleable non-interactive witness-indistinguishable, and vice versa.