The Experts below are selected from a list of 150 Experts worldwide ranked by ideXlab platform

Kimkwang Raymond Choo - One of the best experts on this subject based on the ideXlab platform.

  • Performance and Security Evaluations of Identity- and Pairing-Based Digital Signature Algorithms on Windows, Android, and Linux Platforms: Revisiting the Algorithms of Cha and Cheon, Hess, Barreto, Libert, McCullagh and Quisquater, and Paterson and S
    IEEE Access, 2018
    Co-Authors: Sheng Zhong, Wei Ren, Tianqing Zhu, Yi Ren, Kimkwang Raymond Choo
    Abstract:

    Bilinear pairing, an essential tool to construct-efficient digital signatures, has applications in mobile devices and other applications. One particular research challenge is to design cross-platform security protocols (e.g. Windows, Linux, and other popular mobile operating systems) while achieving an optimal security-performance tradeoff. That is, how to choose the right digital signature algorithm, for example, on mobile devices while considering the limitations on both computation capacity and battery life. In this paper, we examine the security-performance tradeoff of four popular digital signature algorithms, namely: CC (proposed by Cha and Cheon in 2003), Hess (proposed by Hess in 2002), BLMQ (proposed by Barreto et al. in 2005), and PS (proposed by Paterson and Schuldt in 2006), on various platforms. We empirically evaluate their performance using experiments on Windows, Android, and Linux platforms, and find that BLMQ algorithm has the highest computational efficiency and communication efficiency. We also study their security properties under the random oracle model and assuming the intractability of the CDH problem, we reveal that the BLMQ digital signature scheme satisfies the property of existential unforgeable on adaptively chosen message and ID attack. The efficiency of PS algorithm is lower, but it is secure under the standard model.

  • revisit of McCullagh barreto two party id based authenticated key agreement protocols
    International Journal of Network Security, 2005
    Co-Authors: Kimkwang Raymond Choo
    Abstract:

    We revisit the two-party identity-based authenticated key agreement protocol (2P-IDAKA) and its variant resistant to key-compromise impersonation due to McCullagh & Barreto (2005). Protocol 2P-IDAKA carries a proof of security in the Bellare & Rogaway (1993) model. In this paper, we demonstrated why both the protocol and its variant are not secure if the adversary is allowed to send a Reveal query to reveal non-partner players who had accepted the same session key (i.e., termed key-replicating attack in recent work of Krawczyk (2005)). We also demonstrate that both protocols do not achieve the key integrity property, first discussed by Janson & Tsudik (1995).

  • on session key construction in provably secure key establishment protocols revisiting chen kudla 2003 and McCullagh barreto 2005 id based protocols
    IACR Cryptology ePrint Archive, 2005
    Co-Authors: Kimkwang Raymond Choo, Colin Boyd, Yvonne Hitchcock
    Abstract:

    We examine the role of session key construction in provablysecure key establishment protocols. We revisit an ID-based key establishment protocol due to Chen & Kudla (2003) and an ID-based protocol 2P-IDAKA due to McCullagh & Barreto (2005). Both protocols carry proofs of security in a weaker variant of the Bellare & Rogaway (1993) model where the adversary is not allowed to make any Reveal query. We advocate the importance of such a (Reveal) query as it captures the known-key security requirement. We then demonstrate that a small change to the way that session keys are constructed in both protocols results in these protocols being secure without restricting the adversary from asking the Reveal queries in most situations. We point out some errors in the existing proof for protocol 2P-IDAKA, and provide proof sketches for the improved Chen & Kudla’s protocol. We conclude with a brief discussion on ways to construct session keys in key establishment protocols.

  • revisit of McCullagh barreto two party id based authenticated key agreement protocols
    IACR Cryptology ePrint Archive, 2004
    Co-Authors: Kimkwang Raymond Choo
    Abstract:

    The recently proposed two-party ID-based authenticated key agreement protocols (with and without escrow) and its variant resistant to key-compromise impersonation by McCullagh & Barreto are revisited. The protocol carries a proof of security in the Bellare & Rogaway (1993) model. In this paper, it is demonstrated that the protocols and its variant are not secure if the adversary is allowed to send a Reveal query to reveal non-partner players who had accepted the same session key.

V. Seshadri - One of the best experts on this subject based on the ideXlab platform.

  • A family of distributions related to the McCullagh family
    Statistics & Probability Letters, 1991
    Co-Authors: V. Seshadri
    Abstract:

    Abstract A family of distributions on (−1, 1) is obtained from the hypergeometric functions which bears some resemblance to a similar family introduced recently by McCullagh. This family shares several properties with the McCullagh family. In particular the family possesses a pivot which reduces it to the symmetric beta density. Relations to proper dispersion models and the exactness of the p*-formula are also considered.

Michel Wedel - One of the best experts on this subject based on the ideXlab platform.

  • a mixture likelihood approach for generalized linear models
    Social Science Research Network, 1995
    Co-Authors: Michel Wedel, Wayne S Desarbo
    Abstract:

    A mixture model approach is developed that simultaneously estimates the posterior membership probabilities of observations to a number of unobservable groups or latent classes, and the parameters of a generalized linear model which relates the observations, distributed according to some member of the exponential family, to a set of specified covariates within each Class. We demonstrate how this approach handles many of the existing latent class regression procedures as special cases, as well as a host of other parametric specifications in the exponential family heretofore not mentioned in the latent class literature. As such we generalize the McCullagh and Nelder approach to a latent class framework. The parameters are estimated using maximum likelihood, and an EM algorithm for estimation is provided. A Monte Carlo study of the performance of the algorithm for several distributions is provided, and the model is illustrated in two empirical applications.

Wayne S Desarbo - One of the best experts on this subject based on the ideXlab platform.

  • a mixture likelihood approach for generalized linear models
    Social Science Research Network, 1995
    Co-Authors: Michel Wedel, Wayne S Desarbo
    Abstract:

    A mixture model approach is developed that simultaneously estimates the posterior membership probabilities of observations to a number of unobservable groups or latent classes, and the parameters of a generalized linear model which relates the observations, distributed according to some member of the exponential family, to a set of specified covariates within each Class. We demonstrate how this approach handles many of the existing latent class regression procedures as special cases, as well as a host of other parametric specifications in the exponential family heretofore not mentioned in the latent class literature. As such we generalize the McCullagh and Nelder approach to a latent class framework. The parameters are estimated using maximum likelihood, and an EM algorithm for estimation is provided. A Monte Carlo study of the performance of the algorithm for several distributions is provided, and the model is illustrated in two empirical applications.

L G Stephens - One of the best experts on this subject based on the ideXlab platform.