Skip to main content
SpringerLink
Log in

One construction of chameleon all-but-one trapdoor functions

  • Published:
Journal of Shanghai Jiaotong University (Science) Aims and scope Submit manuscript

Abstract

Chameleon all-but-one trapdoor functions (ABO-TDFs) were introduced by Lai et al. An important component of the existing constructions of chameleon ABO-TDFs based on the decisional Diffie-Hellman (DDH) assumption was the chameleon hash functions. In this paper, we instantiate the first chameleon ABO-TDFs based on DDH free of chameleon hash functions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Naor M, Yung M. Public-key cryptosystems provably secure against chosen ciphertext attacks [C]//Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. New York, USA: ACM, 1990: 427–437.

    Google Scholar 

  2. Rivest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems [J]. Communications of the ACM, 1978, 21(2): 120–126.

    Article  MATH  MathSciNet  Google Scholar 

  3. Peikert C, Waters B. Lossy trapdoor functions and their applications [J]. SIAM Journal on Computing, 2011, 40(6): 1803–1844.

    Article  MATH  MathSciNet  Google Scholar 

  4. Håstad J, Impagliazzo R, Levin L A, et al. A pseudorandom generator from any one-way function [J]. SIAM Journal on Computing, 1999, 28(4): 1364–1396.

    Article  MATH  MathSciNet  Google Scholar 

  5. Naor M, Yung M. Universal one-way hash functions and their cryptographic applications [C]//Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. New York, USA: ACM, 1989: 33–43.

    Google Scholar 

  6. Bellare M, Kiltz E, Peikert C, et al. Identitybased (lossy) trapdoor functions and applications [M]. Berlin: Springer, 2012: 228–245.

    Google Scholar 

  7. Boldyreva A, Fehr S, O’Neill A. On notions of security for deterministic encryption, and efficient constructions without random oracles [M]. Berlin: Springer, 2008: 335–359.

    Google Scholar 

  8. Bellare M, Hofheinz D, Yilek S. Possibility and impossibility results for encryption and commitment secure under selective opening [M]. Berlin: Springer, 2009: 1–35.

    Google Scholar 

  9. Freeman D M, Goldreich O, Kiltz E, et al. More constructions of lossy and correlation-secure trapdoor functions [J]. Journal of Cryptology, 2013, 26(1): 39–74.

    Article  MATH  MathSciNet  Google Scholar 

  10. Lai J, Deng R H, Liu S. Chameleon all-but-one TDFs and their application to chosen-ciphertext security [M]. Berlin: Springer, 2011: 228–245.

    Google Scholar 

  11. Hemenway B, Ostrovsky R. Lossy trapdoor functions from smooth homomorphic hash proof systems [C]//Electronic Colloquium on Computational Complexity (ECCC). Trier, Germany: ECCC, 2009: 127–127.

    Google Scholar 

  12. Hemenway B, Ostrovsky R. On homomorphic encryption and chosen-ciphertext security [M]. Berlin: Springer, 2012: 52–65.

    Google Scholar 

  13. Kiltz E, O’Neill A, Smith A. Instantiability of RSA-OAEP under chosen-plaintext attack [M]. Berlin: Springer, 2010: 295–313.

    Google Scholar 

  14. Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication [C]//Advances in Cryptology-EUROCRYPT’99. Berlin: Springer, 1999: 402–414.

    Google Scholar 

  15. Rosen A, Segev G. Chosen-ciphertext security via correlated products [J]. SIAM Journal on Computing, 2010, 39(7): 3058–3088.

    Article  MATH  MathSciNet  Google Scholar 

  16. Mol P, Yilek S. Chosen-ciphertext security from slightly lossy trapdoor functions [M]. Berlin: Springer, 2010: 296–311.

    Google Scholar 

  17. Damgård I, Jurik M. A generalisation, a simplification and some applications of paillier’s probabilistic public-key system [C]//Public Key Cryptography. Berlin: Springer, 2001: 119–136.

    Chapter  Google Scholar 

  18. Liu S, Lai J, Deng R H. General construction of chameleon all-but-one trapdoor functions [M]. Berlin: Springer, 2011: 257–265.

    Google Scholar 

  19. Krawczyk H, Rabin T. Chameleon hashing and signatures [C]//Proceedings of the Network and Distributed System Security Symposium. Reston, Virginia, USA: The Internet Society, 2000: 143–154.

    Google Scholar 

  20. Boneh D. The decision diffie-hellman problem [M]. Berlin: Springer, 1998: 48–63.

    Google Scholar 

  21. Boneh D, Halevi S, Hamburg M, et al. Circularsecure encryption from decision diffie-hellman [M]. Berlin: Springer, 2008: 108–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, 200240, China

    Yi-dong Xu  (许一栋) & Sheng-li Liu  (刘胜利)

Authors
  1. Yi-dong Xu  (许一栋)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sheng-li Liu  (刘胜利)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yi-dong Xu  (许一栋).

Additional information

Foundation item: the National Natural Science Foundation of China (Nos. 61373153 and 61170229), the Specialized Research Fund for the Doctoral Program of Higher Education (No. 20110073110016), and the Scientific Innovation Projects of Shanghai Municipal Education Committee (No. 12ZZ021)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, Yd., Liu, Sl. One construction of chameleon all-but-one trapdoor functions. J. Shanghai Jiaotong Univ. (Sci.) 19, 412–417 (2014). https://doi.org/10.1007/s12204-014-1517-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12204-014-1517-3

Key words

CLC number

Search

Navigation