-
Chapter and Conference Paper
Network Intrusion Detection Based on Semi-supervised Variational Auto-Encoder
Network intrusion detection systems (NIDSs) based on machine learning have been attracting much attention for its potential ability to detect unknown attacks that are hard for signature-based NIDSs to detect. ...
-
Chapter and Conference Paper
Another Look at Aggregate Signatures: Their Capability and Security on Network Graphs
Aggregate signatures are digital signatures where n signers sign n individual documents and can aggregate individual signatures into a single short signature. Although aggregate signatures are expected to enhance...
-
Chapter and Conference Paper
Revocable Decentralized Multi-Authority Functional Encryption
Attribute-Based Encryption (ABE) is regarded as one of the most desirable cryptosystems realizing data security in the cloud storage systems. Functional Encryption (FE) which includes ABE and the ABE system wi...
-
Chapter and Conference Paper
Secure Multi-Party Computation Using Polarizing Cards
It is known that, using just a deck of cards, an arbitrary number of parties with private inputs can securely compute the output of any function of their inputs. In 2009, Mizuki and Sone constructed a six-card...
-
Chapter and Conference Paper
Adaptive and Composable Non-interactive String-Commitment Protocols
In this paper, a non-interactive string-commitment protocol in the common reference string model is presented and analyzed. We show that the proposed (length-flexible) commitment protocol realizes the universa...
-
Chapter and Conference Paper
Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries
Designing non-committing encryptions tolerating adaptive adversaries is a challenging task. In this paper, a simple implementation of non-committing encryptions is presented and analyzed in the strongest secur...
-
Chapter and Conference Paper
Batching Multiple Protocols to Improve Efficiency of Multi-Party Computation
It is becoming more and more important to make use of personal or classified information while kee** it confidential. A promising tool for meeting this challenge is secure multi-party computation (MPC). It e...
-
Chapter and Conference Paper
Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control
We consider the problem of searchable encryption scheme for the cryptographic cloud storage in such a way that it can be efficiently and privately executed under the multi-user setting. Searchable encryption s...
-
Chapter and Conference Paper
Cryptanalysis of Randomized Arithmetic Codes Based on Markov Model
An improvement of arithmetic coding based on Markov model ( \(\textsf{ACMM}\) ) has been proposed in the paper (Duan L.L., Liao X. F., **ang ...
-
Chapter and Conference Paper
Accelerating Multiparty Computation by Efficient Random Number Bitwise-Sharing Protocols
It is becoming more and more important to make use of personal or classified information while kee** it confidential. A promising tool for meeting this challenge is multiparty computation (MPC), which enable...
-
Chapter and Conference Paper
Differential Fault Analysis of Full LBlock
\(\textsf{LBlock}\) is a 64-bit lightweight block cipher which can be implemented in both hardware env...
-
Chapter and Conference Paper
Distributed Paillier Cryptosystem without Trusted Dealer
We propose a distributed key generation protocol for the threshold Paillier cryptosystem. Often in the multiparty computation based on the threshold Paillier cryptosystem, the existence of a trusted dealer is ...
-
Chapter and Conference Paper
Anonymous Encryption with Partial-Order Subset Delegation Functionality
We present a general encryption model with partial order delegation ability, which is a generalized extension for hierarchical identity-based encryption, broadcast encryption and delegatable functional encrypt...
-
Chapter and Conference Paper
Realizing Proxy Re-encryption in the Symmetric World
Proxy re-encryption is a useful concept and many proxy re-encryption schemes have been proposed in the asymmetric encryption setting. In the asymmetric encryption setting, proxy re-encryption can be beautifull...
-
Chapter and Conference Paper
Adaptive and Composable Non-committing Encryptions
In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the...
-
Chapter and Conference Paper
Preserving Integrity and Confidentiality of a Directed Acyclic Graph Model of Provenance
This paper describes how to preserve integrity and confidentiality of a directed acyclic graph (DAG) model of provenance database. We show a method to preserve integrity by using digital signature where both o...
-
Chapter and Conference Paper
Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
Damgård et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposition protocol. The bit-decompositio...