Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Single-Shuffle Card-Based Protocol with Eight Cards per Gate

    Card-based cryptography allows us to securely compute arbitrary functions using a deck of physical cards. Its performance is mainly measured by the number of used cards and shuffles, and there is a line of wor...

    Kazunari Tozawa, Hiraku Morita in Unconventional Computation and Natural Com… (2023)

  2. No Access

    Chapter and Conference Paper

    Client-Aided Two-Party Secure Interval Test Protocol

    Secure interval test protocol checks if an integer is within some interval in a privacy-preserving manner. A natural application is geological location hiding, where we can check whether a person is in a certa...

    Hiraku Morita, Nuttapong Attrapadung in Cryptology and Network Security (2019)

  3. 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)

  4. No Access

    Chapter and Conference Paper

    On the Security of the Schnorr Signature Scheme and DSA Against Related-Key Attacks

    In the ordinary security model for signature schemes, we consider an adversary that may forge a signature on a new message using only his knowledge of other valid message and signature pairs. To take into acco...

    Hiraku Morita, Jacob C. N. Schuldt in Information Security and Cryptology - ICIS… (2016)

  5. Chapter and Conference Paper

    Attacks and Security Proofs of EAX-Prime

    \(\text {EAX}'\) (or EAX-prime) is an authenticated encryption (AE) specified by ANSI C12.22 as a ...

    Kazuhiko Minematsu, Stefan Lucks, Hiraku Morita, Tetsu Iwata in Fast Software Encryption (2014)