2008 |
30 | EE | Takato Hirano,
Koichiro Wada,
Keisuke Tanaka:
Public-Key Cryptosystems with Primitive Power Roots of Unity.
ACISP 2008: 98-112 |
29 | EE | Akinori Kawachi,
Keisuke Tanaka,
Keita Xagawa:
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.
ASIACRYPT 2008: 372-389 |
28 | EE | Akira Numayama,
Toshiyuki Isshiki,
Keisuke Tanaka:
Security of Digital Signature Schemes in Weakened Random Oracle Models.
Public Key Cryptography 2008: 268-287 |
27 | EE | Daisuke Inoue,
Keisuke Tanaka:
Conditional Converge Cast.
IEICE Transactions 91-A(6): 1537-1540 (2008) |
2007 |
26 | EE | Ryotaro Hayashi,
Keisuke Tanaka:
Anonymity on Paillier's Trap-Door Permutation.
ACISP 2007: 200-214 |
25 | EE | Akinori Kawachi,
Keisuke Tanaka,
Keita Xagawa:
Multi-bit Cryptosystems Based on Lattice Problems.
Public Key Cryptography 2007: 315-329 |
24 | EE | Yoshifumi Kitamura,
Takashi Nakashima,
Keisuke Tanaka,
Takeshi Johkoh:
The IllusionHole for Medical Applications.
VR 2007: 231-234 |
2006 |
23 | EE | Ryotaro Hayashi,
Keisuke Tanaka:
PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity.
ACISP 2006: 271-282 |
22 | EE | Naoyuki Yamashita,
Keisuke Tanaka:
Secret Handshake with Multiple Groups.
WISA 2006: 339-348 |
21 | EE | Harunaga Hiwatari,
Keisuke Tanaka:
A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem.
IEICE Transactions 89-A(1): 203-205 (2006) |
20 | EE | Ryotaro Hayashi,
Keisuke Tanaka:
Schemes for Encryption with Anonymity and Ring Signature.
IEICE Transactions 89-A(1): 66-73 (2006) |
2005 |
19 | EE | Toshiyuki Isshiki,
Keisuke Tanaka:
An (n-t)-out-of-n Threshold Ring Signature Scheme.
ACISP 2005: 406-416 |
18 | EE | Ryotaro Hayashi,
Keisuke Tanaka:
Universally Anonymizable Public-Key Encryption.
ASIACRYPT 2005: 293-312 |
17 | EE | Hiroki Hada,
Keisuke Tanaka:
Security for Authenticated Key Exchange Based on Non-Malleability.
ICITA (2) 2005: 508-513 |
16 | EE | Akihiro Mihara,
Keisuke Tanaka:
Universal Designated-Verifier Signature with Aggregation.
ICITA (2) 2005: 514-519 |
15 | EE | Ryotaro Hayashi,
Keisuke Tanaka:
The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity.
Public Key Cryptography 2005: 216-233 |
14 | EE | Takao Onodera,
Keisuke Tanaka:
Shufle for Paillier's Encryption Scheme.
IEICE Transactions 88-A(5): 1241-1248 (2005) |
2004 |
13 | EE | Ryotaro Hayashi,
Tatsuaki Okamoto,
Keisuke Tanaka:
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications.
Public Key Cryptography 2004: 291-304 |
12 | EE | Shao Chin Sung,
Keisuke Tanaka:
Limiting negations in bounded-depth circuits: An extension of Markov's theorem.
Inf. Process. Lett. 90(1): 15-20 (2004) |
2003 |
11 | | Ruck Thawonmas,
Hiroki Hassaku,
Keisuke Tanaka:
Mimicry: Another Approach for Interactive Comedy.
GAME-ON 2003: 47- |
10 | EE | Shao Chin Sung,
Keisuke Tanaka:
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem.
ISAAC 2003: 108-116 |
9 | EE | Ruck Thawonmas,
Keisuke Tanaka,
Hiroki Hassaku:
Extended Hierarchical Task Network Planning for Interactive Comedy.
PRIMA 2003: 205-213 |
8 | EE | Keisuke Tanaka:
Quantum Bit-commitment for Small Storage Based on Quantum One-way Permutations.
New Generation Comput. 21(4): (2003) |
2002 |
7 | EE | Shao Chin Sung,
Keisuke Tanaka:
An exponential gap with the removal of one negation gate.
Inf. Process. Lett. 82(3): 155-157 (2002) |
2000 |
6 | EE | Tatsuaki Okamoto,
Keisuke Tanaka,
Shigenori Uchiyama:
Quantum Public-Key Cryptosystems.
CRYPTO 2000: 147-165 |
1998 |
5 | EE | Robert Beals,
Tetsuro Nishino,
Keisuke Tanaka:
On the Complexity of Negation-Limited Boolean Networks.
SIAM J. Comput. 27(5): 1334-1347 (1998) |
1996 |
4 | | Magnús M. Halldórsson,
Keisuke Tanaka:
Approximation and Special Cases of Common Subtrees and Editing Distance.
ISAAC 1996: 75-84 |
3 | EE | Keisuke Tanaka,
Tetsuro Nishino,
Robert Beals:
Negation-Limited Circuit Complexity of Symmetric Functions.
Inf. Process. Lett. 59(5): 273-279 (1996) |
1995 |
2 | EE | Robert Beals,
Tetsuro Nishino,
Keisuke Tanaka:
More on the complexity of negation-limited circuits.
STOC 1995: 585-595 |
1994 |
1 | EE | Keisuke Tanaka,
Tetsuro Nishino:
On the complexity of negation-limited Boolean networks.
STOC 1994: 38-47 |