A group signature scheme with unbounded message-dependent opening. - Kazuma Ohara; Yusuke Sakai 001; Keita Emura; Goichiro Hanaoka (AsiaCCS, 2013)

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum. - Kazuma Ohara; Kazuo Ohta; Koutarou Suzuki; Kazuki Yoneyama (AFRICACRYPT, 2014)

Privacy-preserving smart metering with verifiability for both billing and energy management. - Kazuma Ohara; Yusuke Sakai 001; Fumiaki Yoshida; Mitsugu Iwamoto; Kazuo Ohta (AsiaPKC@AsiaCCS, 2014)

An energy-efficient dynamic-integrator-based ΔΣ modulator. - Ryo Matsushiba; Kazuma Ohara; Takao Waho (ICECS, 2014)

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation. - Toshinori Araki; Assaf Barak; Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Kazuma Ohara (CCS, 2016)

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. - Toshinori Araki; Jun Furukawa 001; Yehuda Lindell; Ariel Nof; Kazuma Ohara (IACR Cryptol. ePrint Arch., 2016)

Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier. - Toshinori Araki; Assi Barak; Jun Furukawa 001; Tamar Lichter; Yehuda Lindell; Ariel Nof; Kazuma Ohara; Adi Watzman; Or Weinstein (IEEE Symposium on Security and Privacy, 2017)

How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ. - Toshinori Araki; Assi Barak; Jun Furukawa 001; Marcel Keller; Kazuma Ohara; Hikaru Tsuchida 001 (CCS, 2018)

Generalizing the SPDZ Compiler For Other Protocols. - Toshinori Araki; Assi Barak; Jun Furukawa 001; Marcel Keller; Yehuda Lindell; Kazuma Ohara; Hikaru Tsuchida 001 (IACR Cryptol. ePrint Arch., 2018)

Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology. - Kazuma Ohara; Keita Emura; Goichiro Hanaoka; Ai Ishida; Kazuo Ohta; Yusuke Sakai 001 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing. - Kazuma Ohara; Yohei Watanabe 001; Mitsugu Iwamoto; Kazuo Ohta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Group Signatures with Message-Dependent Opening: Formal Definitions and Constructions. - Keita Emura; Goichiro Hanaoka; Yutaka Kawai; Takahiro Matsuda 002; Kazuma Ohara; Kazumasa Omote; Yusuke Sakai 001 (Secur. Commun. Networks, 2019)

Semantic Definition of Anonymity in Identity-Based Encryption and Its Relation to Indistinguishability-Based Definition. - Goichiro Hanaoka; Misaki Komatsu; Kazuma Ohara; Yusuke Sakai 001; Shota Yamada 001 (ESORICS (2), 2020)

Secure Graph Analysis at Scale. - Toshinori Araki; Jun Furukawa 001; Kazuma Ohara; Benny Pinkas; Hanan Rosemarin; Hikaru Tsuchida 001 (CCS, 2021)

Oblivious Linear Group Actions and Applications. - Nuttapong Attrapadung; Goichiro Hanaoka; Takahiro Matsuda 002; Hiraku Morita; Kazuma Ohara; Jacob C. N. Schuldt; Tadanori Teruya; Kazunari Tozawa (CCS, 2021)

Revisiting Fuzzy Signatures: Towards a More Risk-Free Cryptographic Authentication System based on Biometrics. - Shuichi Katsumata; Takahiro Matsuda 002; Wataru Nakamura; Kazuma Ohara; Kenta Takahashi (CCS, 2021)

Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions. - Reo Eriguchi; Kazuma Ohara; Shota Yamada 001; Koji Nuida (CRYPTO (2), 2021)

Efficient Two-Party Exponentiation from Quotient Transfer. - Yi Lu 020; Keisuke Hara; Kazuma Ohara; Jacob C. N. Schuldt; Keisuke Tanaka (ACNS, 2022)

Memory and Round-Efficient MPC Primitives in the Pre-Processing Model from Unit Vectorization. - Nuttapong Attrapadung; Hiraku Morita; Kazuma Ohara; Jacob C. N. Schuldt; Kazunari Tozawa (AsiaCCS, 2022)

Secure Parallel Computation on Privately Partitioned Data and Applications. - Nuttapong Attrapadung; Hiraku Morita; Kazuma Ohara; Jacob C. N. Schuldt; Tadanori Teruya; Kazunari Tozawa (CCS, 2022)

Efficient Dynamic Searchable Encryption with Forward Privacy under the Decent Leakage. - Yohei Watanabe 001; Kazuma Ohara; Mitsugu Iwamoto; Kazuo Ohta (CODASPY, 2022)

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited. - Yohei Watanabe 001; Takeshi Nakai; Kazuma Ohara; Takuya Nojima; Yexuan Liu; Mitsugu Iwamoto; Kazuo Ohta (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)