20 Result(s)
within
Chapter
Yunlei Zhao
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack
Security against selective opening attack (SOA) requires that in a multi-user setting, even if an adversary has access to all ciphertexts from users, and adaptively corrupts some fraction of the users by expos...
-
Chapter and Conference Paper
Security Model and Analysis of FHMQV, Revisited
HMQV is one of the most efficient (provably secure) authenticated key-exchange protocols based on public-key cryptography, and is widely standardized. In spite of its seemingly conceptual simplicity, the HMQV ...
-
Chapter and Conference Paper
Computationally-Fair Group and Identity-Based Key-Exchange
In this work, we re-examine some fundamental group key-exchange and identity-based key-exchange protocols, specifically the Burmester-Desmedet group key-exchange protocol [7] (referred to as the BD-protocol) a...
-
Chapter and Conference Paper
Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
In this paper, we present the first generic construction of a chosen-ciphertext (CCA) secure uni-directional proxy re-encryption (PRE) scheme. In particular, full CCA security (i.e., not relaxed CCA security s...
-
Chapter and Conference Paper
Distributed Path Authentication for Dynamic RFID-Enabled Supply Chains
In this paper, we propose a distributed path authentication solution for dynamic RFID-enabled supply chains to address the counterfeiting problem. Compared to existing general anti-counterfeiting solutions, ou...
-
Chapter and Conference Paper
On the Security of a Bidirectional Proxy Re-encryption Scheme from PKC 2010
In ACM CCS 2007, Canetti and Hohenberger left an interesting open problem of how to construct a chosen-ciphertext secure proxy re-encryption (PRE) scheme without bilinear maps. This is a rather interesting pro...
-
Chapter and Conference Paper
Taxonomical Security Consideration of Authenticated Key Exchange Resilient to Intermediate Computation Leakage
SMQV authenticated key exchange scheme was stated to be secure against leakage of intermediate computations, i.e., secure in the seCK model. However, in this paper, we show errors in the security proof of SMQV...
-
Chapter and Conference Paper
Hierarchical Identity-Based Chameleon Hash and Its Applications
At ACNS 2008, Canard et al. introduced the notion of trapdoor sanitizable signature (TSS) based on identity-based chameleon hash (IBCH). Trapdoor sanitizable signatures allow the signer of a message to delegat...
-
Chapter and Conference Paper
Designated Confirmer Signatures with Unified Verification
After the introduction of designated confirmer signatures (DCS) by Chaum in 1994, considerable researches have been done to build generic schemes from standard digital signatures and construct efficient concre...
-
Chapter and Conference Paper
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal state of a party in a protocol w...
-
Chapter and Conference Paper
Deniable Internet Key Exchange
In this work, we develop a family of non-malleable and deniable Diffie-Hellman key-exchange (DHKE) protocols, named deniable Internet key-exchange (DIKE). The newly developed DIKE protocols are of conceptual clar...
-
Chapter and Conference Paper
A New Framework for RFID Privacy
Formal RFID security and privacy frameworks are fundamental to the design and analysis of robust RFID systems. In this paper, we develop a new definitional framework for RFID privacy in a rigorous and precise ...
-
Chapter and Conference Paper
A Note on the Feasibility of Generalized Universal Composability
We clarify the potential limitation of the general feasibility for generalized universal composability (GUC) proposed in the recent work [8], and discuss a general principle for fully realizing universal compo...
-
Chapter and Conference Paper
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
We present a generic construction for constant-round concurrsound resettable zero-knowledge (rZK-CS) arguments for \(\mathcal{NP}\) ...
-
Chapter and Conference Paper
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a trusted third party and is known to...
-
Chapter and Conference Paper
Interactive Zero-Knowledge with Restricted Random Oracles
We investigate the design and proofs of zero-knowledge (ZK) interactive systems under what we call the “restricted random oracle model” which restrains the usage of the oracle in the protocol design to that of...
-
Chapter and Conference Paper
A New Notion of Soundness in Bare Public-Key Model
A new notion of soundness in bare public-key (BPK) model is presented. This new notion just lies in between one-time soundness and sequential soundness and its reasonableness is justified in the context of res...
-
Chapter and Conference Paper
Resettable Zero-Knowledge in the Weak Public-Key Model
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and Reyzin [EuroCrypt’01, pp. 373...
-
Chapter and Conference Paper
Reduction Zero-Knowledge
In this paper we re-examine the nature of zero-knowledge. We show evidences that the classic simulation based definitions of zeroknowledge (simulation zero-knowledge) may be somewhat too strong to include some...
-
Chapter and Conference Paper
(2 + f(n))-SAT and Its Properties
Consider a formula which contains n variables and m clauses with the form Φ = Φ 2 Λ Φ 3 , whe...
