-
Chapter and Conference Paper
Signature for Objects: Formalizing How to Authenticate Physical Data and More
While the integrity of digital data can be ensured via digital signatures, ensuring the integrity of physical data, i.e., objects, is a more challenging task. For example, constructing a digital signature on d...
-
Chapter and Conference Paper
Constraints and Evaluations on Signature Transmission Interval for Aggregate Signatures with Interactive Tracing Functionality
Fault-tolerant aggregate signature (FT-AS) is a special type of aggregate signature that is equipped with the functionality for tracing signers who generated invalid signatures in the case an aggregate signatu...
-
Chapter and Conference Paper
Aggregate Signature with Traceability of Devices Dynamically Generating Invalid Signatures
Aggregate signature schemes enable us to aggregate multiple signatures into a single short signature. One of its typical applications is sensor networks, where a large number of users and devices measure their...
-
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
Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem
The hardness of the shortest vector problem for lattices is a fundamental assumption underpinning the security of many lattice-based cryptosystems, and therefore, it is important to evaluate its difficulty. He...
-
Chapter and Conference Paper
Faster Explicit Formulae for Computing Pairings via Elliptic Nets and Their Parallel Computation
In this paper, we discuss computations of optimal pairings over some pairing-friendly curves and a symmetric pairing over supersingular curves via elliptic nets. We show that optimal pairings can be computed m...
-
Chapter and Conference Paper
Attribute Based Encryption with Direct Efficiency Tradeoff
We propose the first fully secure unbounded Attribute-Based Encryption (ABE) scheme such that the key size and ciphertext size can be directly traded off. Our proposed scheme is parameterized by a positive int...
-
Chapter and Conference Paper
On Limitations and Alternatives of Privacy-Preserving Cryptographic Protocols for Genomic Data
The human genome can identify an individual and determine the individual’s biological characteristics, and hence has to be securely protected in order to prevent privacy issues. In this paper we point out, how...
-
Chapter and Conference Paper
Round-Efficient Private Stable Matching from Additive Homomorphic Encryption
In the present paper, we propose private stable matching protocols to solve the stable marriage problem with the round complexity ...
-
Chapter and Conference Paper
Constructing Symmetric Pairings over Supersingular Elliptic Curves with Embedding Degree Three
In the present paper, we propose constructing symmetric pairings by applying the Ate pairing to supersingular elliptic curves over finite fields that have large characteristics with embedding degree three. We ...
-
Chapter and Conference Paper
High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the optimal ate pairing over a 254-...
