Kazuma Ohara

Orcid: 0000-0003-0213-3942

According to our database1, Kazuma Ohara authored at least 22 papers between 2013 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
How to Make a Secure Index for Searchable Symmetric Encryption, Revisited.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2022

Efficient Dynamic Searchable Encryption with Forward Privacy under the Decent Leakage.
Proceedings of the CODASPY '22: Twelveth ACM Conference on Data and Application Security and Privacy, Baltimore, MD, USA, April 24, 2022

Secure Parallel Computation on Privately Partitioned Data and Applications.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

Memory and Round-Efficient MPC Primitives in the Pre-Processing Model from Unit Vectorization.
Proceedings of the ASIA CCS '22: ACM Asia Conference on Computer and Communications Security, Nagasaki, Japan, 30 May 2022, 2022

Efficient Two-Party Exponentiation from Quotient Transfer.
Proceedings of the Applied Cryptography and Network Security, 2022

2021
Non-interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficient Constructions and Extensions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Revisiting Fuzzy Signatures: Towards a More Risk-Free Cryptographic Authentication System based on Biometrics.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Oblivious Linear Group Actions and Applications.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

Secure Graph Analysis at Scale.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Semantic Definition of Anonymity in Identity-Based Encryption and Its Relation to Indistinguishability-Based Definition.
Proceedings of the Computer Security - ESORICS 2020, 2020

2019
Group Signatures with Message-Dependent Opening: Formal Definitions and Constructions.
Secur. Commun. Networks, 2019

Multi-Party Computation for Modular Exponentiation Based on Replicated Secret Sharing.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Shortening the Libert-Peters-Yung Revocable Group Signature Scheme by Using the Random Oracle Methodology.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

2018
Generalizing the SPDZ Compiler For Other Protocols.
IACR Cryptol. ePrint Arch., 2018

How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Optimized Honest-Majority MPC for Malicious Adversaries - Breaking the 1 Billion-Gate Per Second Barrier.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority.
IACR Cryptol. ePrint Arch., 2016

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2014
An energy-efficient dynamic-integrator-based ΔΣ modulator.
Proceedings of the 21st IEEE International Conference on Electronics, Circuits and Systems, 2014

Privacy-preserving smart metering with verifiability for both billing and energy management.
Proceedings of the ASIAPKC'14, 2014

Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013
A group signature scheme with unbounded message-dependent opening.
Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security, 2013


  Loading...