Batch processing of interactive proofs

Authors:
Koji Chida;Go Yamamoto
Affiliations:
NTT Information Sharing Platform Laboratories, NTT Corporation, Japan;NTT Information Sharing Platform Laboratories, NTT Corporation, Japan
Venue:
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Year:
2007

Citing 8
Cited 1

A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Batch exponentiation: a fast DLP-based signature generation strategy

CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Random self-reducibility and zero knowledge interactive proofs of possession of information

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Fast exponentiation with precomputation

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Batch Processing for Proofs of Partial Knowledge and Its Applications

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new design principle for building a batch processing protocol for interactive proofs. First, a generic method to achieve batch processing is proposed when dealing with an NP-relation with certain homomorphicity. It is shown that the method preserves zero-knowledgeness and knowledge-soundness. Second, for some NP-relation that has no such homomorphicity, we illustrate that the relation can be decomposed into a homomorphic relation(hence we have a batch process) and another NP-relation that is proven using an efficient protocol. Such a decomposition provides an advantage in terms of efficiency.