New Constructions of Dynamic Threshold Cryptosystem

Expand
  • (1. Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200240, China; 2. School of Science, Hangzhou Normal University, Hangzhou 310036, China)

Online published: 2014-10-13

Abstract

This study deals with the dynamic property of threshold cryptosystem. A dynamic threshold cryptosystem allows the sender to choose the authorized decryption group and the threshold value for each message dynamically. We first introduce an identity based dynamic threshold cryptosystem, and then use the Canetti- Halevi-Katz (CHK) transformation to transform it into a fully secure system in the traditional public key setting. Finally, the elegant dual system encryption technique is applied to constructing a fully secure dynamic threshold cryptosystem with adaptive security.

Cite this article

LONG Yu1* (龙宇), CHEN Ke-fei2 (陈克非), MAO Xian-ping1 (毛贤平) . New Constructions of Dynamic Threshold Cryptosystem[J]. Journal of Shanghai Jiaotong University(Science), 2014 , 19(4) : 431 -435 . DOI: 10.1007/s12204-014-1520-8

References

[1] Shamir A. How to share a secret [J]. Communications of the ACM, 1979, 22(11): 612-613.
[2] Desmedt Y, Frankel Y. Threshold cryptosystems [C]//Proceedings of the 9th Annual International Cryptology Conference. Berlin, Germany: Springer-Verlag, 1990: 307-315.
[3] Fouque P, Pointcheval D. Threshold cryptosystems secure against chosen-ciphertext attacks [C]//Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security. Berlin, Germany: Springer-Verlag,2001: 351-368.
[4] Shoup V, Gennaro R. Securing threshold cryptosystems against chosen ciphertext attack [C]//Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques. Berlin, Germany:Springer-Verlag, 1998: 1-16.
[5] Delerabl′ee C, Pointcheval D. Dynamic threshold public-key encryption [C]//Proceedings of Crypto 2008. Berlin, Germany: Springer-Verlag, 2008: 317-334
[6] Libert B, Yung M. Adaptively secure non-interactive threshold cryptosystems [J]. Theoretical Computer Science,2013, 478, 76-100.
[7] Boneh D, Boyen X, Halevi S. Chosen ciphertext secure public key threshold encryption without random oracles [C]//Proceedings of the Cryptographers’Track at the RSA Conference 2006. Berlin, Germany:Springer-Verlag, 2006: 226-243.
[8] Canetti R, Halevi S, Katz J. Chosen-ciphertext security from identity-based encryption [C]//Proceedings of Eurocrypt 2004. Berlin, Germany: Springer-Verlag,2004: 207-222.
[9] Waters B. Dual system encryption: Realizing fully secure IBE and HIBE under simple assumptions [C]//Proceedings of Crypto 2009. Berlin, Germany:Springer-Verlag, 2009: 619-636.
[10] Lewko A,Waters B. New techniques for dual system encryption and fully secure HIBE with shorter ciphertexts [C]//Proceedings of TCC 2010. Berlin, Germany:Springer-Verlag, 2010: 455-479.
[11] Lamport L. Constructing digital signatures from a one-way function [R]. California: SRI International Computer Science Laboratory, 1979.
[12] Mohassel P. One-time signatures and chameleon hash functions [C]//Proceedings of the Selected Areas in Cryptography. Berlin, Germany: Springer-Verlag,2011: 302-319.
Options
Outlines

/