-
Chapter and Conference Paper
Forward-Secure Public Key Encryption Without Key Update from Proof-of-Stake Blockchain
A forward-secure public-key encryption (PKE) scheme prevents eavesdroppers from decrypting past ciphertexts in order to mitigate the damage caused by a potential secret key compromise. In prior works, forward ...
-
Chapter and Conference Paper
Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
Multiparty computation (MPC) is a cryptographic method that enables a set of parties to compute an arbitrary joint function of the private inputs of all parties and does not reveal any information other than t...
-
Chapter and Conference Paper
Load Balancing for Sharded Blockchains
Sharding is an approach to designing a highly scalable blockchain. A sharded blockchain achieves parallelism by dividing consensus nodes (validators) into groups called shards and making them process different...
-
Chapter and Conference Paper
Regularization with Latent Space Virtual Adversarial Training
Virtual Adversarial Training (VAT) has shown impressive results among recently developed regularization methods called consistency regularization. VAT utilizes adversarial samples, generated by injecting pertu...
-
Chapter and Conference Paper
One-Time Delegation of Unlinkable Signing Rights and Its Application
Delegation of signing rights can be useful to promote effective resource sharing and smooth cooperation among participants in distributed systems, and in many situations, we often need restricted delegation su...
-
Chapter and Conference Paper
Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring
Secure computation is the technology that computes an arbitrary function represented as a circuit without revealing input values. Typical technologies related to secure computation are secure multiparty comput...
-
Chapter and Conference Paper
Identity-Based Key-Insulated Aggregate Signatures, Revisited
Identity-based key-insulated cryptography is a cryptography which allows a user to update an exposed secret key by generating a temporal secret key as long as the user can keep any string as its own public key...
-
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
Searchable Symmetric Encryption Supporting Queries with Multiple-Character Wildcards
We consider the problem of searchable encryption scheme which allows a user to search over encrypted data without decrypting it. Existing schemes in the symmetric setting only deal with equality search or a li...
-
Chapter and Conference Paper
Size-Hiding Computation for Multiple Parties
Lindell, Nissim, and Orlandi (ASIACRYPT 2013) studied feasibility and infeasibility of general two-party protocols that hide not only the contents of the inputs of parties, but also some sizes of the inputs an...
-
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 \((M+1)\) st-Price Auction with Automatic Tie-Break
In auction theory, little attention has been paid to a situation where the tie-break occurs because most of auction properties are not affected by the way the tie-break is processed. Meanwhile, in secure aucti...
-
Chapter and Conference Paper
Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards
It is well-known that a protocol for any function can be constructed using only cards and various shuffling techniques (this is referred to as a card-based protocol). In this paper, we propose a new type of cards...
-
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
A Short Fail-Stop Signature Scheme from Factoring
Fail-stop signature (FSS) is information theoretically secure digital signature in the sense that even if a signature is forged, the signer can prove the forgery with overwhelming probability. There are many k...
-
Chapter and Conference Paper
Supporting Secure Provenance Update by Kee** “Provenance” of the Provenance
Provenance of data is a documentation of the origin and processes that produce the data. Many researchers argue that the provenance should be immutable: once a provenance is submitted, it should not be changed...
-
Chapter and Conference Paper
Analysis of Methods for Detecting Compromised Nodes and its Countermeasures
The increased application of sensor network introduces new security challenges. In this paper, we analyze the detection methods of compromised nodes and its countermeasure in the sensor network. We first revie...
-
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...
