9 Result(s)
within
Algorithm Analysis and Problem Complexity
Yunlei Zhao
Chapter
-
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
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
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
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
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
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
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...
