Satoshi Obana |
|
|---|---|
| 8 papers in database with 136 citations H-number: 6 | |
Journal Papers |
|
| 1. Kaoru Kurosawa, Satoshi Obana, Combinatorial Bounds on Authentication Codes with Arbitration, Designs, Codes and Cryptography,
Volume 22(3), pp. 265 - 281,
Springer, 2001. [  Electronic
Edition][ Cited
16 times
] | |
| 2. Satoshi Obana, Kaoru Kurosawa, Bounds and Combinatorial Structure of Multi-Receiver-Codes, Designs, Codes and Cryptography,
Volume 22(1), pp. 47 - 63,
Springer, 2001. [ Electronic
Edition][No
citation] | |
| 3. Satoshi Obana, Kaoru Kurosawa, Combinatorial Classification of Optimal Authentication Codes with Arbitration, Designs, Codes and Cryptography,
Volume 20(3), pp. 281 - 305,
Springer, 2000. [ Electronic
Edition][Cited
1 times
] | |
Conference Papers |
|
| 1. Satoshi Obana, Toshinori Araki, Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution, pp. 364 - 379, ASIACRYPT 2006. [ Electronic
Edition][Cited
9 times
] | |
| 2. Tal Malkin, Satoshi Obana, Moti Yung, The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures, pp. 306 - 322, EUROCRYPT 2004. [ Electronic
Edition][ IACR Online
Archive ][Cited
32 times
] | |
| 3. Jun Furukawa, Hiroshi Miyauchi, Kengo Mori, Satoshi Obana, Kazue Sako, An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling, pp. 16 - 30, FC 2002. [ Electronic
Edition][Cited
38 times
] | |
| 4. Kaoru Kurosawa, Satoshi Obana, Wakaha Ogata, t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes, pp. 410 - 423, CRYPTO 1995. [ Electronic
Edition][Cited
16 times
] | |
| 5. Kaoru Kurosawa, Satoshi Obana, Combinatorial Bounds for Authentication Codes with Arbitration, pp. 289 - 300, EUROCRYPT 1995. [ Electronic
Edition][Cited
24 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals