2007 |
12 | EE | Toshinori Araki,
Satoshi Obana:
Flaws in Some Secret Sharing Schemes Against Cheating.
ACISP 2007: 122-132 |
2006 |
11 | EE | Satoshi Obana,
Toshinori Araki:
Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution.
ASIACRYPT 2006: 364-379 |
2004 |
10 | EE | Tal Malkin,
Satoshi Obana,
Moti Yung:
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures.
EUROCRYPT 2004: 306-322 |
2002 |
9 | EE | Jun Furukawa,
Hiroshi Miyauchi,
Kengo Mori,
Satoshi Obana,
Kazue Sako:
An Implementation of a Universally Verifiable Electronic Voting Scheme based on Shuffling.
Financial Cryptography 2002: 16-30 |
2001 |
8 | | Satoshi Obana,
Kaoru Kurosawa:
Bounds and Combinatorial Structure of Multi-Receiver-Codes.
Des. Codes Cryptography 22(1): 47-63 (2001) |
7 | | Kaoru Kurosawa,
Satoshi Obana:
Combinatorial Bounds on Authentication Codes with Arbitration.
Des. Codes Cryptography 22(3): 265-281 (2001) |
2000 |
6 | | Satoshi Obana,
Kaoru Kurosawa:
Combinatorial Classification of Optimal Authentication Codes with Arbitration.
Des. Codes Cryptography 20(3): 281-305 (2000) |
1997 |
5 | | Kaoru Kurosawa,
Satoshi Obana:
Characterisation of (k, n) Multi-receiver Authentication.
ACISP 1997: 204-215 |
4 | | Satoshi Obana,
Kaoru Kurosawa:
A2-code = Affine resolvable = BIBD.
ICICS 1997: 118-129 |
1996 |
3 | EE | Satoshi Obana,
Kaoru Kurosawa:
Veto is Impossible in Secret Sharing Schemes.
Inf. Process. Lett. 58(6): 293-295 (1996) |
1995 |
2 | EE | Kaoru Kurosawa,
Satoshi Obana,
Wakaha Ogata:
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes.
CRYPTO 1995: 410-423 |
1 | EE | Kaoru Kurosawa,
Satoshi Obana:
Combinatorial Bounds for Authentication Codes with Arbitration.
EUROCRYPT 1995: 289-300 |