Skip to main content

and
Your search also matched 24 preview-only Content is preview-only when you or your institution have not yet subscribed to it.

By making our abstracts and previews universally accessible we help you purchase only the content that is relevant to you.
results, e.g.

Optimal Trust Mining and Computing on Keyed MapReduce

Include preview-only content
  1. Chapter and Conference Paper

    Sustainable Pseudo-random Number Generator

    Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators...

    Huafei Zhu, Wee-Siong Ng, See-Kiong Ng in Security and Privacy Protection in Informa… (2013)

  2. Chapter and Conference Paper

    Adaptive and Composable Oblivious Transfer Protocols (Short Paper)

    An adaptive k-out-of-n oblivious transfer protocol (OT \(_{k \times 1} ^n\) ) allows a receiver to obtain ...

    Huafei Zhu, Feng Bao in Information and Communications Security (2009)

  3. Chapter and Conference Paper

    Multi-party Stand-Alone and Setup-Free Verifiably Committed Signatures

    In this paper, we first demonstrate a gap between the security of verifiably committed signatures in the two-party setting and the security of verifiably committed signatures in the multi-party setting. We the...

    Huafei Zhu, Willy Susilo, Yi Mu in Public Key Cryptography – PKC 2007 (2007)

  4. Chapter and Conference Paper

    Computing of Trust in Ad-Hoc Networks

    Although, the notion of trust has been considered as a primitive for establishing relationships among nodes in ad-hoc networks, syntax and metrics of trust are not well defined. This paper studies computing of...

    Huafei Zhu, Feng Bao, Jianwei Liu in Communications and Multimedia Security (2006)

  5. Chapter and Conference Paper

    Finding Compact Reliable Broadcast in Unknown Fixed-Identity Networks (Short Paper)

    At PODC’05, Subramanian, Katz, Roth, Shenker and Stoica (SKRSS) introduced and formulated a new theoretical problem called reliable broadcast problems in unknown fixed-identity networks [3] and further propose...

    Huafei Zhu, Jianying Zhou in Information and Communications Security (2006)

  6. Chapter and Conference Paper

    Compact Stimulation Mechanism for Routing Discovery Protocols in Civilian Ad-Hoc Networks

    In this paper, a refined sequential aggregate signature scheme from RSA that works for any modulus is presented, then a compact stimulation mechanism without a central, trusted authority for routing discovery ...

    Huafei Zhu, Feng Bao, Tieyan Li in Communications and Multimedia Security (2005)

  7. Chapter and Conference Paper

    Multi-Source Stream Authentication Framework in Case of Composite MPEG-4 Stream

    Multimedia community is moving from monolithic applications to more flexible and scalable integrated solutions. Stream authentication is more complex since a stream may consist of multiple sources and be trans...

    Tieyan Li, Huafei Zhu, Yongdong Wu in Information and Communications Security (2005)

  8. Chapter and Conference Paper

    Augmented Oblivious Polynomial Evaluation Protocol and Its Applications

    In this paper, we first introduce a new notion called augmented oblivious polynomial evaluation (AOPE), a useful notion to deal with the general oblivious polynomial evaluation protocol. And then we propose a ...

    Huafei Zhu, Feng Bao in Computer Security – ESORICS 2005 (2005)

  9. Chapter and Conference Paper

    Sequential Aggregate Signatures Working over Independent Homomorphic Trapdoor One-Way Permutation Domains

    The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that o...

    Huafei Zhu, Feng Bao, Robert H. Deng in Information and Communications Security (2005)

  10. Chapter and Conference Paper

    Constructing Committed Signatures from Strong-RSA Assumption in the Standard Complexity Model

    In this paper, we provide the first committed signature provably secure in the standard complexity model based on the strong RSA assumption. The idea behind the construction is that given any valid partial sig...

    Huafei Zhu in Public Key Cryptography – PKC 2004 (2004)

  11. Chapter and Conference Paper

    Design and Security Analysis of Anonymous Group Identification Protocols

    Two provably secure group identification schemes are presented in this report: 1) we extend De Santis, Crescenzo and Persiano’s (SCP) anonymous group identification scheme to the discrete logarithm based case;...

    Chan H. Lee, **aotie Deng, Huafei Zhu in Public Key Cryptography (2002)