11 Result(s)
within
Siu Ming Yiu
Algorithm Analysis and Problem Complexity
Computer Communication Networks
-
Chapter and Conference Paper
Selling Power Back to the Grid in a Secure and Privacy-Preserving Manner
Smart grid facilitates a customer to sell unused or self-generated power back to the grid. This not only helps the power operator to reduce power generation, but also brings customers a means of getting revenu...
-
Chapter and Conference Paper
Continual Leakage-Resilient Dynamic Secret Sharing in the Split-State Model
Traditional secret sharing assume the absolute secrecy of the private shares of the uncorrupted users. It may not hold in the real world due to the side-channel attacks. Leakage-resilient cryptography is propo...
-
Chapter and Conference Paper
Acceleration of Composite Order Bilinear Pairing on Graphics Hardware
Recently, composite-order bilinear pairing has been shown to be useful in many cryptographic constructions. However, it is time-costly to evaluate. This is because the composite order should be at least 1024bi...
-
Chapter and Conference Paper
Identity-Based Encryption Resilient to Continual Auxiliary Leakage
We devise the first identity-based encryption (IBE) that remains secure even when the adversary is equipped with auxiliary input (STOC ’09) – any computationally uninvertible function of the master secret key and...
-
Chapter and Conference Paper
Identifying Volatile Data from Multiple Memory Dumps in Live Forensics
One of the core components of live forensics is to collect and analyze volatile memory data. Since the dynamic analysis of memory is not possible, most live forensic approaches focus on analyzing a single snap...
-
Chapter and Conference Paper
Oblivious Transfer with Access Control : Realizing Disjunction without Duplication
Oblivious Transfer with Access Control (AC-OT) is a protocol which allows a user to obtain a database record with a credential satisfying the access policy of the record while the database server learns nothin...
-
Chapter and Conference Paper
Space Efficient Indexes for String Matching with Don’t Cares
Given a text T of length n, the classical indexing problem for pattern matching is to build an index for T so that for any query pattern P, we can report efficiently all occurrences of P in T. Cole et al (2004) e...
-
Chapter and Conference Paper
An Experimental Study of Compressed Indexing and Local Alignments of DNA
Recent experimental studies on compressed indexes (BWT, CSA, FM-index) have confirmed their practicality for indexing long DNA sequences such as the human genome (about 3 billion characters) in the main memory...
-
Chapter and Conference Paper
Event-Oriented k-Times Revocable-iff-Linked Group Signatures
In this paper, we introduce the notion of event-oriented k-times revocable if and only if linked group signatures (k-EoRiffL group signatures). In k-EoRiffL group signatures, signers can sign on behalf of a group...
-
Chapter and Conference Paper
Secure Hierarchical Identity Based Signature and Its Application
At EUROCRYPT 2004, Boneh and Boyen [5] proposed a new hierarchical identity-based (ID-based) encryption (HIBE) scheme provably selective-ID secure without random oracles. In this paper we propose a new hierarc...
-
Chapter and Conference Paper
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
With the first Human DNA being decoded into a sequence of about 2.8 billion base pairs, many biological research has been centered on analyzing this sequence. Theoretically speaking, it is now feasible to acco...
