Presentation | 2006-07-20 Batch Processing of Interactive Proofs Go YAMAMOTO, Koji CHIDA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | Suppose one have to process many instances of a single interactive proof. We propose a design principle to configure a protocol that executes many instances. Our principle applies various honest verifier ZK protocols for NP-relations with certain homomorphicity. In addition we also propose an actual protocol for an NP-relation without such a homomorphisity. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Interactive Proof / Batch Processing |
Paper # | ISEC2006-25,SITE2006-22 |
Date of Issue |
Conference Information | |
Committee | SITE |
---|---|
Conference Date | 2006/7/13(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Social Implications of Technology and Information Ethics (SITE) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Batch Processing of Interactive Proofs |
Sub Title (in English) | |
Keyword(1) | Interactive Proof |
Keyword(2) | Batch Processing |
1st Author's Name | Go YAMAMOTO |
1st Author's Affiliation | NTT Corporation() |
2nd Author's Name | Koji CHIDA |
2nd Author's Affiliation | NTT Corporation |
Date | 2006-07-20 |
Paper # | ISEC2006-25,SITE2006-22 |
Volume (vol) | vol.106 |
Number (no) | 174 |
Page | pp.pp.- |
#Pages | 6 |
Date of Issue |