A Two-Party Combined Cryptographic Scheme and Its Application[J]. Chinese Journal of Electronics, 2012, 21(4): 687-691.
Citation: A Two-Party Combined Cryptographic Scheme and Its Application[J]. Chinese Journal of Electronics, 2012, 21(4): 687-691.

A Two-Party Combined Cryptographic Scheme and Its Application

Funds: null
More Information
  • Received Date: September 30, 2010
  • Revised Date: February 29, 2012
  • Published Date: October 24, 2012
  • In this paper, we extend Haber and Pinkas’ notion of combined (cryptographic) scheme to the twoparty setting, which is shown to be a useful tool in some real-world application which we name the “2-boss problem”. In a two-party combined scheme, a single public key associated with two independent private keys and one escrow decryption key is provided. Any ciphertext encrypted under the public key can be simultaneously decrypted by the three keys. Meanwhile, the two private keys can also be used as signing keys to achieve non-repudiation service. We provide formal security definitions for two-party combined schemes, and present a simple and efficient scheme. Our construction is derived from bilinear pairings, and the security is based on the Bilinear Diffie-Hellman (BDH) assumption.
  • Y. Desmedt, “Society and group oriented cryptography: A newconcept”, Proc. of CRYPTO 1987, pringer-Verlag, pp.120-127,1987.
    S. Haber and B. Pinkas, “Securely combining public-key cryptosystems”,Proc. of ACM-CCS 2001, ACM Press, pp.215-224,2001.
    T. Diament, H.K. Lee, A.D. Keromytis and M. Yung, “The dualreceiver cryptosystem and its applications”, Proc. of ACM-CCS2004, ACM Press, pp.330-343, 2004.
    E. Verheul, “Evidence that XTR is more secure than supersingularelliptic curve cryptosystem”, Proc. of EUROCRYPT2001, LNCS Vol.2045, Springer-Verlag, pp.195-210, 2001.
    T. ElGamal, “A public key cryptosystem and a signaturescheme based on discrete logarithms”, IEEE Transactions onInformation Theory, Vol.IT-31, No.4, pp.469-472, 1985.
    E. Verheul, “Evidence that XTR is more secure than supersingularelliptic curve cryptosystems”, J. Cryptology, Vol.17, No.4,pp.277-296, 2004.
    D. Boneh, B. Lynn and H. Shacham, “Short signatures from theWeil pairing”, ASIACRYPT 2001, LNCS Vol.2248, Springer-Verlag, pp.514-532, 2001.
    D. Boneh, M. Franklin, “Identity-based encryption from theWeil pairing”, SIAM J. Computing, Vol.32, No.3, pp.586-615,2003.
    Y. Wen, J. Ma, H. Huang, “An aggregate signature scheme withspecified verifier”, Chinese Journal of Electronics, Vol.20, No.2,pp.333-336, 2011.
    Z.Wang, Y. Dai, D. Ye, “Universally composable identity-basedsignature”, Acta Electronica Sinica, Vol.39, No.7, pp.1613-1617, 2011. (in Chinese)
    A. Joux, “A one round protocol for tripartite Diffie-Hellman”,Proc. of ANTS’00, LNCS Vol.1838, Springer-Verlag, pp.385-394, 2000.
    P.S.L.M. Barreto, H.Y. Kim, B. Lynn and M. Scott, “Efficientalgorithms for pairing-based cryptosystems”, Proc. CRYPTO2002, LNCS Vol.2442, Springer-Verlag, pp.354-368, 2002.
    H. Chen, C. Ma, “Fast Tate pairing algorithm using doublebasechains”, Acta Electronica Sinica, Vol.39, No.2, pp.408-413,2011. (in Chinese)
    R. Rivest, A. Shamir and L. Adleman, “A method for obtainingdigital signatures and public key cryptosystems”, Communicationsof the ACM, Vol.21, No.2, pp.120-126, 1978.
    M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, “Relationsamong notions of security for public-key encryption schemes”,Proc. of CRYPTO 1998, LNCS Vol.1462, Springer-Verlag,pp.26-45, 1998.
    D. Pointcheval and J. Stern, “Security proofs for signatureschemes”, Proc. of EUROCRYPT 1996, LNCS Vol.1070,Springer-Verlag, pp.387-398, 1996.
    E. Fujisaki and T. Okamoto, “Secure integration of asymmetricand symmetric encryption schemes”, Proc. of CRYPTO 1999,LNCS Vol.1666, Springer-Verlag, pp.537-554, 1999.

Catalog

    Article Metrics

    Article views (565) PDF downloads (1061) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return