-
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,...
-
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...
-
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.
-
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...
-
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...