| Paper Abstract and Keywords |
| Presentation |
2006-03-23 15:05
Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes
Yoshiharu Seri, Takeshi Koshiba (Saitama Univ.) |
| Abstract |
(in Japanese) |
(See Japanese page) |
| (in English) |
We improve the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general computational assumption. The best known scheme is the one-way permutation based scheme due to Naor, Ostrovsky, Venkatesan and Yung and its round complexity is O(n). We consider a naive parallel version of their scheme of the multiplicity log(n) and obtain an O(n/log(n))-round scheme. Our improvement answers a question, raised by them, whether their O(n)-round scheme is essential with respect to the round complexity. Though such a parallelization raises an analytic difficulty, we introduce a new analysis technique and then overcome the difficulty. Our technique copes with expected almost pairwise independent random variables instead of the pairwise independence, which is a key property in their analysis. While the expected almost pairwise independence plays an important role in our security proof, it also provides alternative security proof for the original scheme. |
| Keyword |
(in Japanese) |
(See Japanese page) |
| (in English) |
bit commitment / computational binding / one-way permutation / perfect concealing / round complexity / zero-knowledge argument / / |
| Reference Info. |
IEICE Tech. Rep., vol. 105, no. 680, COMP2005-68, pp. 39-46, March 2006. |
| Paper # |
COMP2005-68 |
| Date of Issue |
2006-03-16 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 |
| Download PDF |
|
| Conference Information |
| Committee |
COMP |
| Conference Date |
2006-03-22 - 2006-03-23 |
| Place (in Japanese) |
(See Japanese page) |
| Place (in English) |
The University of Electro-Communications |
| Topics (in Japanese) |
(See Japanese page) |
| Topics (in English) |
|
| Paper Information |
| Registration To |
COMP |
| Conference Code |
2006-03-COMP |
| Language |
English (Japanese title is available) |
| Title (in Japanese) |
(See Japanese page) |
| Sub Title (in Japanese) |
(See Japanese page) |
| Title (in English) |
Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes |
| Sub Title (in English) |
|
| Keyword(1) |
bit commitment |
| Keyword(2) |
computational binding |
| Keyword(3) |
one-way permutation |
| Keyword(4) |
perfect concealing |
| Keyword(5) |
round complexity |
| Keyword(6) |
zero-knowledge argument |
| Keyword(7) |
|
| Keyword(8) |
|
| 1st Author's Name |
Yoshiharu Seri |
| 1st Author's Affiliation |
Saitama Univeristy (Saitama Univ.) |
| 2nd Author's Name |
Takeshi Koshiba |
| 2nd Author's Affiliation |
Saitama Univeristy (Saitama Univ.) |
| 3rd Author's Name |
|
| 3rd Author's Affiliation |
() |
| 4th Author's Name |
|
| 4th Author's Affiliation |
() |
| 5th Author's Name |
|
| 5th Author's Affiliation |
() |
| 6th Author's Name |
|
| 6th Author's Affiliation |
() |
| 7th Author's Name |
|
| 7th Author's Affiliation |
() |
| 8th Author's Name |
|
| 8th Author's Affiliation |
() |
| 9th Author's Name |
|
| 9th Author's Affiliation |
() |
| 10th Author's Name |
|
| 10th Author's Affiliation |
() |
| 11th Author's Name |
|
| 11th Author's Affiliation |
() |
| 12th Author's Name |
|
| 12th Author's Affiliation |
() |
| 13th Author's Name |
|
| 13th Author's Affiliation |
() |
| 14th Author's Name |
|
| 14th Author's Affiliation |
() |
| 15th Author's Name |
|
| 15th Author's Affiliation |
() |
| 16th Author's Name |
|
| 16th Author's Affiliation |
() |
| 17th Author's Name |
|
| 17th Author's Affiliation |
() |
| 18th Author's Name |
|
| 18th Author's Affiliation |
() |
| 19th Author's Name |
|
| 19th Author's Affiliation |
() |
| 20th Author's Name |
|
| 20th Author's Affiliation |
() |
| Speaker |
Author-1 |
| Date Time |
2006-03-23 15:05:00 |
| Presentation Time |
35 minutes |
| Registration for |
COMP |
| Paper # |
COMP2005-68 |
| Volume (vol) |
vol.105 |
| Number (no) |
no.680 |
| Page |
pp.39-46 |
| #Pages |
8 |
| Date of Issue |
2006-03-16 (COMP) |