-
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
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
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...
-
Chapter and Conference Paper
Short Group Signature Without Random Oracles
We construct a short group signature which is proven secure without random oracles. By making certain reasonable assumptions and applying the technique of non-interactive proof system, we prove that our scheme...