-
Article
Quantum verifiable protocol for secure modulo zero-sum randomness
We propose a new cryptographic resource, secure modulo zero-sum randomness, as a resource to implement a task of secure modulo summation, and its quantum protocol. Secure modulo summation is the calculation of...
-
Article
Open AccessFrequent contiguous pattern mining over biological sequences of protein misfolded diseases
Proteins are integral part of all living beings, which are building blocks of many amino acids. To be functionally active, amino acids chain folds up in a complex way to give each protein a unique 3D shape, wh...
-
Chapter and Conference Paper
A Guests Managing System with Lattice-Based Verifier-Local Revocation Group Signature Scheme with Time-Bound Keys
this paper, we propose a visitors managing system using group signature schemes. The paper focuses on situations that guests who are residing in a hotel are like to keep their activities such as accessing h...
-
Chapter and Conference Paper
Enhanced Secure Comparison Schemes Using Homomorphic Encryption
Comparing two integers under the encrypted form is useful for privacy-preserving data mining, secure auction, and so on. Based on the ring-learning with errors (ring-LWE) assumption, Saha and Koshiba proposed ...
-
Article
Arbitrable blind quantum computation
Blind quantum computation (of a single-server case) is a two-party cryptographic protocol which involves a quantum computation server Bob and a client Alice who wants to delegate her quantum computation to Bob...
-
Chapter and Conference Paper
New Assumptions on Isogenous Pairing Groups with Applications to Attribute-Based Encryption
We introduce new isogeny-related assumptions called Isog-DDH and Isog-DBDH assumptions. By using the assumptions, we reinforce security of several existing (hierarchical) identity-/attribute-based encryption (...
-
Chapter and Conference Paper
Perfectly Secure Message Transmission Against Independent Rational Adversaries
Secure Message Transmission (SMT) is a two-party protocol by which the sender can privately transmit a message to the receiver through multiple channels. An adversary can corrupt a subset of channels and makes...
-
Chapter and Conference Paper
Zero-Knowledge Proof for Lattice-Based Group Signature Schemes with Verifier-Local Revocation
In group signature schemes, signers prove verifiers, their validity of signing through an interactive protocol in zero-knowledge. In lattice-based group signatures with Verifier-local revocation (VLR), group m...
-
Chapter and Conference Paper
Fourier-Based Function Secret Sharing with General Access Structure
Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for \(x\in \{0,1\}^n\) which is shared amon...
-
Chapter and Conference Paper
Private Comparison Protocol and Its Application to Range Queries
We consider the problem of private comparison protocol and its application to private range queries for accessing a private database. Very recently, Saha and Koshiba (NBiS 2017) proposed an efficient privacy-p...
-
Chapter and Conference Paper
Achieving Full Security for Lattice-Based Group Signatures with Verifier-Local Revocation
Even though Verifier-local revocation mechanism seems to be the most flexible revocation method that suits for any size of groups it could not reach strong security yet. Verifier-local revocation technique nee...
-
Chapter and Conference Paper
Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
This paper presents a lattice-based group signature scheme that provides both member registration and member revocation with verifier-local revocation. Verifier-local revocation (VLR) seems to be the most suit...
-
Chapter and Conference Paper
Secure Non-transferable Proxy Re-encryption for Group Membership and Non-membership
In proxy re-encrytpion (PRE) scheme, the message is sent by a delegator to a delegatee with a help of the trusted third party proxy without knowing the existing plaintext. PRE schemes are widely used in variou...
-
Chapter and Conference Paper
An Efficient Privacy-Preserving Comparison Protocol
We address an efficient privacy-preserving comparison protocol using somewhat homomorphic encryption based on ring learning with errors (ring-LWE) problem in the semi-honest model. Here we take two l-bit integers...
-
Chapter and Conference Paper
Achieving Strong Security and Verifier-Local Revocation for Dynamic Group Signatures from Lattice Assumptions
Both member registration and member revocation are essential features in group signature schemes. In ASIACRYPT 2016 Libert, Ling, Mouhartem, Nguyen, and Wang suggested a simple joining mechanism with their lat...
-
Chapter and Conference Paper
Perfectly Secure Message Transmission Against Rational Timid Adversaries
Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. It is assumed that an adversary ...
-
Chapter and Conference Paper
Fully Dynamic Group Signature Scheme with Member Registration and Verifier-Local Revocation
Since Bellare et al. (EUROCRYPT 2003) proposed a security model for group signature schemes, almost all the securities of group signature schemes have been discussed in their model (the BMW03 model). While the...
-
Chapter and Conference Paper
Function Secret Sharing Using Fourier Basis
Function secret sharing (FSS) scheme, formally introduced by Boyle et al. at EUROCRYPT 2015, is a mechanism that calculates a function f(x) for ...
-
Chapter and Conference Paper
Almost-Fully Secured Fully Dynamic Group Signatures with Efficient Verifier-Local Revocation and Time-Bound Keys
One of the prominent requirements in group signature schemes is revoking group members who are misbehaved or resigned. Among the revocation approaches Verifier-local revocation (VLR) is more convenient than ot...
-
Chapter and Conference Paper
Privacy-Preserving Equality Test Towards Big Data
In this paper, we review the problem of private batch equality test (PriBET) that was proposed by Saha and Koshiba (3rd APWConCSE 2016). They described this problem to find the equality of an integer within a ...
