21 Result(s)
within
Zhenfu Cao
Computer Science
-
Chapter and Conference Paper
Tight Security Analysis of 3-Round Key-Alternating Cipher with a Single Permutation
The tight security bound of the KAC (Key-Alternating Cipher) construction whose round permutations are independent from each other has been well studied. Then a natural question is how the security bound will ...
-
Chapter and Conference Paper
SDKSE-KGA: A Secure Dynamic Keyword Searchable Encryption Scheme Against Keyword Guessing Attacks
A number of searchable encryption schemes have been widely proposed to solve the search problem in ciphertext domain. However, most existing searchable encryption schemes are vulnerable to keyword guessing at...
-
Chapter and Conference Paper
Server-Aided Directly Revocable Ciphertext-Policy Attribute-Based Encryption with Verifiable Delegation
Ciphertext-policy attribute-based encryption (CP-ABE) is a promising primitive for enforcing access control policies defined by data owner on outsourced data. We propose a novel primitive called server-aided d...
-
Chapter and Conference Paper
PPOIM: Privacy-Preserving Shape Context Based Image Denoising and Matching with Efficient Outsourcing
With the emerging techniques of wireless communication and cloud computing, large volumes of multimedia data are outsourced from resource constrained users to the cloud with abundant resource for both delegate...
-
Chapter and Conference Paper
Efficient Multi-keyword Searchable Encryption Based on Multi-input Inner-Product Functional Encryption
With highly development of cloud computing, data owners wish to outsource their data to clouds for computational and storage resource at a lower price. In order to protect the privacy of sensitive information,...
-
Chapter and Conference Paper
Extended Nested Dual System Groups, Revisited
The notion of extended nested dual system groups (ENDSG) was recently proposed by Hofheinz et al. [PKC 2015] for constructing almost-tight identity based encryptions (IBE) in the multi-instance, multi-ciphertext ...
-
Chapter and Conference Paper
Efficient IBE with Tight Reduction to Standard Assumption in the Multi-challenge Setting
In 2015, Hofheinz et al. [PKC, 2015] extended Chen and Wee’s almost-tight reduction technique for identity based encryptions (IBE) [CRYPTO, 2013] to the multi-instance, multi-ciphertext (MIMC, or multi-challenge)...
-
Chapter and Conference Paper
Traceable CP-ABE with Short Ciphertexts: How to Catch People Selling Decryption Devices on eBay Efficiently
Ciphertext-policy attribute-based encryption (CP-ABE) is a highly promising solution for cloud computing, which has been widely applied to provide fine-grained access control in cloud storage services recently...
-
Chapter and Conference Paper
PPOPM: More Efficient Privacy Preserving Outsourced Pattern Matching
Secure outsourced pattern matching permits both the sender and receiver with resource-constrained mobile devices to respectively delegate text T and pattern P to the cloud for the computationally-intensive task o...
-
Chapter and Conference Paper
4P_VES: A Collusion-Resistant Accountable Virtual Economy System
Virtual economy develops rapidly and accounts for quite a large proportion in the entire economy. Markets of virtual goods, such as games, apps and cloud services, are quite active and contribute a lot to the ...
-
Chapter and Conference Paper
Accountable Authority Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability and Public Auditing in the Cloud
As a sophisticated mechanism for secure fine-grained access control, ciphertext-policy attribute-based encryption (CP-ABE) is a highly promising solution for commercial applications such as cloud computing. Ho...
-
Chapter and Conference Paper
Large Universe Ciphertext-Policy Attribute-Based Encryption with White-Box Traceability
A Ciphertext-Policy Attribute-Based Encryption (CP-ABE) system extracts the decryption keys over attributes shared by multiple users. It brings plenty of advantages in ABE applications. CP-ABE enables fine-gra...
-
Chapter and Conference Paper
All-but-One Dual Projective Hashing and Its Applications
Recently, Wee (EUROCRYPT’12) introduced the notion of dual projective hashing as an extension of the Cramer-Shoup projective hashing, with a simple construction of lossy trapdoor functions, and a simple constr...
-
Chapter and Conference Paper
Identity-Based Extractable Hash Proofs and Their Applications
In this paper, we introduce a general paradigm called identity-based extractable hash proof system (IB-EHPS), which is an extension of extractable hash proof system (EHPS) proposed by Wee (CRYPTO ’10). We show...
-
Chapter and Conference Paper
Fully Secure Multi-authority Ciphertext-Policy Attribute-Based Encryption without Random Oracles
Recently Lewko and Waters proposed the first fully secure multi-authority ciphertext-policy attribute-based encryption (CP-ABE) system in the random oracle model, and leave the construction of a fully secure m...
-
Chapter and Conference Paper
Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments
When commitment schemes are used in complex environments, e.g., the Internet, the issue of malleability appears, i.e., a concurrent man-in-the-middle adversary might generate commitments to values related to o...
-
Chapter and Conference Paper
How to Construct Interval Encryption from Binary Tree Encryption
In a broadcast encryption system with a total of n users, each user is assigned with a unique index i ∈ [1, n]. An encryptor can choose a receiver set S ⊆ [1, n] freely and encrypt a message for the recipients in...
-
Chapter and Conference Paper
Non-malleable Statistically Hiding Commitment from Any One-Way Function
We give a construction of non-malleable statistically hiding commitments based on the existence of one-way functions. Our construction employs statistically hiding commitment schemes recently proposed by Haitn...
-
Chapter and Conference Paper
CCA-Secure Proxy Re-encryption without Pairings
In a proxy re-encryption scheme, a semi-trusted proxy can transform a ciphertext under Alice’s public key into another ciphertext that Bob can decrypt. However, the proxy cannot access the plaintext. Due to it...
-
Chapter and Conference Paper
Efficient Password-Based Authenticated Key Exchange Without Public Information
Since the first password-based authenticated key exchange (PAKE) was proposed, it has enjoyed a considerable amount of interest from the cryptographic research community. To our best knowledge, most of propose...
