• Title/Summary/Keyword: admissible pairing

Search Result 2, Processing Time 0.014 seconds

p-ADIC HEIGHTS

  • Shim, Kyung-Ah;Woo, Sung-Sik
    • Communications of the Korean Mathematical Society
    • /
    • v.15 no.1
    • /
    • pp.37-44
    • /
    • 2000
  • In this paper, for a given p-adic quasicharacter $c_{v}$ : $k_{v}$longrightarrow $Q_{p}$ satisfying a special condition, we will explicitly construct an admissible pairing corresponding to $c_{v}$. We define a p-adic height on the arbitrary abelian varieties associated to divisors and $c_{v}$ by using admissible pairings at every nonarchimedean places. We also show that our p-adic height satisfies similar properties of Neron-Tate's canonical p-adic height.t.ght.t.t.

  • PDF

A Provable Authenticated Certificateless Group Key Agreement with Constant Rounds

  • Teng, Jikai;Wu, Chuankun
    • Journal of Communications and Networks
    • /
    • v.14 no.1
    • /
    • pp.104-110
    • /
    • 2012
  • Group key agreement protocols allow a group of users, communicating over a public network, to establish a shared secret key to achieve a cryptographic goal. Protocols based on certificateless public key cryptography (CL-PKC) are preferred since CL-PKC does not need certificates to guarantee the authenticity of public keys and does not suffer from key escrow of identity-based cryptography. Most previous certificateless group key agreement protocols deploy signature schemes to achieve authentication and do not have constant rounds. No security model has been presented for group key agreement protocols based on CL-PKC. This paper presents a security model for a certificateless group key agreement protocol and proposes a constant-round group key agreement protocol based on CL-PKC. The proposed protocol does not involve any signature scheme, which increases the efficiency of the protocol. It is formally proven that the proposed protocol provides strong AKE-security and tolerates up to $n$-2 malicious insiders for weak MA-security. The protocol also resists key control attack under a weak corruption model.