Non-Malleable Zero-Knowledge Arguments with Lower Round Complexity

The Computer Journal ◽

10.1093/comjnl/bxaa076 ◽

2020 ◽

Author(s):

Zhenbin Yan ◽

Yi Deng

Keyword(s):

Computer Science ◽

Algebraic Approach ◽

Hash Functions ◽

Zero Knowledge ◽

Ieee Computer Society ◽

Proof Systems ◽

Theory Of Computing ◽

Round Complexity ◽

Man In The Middle ◽

Coin Tossing

Abstract Round complexity is one of the fundamental problems in zero-knowledge (ZK) proof systems. Non-malleable zero-knowledge (NMZK) protocols are ZK protocols that provide security even when man-in-the-middle adversaries interact with a prover and a verifier simultaneously. It is known that the first constant-round public-coin NMZK arguments for NP can be constructed by assuming the existence of collision-resistant hash functions (Pass, R. and Rosen, A. (2005) New and Improved Constructions of Non-Malleable Cryptographic Protocols. In Gabow, H.N. and Fagin, R. (eds) Proc. 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 2224, 2005, pp. 533542. ACM) and has relatively high round complexity; the first four-round private-coin NMZK arguments for NP can be constructed in the plain model by assuming the existence of one-way functions (Goyal, V., Richelson, S., Rosen, A. and Vald, M. (2014) An Algebraic Approach to Non-Malleability. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 1821, 2014, pp. 4150. IEEE Computer Society and Ciampi, M., Ostrovsky, R., Siniscalchi, L. and Visconti, I. (2017) Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. In Kalai, Y. and Reyzin, L. (eds) Theory of Cryptography15th Int. Conf., TCC 2017. Lecture Notes in Computer Science, Baltimore, MD, USA, November 1215, 2017, Part I, Vol. 10677, pp. 711742. Springer). In this paper, we present a six-round public-coin NMZK argument of knowledge system assuming the existence of collision-resistant hash functions and a three-round private-coin NMZK argument system from multi-collision resistance of hash functions assumption in the keyless setting.

Download Full-text

Probabilistic Proof Systems

BRICS Report Series ◽

10.7146/brics.v1i28.21643 ◽

1994 ◽

Vol 1 (28) ◽

Author(s):

Oded Goldreich

Keyword(s):

Computer Science ◽

Essential Role ◽

International Congress ◽

Zero Knowledge ◽

Proof Systems ◽

Interactive Proofs ◽

Broad Audience ◽

Computer Scientists ◽

Probabilistic Proof

Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such proof systems -- interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs -- stressing the essential role of randomness in each of them. This exposition is an expanded version of a survey written for the proceedings of the International Congress of Mathematicians (ICM94) held in Zurich in 1994. It is hope that this exposition may be accessible to a broad audience of computer scientists and mathematians.

Download Full-text

How to construct constant-round zero-knowledge proof systems for NP

Journal of Cryptology ◽

10.1007/bf00208001 ◽

1996 ◽

Vol 9 (3) ◽

pp. 167-189 ◽

Cited By ~ 10

Author(s):

Oded Goldreich ◽

Ariel Kahan

Keyword(s):

Zero Knowledge ◽

Proof Systems ◽

Zero Knowledge Proof

Download Full-text

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

BRICS Report Series ◽

10.7146/brics.v1i39.21604 ◽

1994 ◽

Vol 1 (39) ◽

Cited By ~ 12

Author(s):

Ivan B. Damgård ◽

Oded Goldreich ◽

Avi Wigderson

Keyword(s):

Protocol Design ◽

Zero Knowledge ◽

Round Complexity ◽

Large Round ◽

Interactive Hashing

In Crypto93, Damgård showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the honest verifier can be transformed into a protocol (for the same problem) that is zero-knowledge in general. 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.

Download Full-text

A Generalized Method for Constructing and Proving Zero-Knowledge Watermark Proof Systems

Digital Watermarking - Lecture Notes in Computer Science ◽

10.1007/978-3-540-31805-7_18 ◽

2005 ◽

pp. 204-217 ◽

Cited By ~ 2

Author(s):

Xianfeng Zhao ◽

Yingxia Dai ◽

Dengguo Feng

Keyword(s):

Zero Knowledge ◽

Proof Systems

Download Full-text

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

Lecture Notes in Computer Science - Progress in Cryptology – LATINCRYPT 2010 ◽

10.1007/978-3-642-14712-8_12 ◽

2010 ◽

pp. 189-204 ◽

Cited By ~ 2

Author(s):

S. Dov Gordon ◽

Hoeteck Wee ◽

David Xiao ◽

Arkady Yerukhimovich

Keyword(s):

Zero Knowledge ◽

Round Complexity

Download Full-text

Cryptographic Merkle-Damgard Hash Construction: MD5 Vulnerabilities

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2020.8913 ◽

2020 ◽

Vol 17 (6) ◽

pp. 2435-2440

Author(s):

Arvind K. Sharma ◽

S. K. Mittal

Keyword(s):

Network Security ◽

Computer Security ◽

Computer Science ◽

Resource Utilization ◽

Hash Functions ◽

Internet Security ◽

Time Space ◽

Hash Algorithm ◽

Encryption Decryption ◽

Utilization Time

Cryptography is a branch of Computer-Science which fully devotes towards further enhancements or innovations of various applications concern to information security i.e., to manage Confidentiality/ Integrity of resources. Confidentiality of resources most probably look after by ‘Encryption–Decryption’ techniques like ‘DES,’ ‘AES,’ ‘Blowfish,’ ‘Two-Fish,’ etc., were as ‘Integrity’ managed by Hash Functions, which have a distinct paramount significance in Network-Security/Computer- Security/Internet-Security. Both the ‘Integrity’ of data and ‘Authenticity’ of resource proved with the help of digest generated by the Hash algorithm. There are several hash algorithms available to provide distinct security, depends on how hard is to break it and pre-defined resource utilization (time/space). Some well-known names are MD4, MD5, SHA, JH, Skein, Grøstl, Blake, Hamsi, Fugue, Crush, Whirlpool, Tav, etc. In this article, we are focusing on vulnerabilities in the Merkle- Damgard scheme for constructing Hash-Functions with suitable implementation of MD5.

Download Full-text

A Survey: Cryptographic Hash Functions for Digital Stamping

Journal of Southwest Jiaotong University ◽

10.35741/issn.0258-2724.54.6.2 ◽

2019 ◽

Vol 54 (6) ◽

Author(s):

Israa Ezzat Salem ◽

Adil M. Salman ◽

Maad M. Mijwil

Keyword(s):

Computer Science ◽

Digital Signature ◽

Data Security ◽

Hash Function ◽

Hash Functions ◽

Mathematical Science ◽

Integrity Verification ◽

General Overview ◽

Rootkit Detection ◽

Cryptographic Hash Functions

The current study aims to examine a general overview of the application of hash functions in cryptography and study the relationships between cryptographic hash functions and uses of the digital signature. Functions of the cryptographic hash are an important tool applied in several sections of data security, and application of hash function is common and used for various purposes such as File Integrity Verification, Key Derivation, Time stamping, Password Hashing, Rootkit Detection and Digital Signature. Digital Signature is a code that is linked electronically with the document including the sender's identity. Therefore, the digital signature is of high value in verifying digital messages or documents. Cryptographic hash functions do not present without mathematics. The success of computer science is attributed to mathematics; in other words, it is because of mathematical science, that computer science was understood and could be explained to all. The study aims to teach the reader hash functions and its applications such as digital signature and to show in details some hash functions and their designing.

Download Full-text