- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j18 |      | Tatsuya Akutsu, Daiji Fukagawa, Magnús M. Halldórsson, Atsuhiro Takasu, Keisuke Tanaka: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees. Theor. Comput. Sci. 470: 10-22 (2013) |
| c41 | | Toshiyuki Isshiki, Manh Ha Nguyen, Keisuke Tanaka: Proxy Re-Encryption in a Stronger Security Model Extended from CT-RSA2012. CT-RSA 2013: 277-292 |
| c40 | | Shinzo Koyama, Kazutoshi Onozawa, Keisuke Tanaka, Yoshihisa Kato: A 3D vision 2.1Mpixel image sensor for single-lens camera systems. ISSCC 2013: 492-493 |
| c39 | | |
| 2012 | ||
| j17 | | Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka: An Efficient Non-interactive Universally Composable String-Commitment Scheme. IEICE Transactions 95-A(1): 167-175 (2012) |
| j16 | | Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka: A Multi-Trapdoor Commitment Scheme from the RSA Assumption. IEICE Transactions 95-A(1): 176-184 (2012) |
| c38 | | Haruna Higo, Keisuke Tanaka, Akihiro Yamada, Kenji Yasunaga: A Game-Theoretic Perspective on Oblivious Transfer. ACISP 2012: 29-42 |
| c37 | | Manh Ha Nguyen, Keisuke Tanaka, Kenji Yasunaga: Leakage-Resilience of Stateless/Stateful Public-Key Encryption from Hash Proofs. ACISP 2012: 208-222 |
| c36 | | Akinori Kawachi, Hirotoshi Takebe, Keisuke Tanaka: Symmetric-Key Encryption Scheme with Multi-ciphertext Non-malleability. IWSEC 2012: 123-137 |
| c35 | | Mario Larangeira, Keisuke Tanaka: Reduction-Centric Non-programmable Security Proof for the Full Domain Hash in the Random Oracle Model. WISA 2012: 124-143 |
| 2011 | ||
| j15 | | Christopher Portmann, Keisuke Tanaka: Information-Theoretic Secrecy with Access to Decryption Oracles. IEICE Transactions 94-A(7): 1585-1590 (2011) |
| c34 | | Akinori Kawachi, Christopher Portmann, Keisuke Tanaka: Characterization of the Relations between Information-Theoretic Non-malleability, Secrecy, and Authenticity. ICITS 2011: 6-24 |
| c33 | | Keisuke Tanaka, Akihiro Yamada, Kenji Yasunaga: Weak Oblivious Transfer from Strong One-Way Functions. ProvSec 2011: 34-51 |
| c32 | | Hitoshi Namiki, Keisuke Tanaka, Kenji Yasunaga: Randomness Leakage in the KEM/DEM Framework. ProvSec 2011: 309-323 |
| i3 | | Akinori Kawachi, Christopher Portmann, Keisuke Tanaka: Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity. IACR Cryptology ePrint Archive 2011: 92 (2011) |
| 2010 | ||
| j14 | | Toshiyuki Isshiki, Koichiro Wada, Keisuke Tanaka: A Rational Secret-Sharing Scheme Based on RSA-OAEP. IEICE Transactions 93-A(1): 42-49 (2010) |
| j13 | | Takato Hirano, Keisuke Tanaka: Key Generation for Fast Inversion of the Paillier Encryption Function. IEICE Transactions 93-A(6): 1111-1121 (2010) |
| c31 | | Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka: A Multi-trapdoor Commitment Scheme from the RSA Assumption. ACISP 2010: 182-199 |
| c30 | | Toshihide Matsuda, Ryo Nishimaki, Keisuke Tanaka: CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model. Public Key Cryptography 2010: 261-278 |
| c29 | | Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. Public Key Cryptography 2010: 403-419 |
| i2 | | Akinori Kawachi, Akira Numayama, Keisuke Tanaka, Keita Xagawa: Security of Encryption Schemes in Weakened Random Oracle Models. IACR Cryptology ePrint Archive 2010: 122 (2010) |
| 2009 | ||
| j12 | | Daisuke Inoue, Keisuke Tanaka: Symmetricity of the Protocols Related to Oblivious Transfer. IEICE Transactions 92-A(1): 217-221 (2009) |
| j11 | | Takato Hirano, Koichiro Wada, Keisuke Tanaka: Primitive Power Roots of Unity and Its Application to Encryption. IEICE Transactions 92-A(8): 1836-1844 (2009) |
| c28 | | |
| c27 | | Harunaga Hiwatari, Keisuke Tanaka, Tomoyuki Asano, Koichi Sakumoto: Multi-recipient Public-Key Encryption from Simulators in Security Proofs. ACISP 2009: 293-308 |
| c26 | | Toshihide Matsuda, Ryo Nishimaki, Akira Numayama, Keisuke Tanaka: Security on Hybrid Encryption with the Tag-KEM/DEM Framework. ACISP 2009: 343-359 |
| c25 | | Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa: Efficient Public Key Encryption Based on Ideal Lattices. ASIACRYPT 2009: 617-635 |
| c24 | | Ryo Nishimaki, Eiichiro Fujisaki, Keisuke Tanaka: Efficient Non-interactive Universally Composable String-Commitment Schemes. ProvSec 2009: 3-18 |
| c23 | | Eiichiro Fujisaki, Ryo Nishimaki, Keisuke Tanaka: On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions. ProvSec 2009: 118-128 |
| c22 | | Keita Xagawa, Keisuke Tanaka: Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge. ProvSec 2009: 198-213 |
| i1 | | Damien Stehlé, Ron Steinfeld, Keisuke Tanaka, Keita Xagawa: Efficient Public Key Encryption Based on Ideal Lattices. IACR Cryptology ePrint Archive 2009: 285 (2009) |
| 2008 | ||
| j10 | | Daisuke Inoue, Keisuke Tanaka: Conditional Converge Cast. IEICE Transactions 91-A(6): 1537-1540 (2008) |
| c21 | | Takato Hirano, Koichiro Wada, Keisuke Tanaka: Public-Key Cryptosystems with Primitive Power Roots of Unity. ACISP 2008: 98-112 |
| c20 | | Akinori Kawachi, Keisuke Tanaka, Keita Xagawa: Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems. ASIACRYPT 2008: 372-389 |
| c19 | | Akira Numayama, Toshiyuki Isshiki, Keisuke Tanaka: Security of Digital Signature Schemes in Weakened Random Oracle Models. Public Key Cryptography 2008: 268-287 |
| 2007 | ||
| c18 | | |
| c17 | | Akinori Kawachi, Keisuke Tanaka, Keita Xagawa: Multi-bit Cryptosystems Based on Lattice Problems. Public Key Cryptography 2007: 315-329 |
| c16 | | Yoshifumi Kitamura, Takashi Nakashima, Keisuke Tanaka, Takeshi Johkoh: The IllusionHole for Medical Applications. VR 2007: 231-234 |
| 2006 | ||
| j9 | | Ryotaro Hayashi, Keisuke Tanaka: Schemes for Encryption with Anonymity and Ring Signature. IEICE Transactions 89-A(1): 66-73 (2006) |
| j8 | | Harunaga Hiwatari, Keisuke Tanaka: A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem. IEICE Transactions 89-A(1): 203-205 (2006) |
| c15 | | Ryotaro Hayashi, Keisuke Tanaka: PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity. ACISP 2006: 271-282 |
| c14 | | |
| 2005 | ||
| j7 | | Takao Onodera, Keisuke Tanaka: Shufle for Paillier's Encryption Scheme. IEICE Transactions 88-A(5): 1241-1248 (2005) |
| c13 | | Toshiyuki Isshiki, Keisuke Tanaka: An (n-t)-out-of-n Threshold Ring Signature Scheme. ACISP 2005: 406-416 |
| c12 | | Ryotaro Hayashi, Keisuke Tanaka: Universally Anonymizable Public-Key Encryption. ASIACRYPT 2005: 293-312 |
| c11 | | Hiroki Hada, Keisuke Tanaka: Security for Authenticated Key Exchange Based on Non-Malleability. ICITA (2) 2005: 508-513 |
| c10 | | Akihiro Mihara, Keisuke Tanaka: Universal Designated-Verifier Signature with Aggregation. ICITA (2) 2005: 514-519 |
| c9 | | Ryotaro Hayashi, Keisuke Tanaka: The Sampling Twice Technique for the RSA-Based Cryptosystems with Anonymity. Public Key Cryptography 2005: 216-233 |
| 2004 | ||
| j6 | | 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) |
| c8 | | 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 |
| 2003 | ||
| j5 | | Keisuke Tanaka: Quantum Bit-commitment for Small Storage Based on Quantum One-way Permutations. New Generation Comput. 21(4): 339-345 (2003) |
| c7 |  | Ruck Thawonmas, Hiroki Hassaku, Keisuke Tanaka: Mimicry: Another Approach for Interactive Comedy. GAME-ON 2003: 47- |
| c6 | | Shao Chin Sung, Keisuke Tanaka: Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem. ISAAC 2003: 108-116 |
| c5 | | Ruck Thawonmas, Keisuke Tanaka, Hiroki Hassaku: Extended Hierarchical Task Network Planning for Interactive Comedy. PRIMA 2003: 205-213 |
| 2002 | ||
| j4 | | Shao Chin Sung, Keisuke Tanaka: An exponential gap with the removal of one negation gate. Inf. Process. Lett. 82(3): 155-157 (2002) |
| 2000 | ||
| c4 | | Tatsuaki Okamoto, Keisuke Tanaka, Shigenori Uchiyama: Quantum Public-Key Cryptosystems. CRYPTO 2000: 147-165 |
| 1998 | ||
| j3 | | Robert Beals, Tetsuro Nishino, Keisuke Tanaka: On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. 27(5): 1334-1347 (1998) |
| 1996 | ||
| j2 | | Keisuke Tanaka, Tetsuro Nishino, Robert Beals: Negation-Limited Circuit Complexity of Symmetric Functions. Inf. Process. Lett. 59(5): 273-279 (1996) |
| c3 | | Magnús M. Halldórsson, Keisuke Tanaka: Approximation and Special Cases of Common Subtrees and Editing Distance. ISAAC 1996: 75-84 |
| 1995 | ||
| j1 | | Tetsuro Nishino, Keisuke Tanaka: On the Negation-Limited Circuit Complexity of Clique Functions. IEICE Transactions 78-D(1): 86-89 (1995) |
| c2 | | Robert Beals, Tetsuro Nishino, Keisuke Tanaka: More on the complexity of negation-limited circuits. STOC 1995: 585-595 |
| 1994 | ||
| c1 | | Keisuke Tanaka, Tetsuro Nishino: On the complexity of negation-limited Boolean networks. STOC 1994: 38-47 |
Colors in the list of coauthors
Last update Tue May 21 05:11:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page