Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

The Round Complexity of Quantum Zero-Knowledge

Orestis Chardouvelis, Giulio Malavolta

Published Jan 1, 2021• 2 citations
Publisher
DOI
10.1007/978-3-030-90459-3_5

Related papers

A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds

Nai-Hui Chia, Kai-Min Chung, Takashi Yamakawa

Lecture notes in computer science•Jan 1, 2021•16 citations

On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption

Divya Gupta, Amit Sahai

Lecture notes in computer science•Jan 1, 2014•16 citations

On Round-Optimal Zero Knowledge in the Bare Public-Key Model

Alessandra Scafuro, Ivan Visconti

Lecture notes in computer science•Jan 1, 2012•26 citations

On the Round Complexity of Secure Quantum Computation

James Bartusek, Andrea Coladangelo, Dakshita Khurana +1 more

Lecture notes in computer science•Jan 1, 2021•22 citations

Some Constant-Round Zero-KnowledgeProtocols

Liu Hanwu, Dongdai Lin

The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zero- knowledge protocols is a very important e±ciency con- sideration, and in general it is desirable to have zero- knowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the veri¯er and use the method to construct some con- stant round honest-veri¯er zero-knowledge protocols. The notion of honest-veri¯er zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.

Chinese Journal of Electronics•Jan 5, 2010•0 citations

Zero Knowledge Argument System in Bare Public Key Model Set

Yiming Zhao

This paper analyzes the development and properties of zero knowledge argument systems in Bare Public Key(BPK) model set, according to the researches and applications of recent years. The generic 4-round mode and 3-round mode are proposed for the constructions of zero knowledge protocols with optimal round complexity, following explorations on the proof techniques of (concurrent) soundness and (resettable) zero knowledge of the protocols. Possible focuses of the near future are discussed.

Jisuanji gongcheng•Jan 1, 2009•0 citations
The concept of zero-knowledge has been extensively used in the design of cryptographic protocols since being introduced. The round complexity of zero- knowledge protocols is a very important e±ciency con- sideration, and in general it is desirable to have zero- knowledge protocols with constant numbers of rounds. In this paper, we suggest a novel method to use the program of the veri¯er and use the method to construct some con- stant round honest-veri¯er zero-knowledge protocols. The notion of honest-veri¯er zero-knowledge protocols is highly non-trivial and fascinating itself. It also has many other uses.