Skip to main content

6 Result(s)

within Satsuya Ohata Remove this filter

and

  1. Article

    Open Access

    Efficient privacy-preserving variable-length substring match for genome sequence

    The development of a privacy-preserving technology is important for accelerating genome data sharing. This study proposes an algorithm that securely searches a variable-length substring match between a query a...

    Yoshiki Nakagawa, Satsuya Ohata, Kana Shimizu in Algorithms for Molecular Biology (2022)

    Download PDF (5479 KB) View Article

  2. No Access

    Chapter and Conference Paper

    An Efficient Secure Division Protocol Using Approximate Multi-bit Product and New Constant-Round Building Blocks

    Integer division is one of the most fundamental arithmetic operators and is ubiquitously used. However, the existing division protocols in secure multi-party computation (MPC) are inefficient and very complex,...

    Keitaro Hiwatashi, Satsuya Ohata, Koji Nuida in Applied Cryptography and Network Security (2020)

  3. No Access

    Chapter and Conference Paper

    Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application

    Secure multi-party computation (MPC) allows a set of parties to compute a function jointly while kee** their inputs private. Compared with the MPC based on garbled circuits, some recent research results show...

    Satsuya Ohata, Koji Nuida in Financial Cryptography and Data Security (2020)

  4. Chapter and Conference Paper

    Constant-Round Client-Aided Secure Comparison Protocol

    We present an improved constant-round secure two-party protocol for integer comparison functionality, which is one of the most fundamental building blocks in secure computation.

    Hiraku Morita, Nuttapong Attrapadung, Tadanori Teruya, Satsuya Ohata… in Computer Security (2018)

    Download PDF (494 KB) View Chapter

  5. No Access

    Chapter and Conference Paper

    Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption

    In this paper, we introduce a new functionality for proxy re-encryption (PRE) that we call re-encryption verifiability. In a PRE scheme with re-encryption verifiability (which we simply call verifiable PRE, or VP...

    Satsuya Ohata, Yutaka Kawai, Takahiro Matsuda… in Topics in Cryptology –- CT-RSA 2015 (2015)

  6. No Access

    Chapter and Conference Paper

    More Constructions of Re-splittable Threshold Public Key Encryption

    The concept of threshold public key encryption (TPKE) with the special property called key re-splittability (re-splittable TPKE, for short) was introduced by Hanaoka et al. (CT-RSA 2012), and used as one of th...

    Satsuya Ohata, Takahiro Matsuda… in Advances in Information and Computer Secur… (2014)