|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ISEC, SITE, IPSJ-CSEC |
2006-07-21 10:45 |
Okayama |
Okayama Univ. |
Asymptotic Lower Bound on Round Complexity of Bounded Concurrent Black-Box Zero-Knowledge Proof Protocols Hirofumi Muratani (Toshiba) |
We derive a lower bound on the round complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof ... [more] |
ISEC2006-43 pp.19-26 |
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|