logo

SCIENCE CHINA Information Sciences, Volume 61, Issue 9: 099103(2018) https://doi.org/10.1007/s11432-017-9369-9

Chameleon all-but-one extractable hash proof and its applications

More info
  • ReceivedNov 16, 2017
  • AcceptedJan 31, 2018
  • PublishedApr 23, 2018

Abstract

There is no abstract available for this article.


References

[1] Wee H. Efficient chosen-ciphertext security via extractable hash proofs. In: Advances in Cryptology — CRYPTO, Santa Barbara, 2010. 314--332. Google Scholar

[2] Cash D, Kiltz E, Shoup V. The Twin Diffie-Hellman Problem and Applications. J Cryptol, 2009, 22: 470-504 CrossRef Google Scholar

[3] Haralambiev K, Jager T, Kiltz E, et al. Simple and efficient public-key encryption from computational Diffie-Hellman in the standard model. In: Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, 2010. 1--18. Google Scholar

[4] Goldreich O, Levin L A. A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, 1989. 25--32. Google Scholar

[5] Lai J Z, Deng R H, Liu S L, et al. Efficient CCA-secure PKE from identity-based techniques. In: Proceedings of the Cryptographers' Track at the RSA Conference, San Francisco, 2010. 132--147. Google Scholar

[6] Kang L, Tang X H, Liu J F. Tight chosen ciphertext attack (CCA)-secure hybrid encryption scheme with full public verifiability. Sci China Inf Sci, 2014, 57: 112112. Google Scholar

[7] Liu Y M, Li B, Lu X H, et al. Efficient CCA-secure CDH based KEM balanced between ciphertext and key. In: Proceedings of the 16th Australasian Conference on Information Security and Privacy, Melbourne, 2011. 310--318. Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1