-
Article
Open AccessChosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
Threshold public-key encryption (threshold PKE) has various useful applications. A lot of threshold PKE schemes are proposed based on RSA, Diffie–Hellman and lattice, but to the best of our knowledge, code-based ...
-
Article
Security analysis of secure kNN and ranked keyword search over encrypted data
Wong et al. proposed a novel symmetric encryption scheme in which we can find the k-nearest neighbors from encrypted data and an encrypted query. Their scheme uses a pair of encryption functions that has an inner...
-
Chapter and Conference Paper
Communication Protocol Between Humans and Bank Server Secure Against Man-in-the-Browser Attacks
In recent years, illegal money transfer using man-in-the-browser (MITB) attacks with malware in internet banking has become a social problem. This study focuses on transaction-tampering MITB attacks and consi...
-
Chapter and Conference Paper
CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not \(\mathtt {q}\) -type) Assumptions
In this paper, we propose a new leakage-resilient identity-based encryption (IBE) scheme that is secure against chosen-ciphertext attacks (CCA) in the bounded memory leakage model. It is the first CCA-secure l...
-
Chapter and Conference Paper
Efficient Secure Multi-Party Protocols for Decision Tree Classification
We propose novel secure multi-party protocols for decision-tree classification. Our protocols hide not only an input vector and an output class but also the structure of the tree, which incurs an exponential comm...
-
Chapter and Conference Paper
Efficient No-dictionary Verifiable Searchable Symmetric Encryption
In the model of no-dictionary verifiable searchable symmetric encryption (SSE) scheme, a client does not need to keep the set of keywords ...
-
Chapter and Conference Paper
Improvement of UC Secure Searchable Symmetric Encryption Scheme
Searchable symmetric encryption refers to a system whereby clients store encrypted documents in a server that can be searched by keywords without revealing private information. In this paper, we demonstrate th...
-
Article
Cheating detectable threshold scheme against most powerful cheaters for long secrets
In this paper, we propose a framework of cheating-detectable threshold schemes against the most powerful cheaters. Our scheme is used to distribute long secrets, and the share size is almost optimum. If the th...
-
Chapter and Conference Paper
Toward Practical Searchable Symmetric Encryption
Searchable symmetric encryption is a good building block toward ensuring privacy preserving keyword searches in a cloud computing environment. This area has recently attracted a great deal of attention and a l...
-
Article
Privacy-preserving similarity evaluation and application to remote biometrics authentication
In this paper, a new method for secure remote biometric authentication preventing the vulnerability of compromised biometrics is presented. The idea is based on a public-key cryptographical protocol, referred as
-
Chapter and Conference Paper
Provably Secure Convertible Undeniable Signatures with Unambiguity
This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting. They furt...
-
Chapter and Conference Paper
A Framework for Constructing Convertible Undeniable Signatures
In this paper, we propose a framework for constructing convertible undeniable signatures from weakly-secure standard signatures. We then present a concrete instantiation employing a standard signature scheme rece...
-
Chapter and Conference Paper
A Proposal of Efficient Remote Biometric Authentication Protocol
ZeroBio has been proposed for a secure biometric authentication over the network by conducting secret computing between prover and verifier. The existing ZeroBio are based on zero-knowledge proof that a commit...
-
Chapter and Conference Paper
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
In this paper, we design and analyze some new and practical (selectively) convertible undeniable signature (SCUS) schemes in both random oracle and standard model, which enjoy several merits over existing sche...
-
Chapter and Conference Paper
Relationship between Two Approaches for Defining the Standard Model PA-ness
There are two approaches to define Plaintext Awareness (PA). The first one is a classical approach to define the PA security and is used to define the PA security of the random oracle model. This approach enab...
-
Chapter and Conference Paper
Privacy-Preserving Similarity Evaluation and Application to Remote Biometrics Authentication
In this paper, a new method for secure remote biometric authentication preventing the vulnerability of compromised biometrics is presented. The idea is based on a public-key cryptographical protocol, referred as
-
Chapter and Conference Paper
Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
In the seminal paper of Eurocrypt 2006, Dent defined a new assumption, simulatability, and showed that the well-known Cramer-Shoup public-key encryption scheme satisfied the weakest version of the plaintext aware...
-
Chapter and Conference Paper
General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
We say that a signature scheme is strongly existentially unforgeable if no adversary, given message/signature pairs adaptively, can generate a new signature on either a signature on a new message or a new sign...
-
Chapter and Conference Paper
Relationship Between Standard Model Plaintext Awareness and Message Hiding
Recently, Bellare and Palacio succeeded in defining the plaintext awareness, which is also called PA2, in the standard model. They propose three valiants of the standard model PA2 named perfect, statistical, a...
-
Chapter and Conference Paper
The Security of the FDH Variant of Chaum’s Undeniable Signature Scheme
In this paper, we first introduce a new kind of adversarial goal called forge-and-impersonate in undeniable signature schemes. Note that forgeability does not necessarily imply impersonation ability. We then clas...
