Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
- Cite this paper as:
- Arita S., Tsurudome K. (2009) Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions. In: Abdalla M., Pointcheval D., Fouque PA., Vergnaud D. (eds) Applied Cryptography and Network Security. ACNS 2009. Lecture Notes in Computer Science, vol 5536. Springer, Berlin, Heidelberg
In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion from any stag-CCA-secure threshold tag-based encryption schemes to CCA-secure threshold public-key encryption schemes. Moreover, we give two concrete constructions of stag-CCA-secure threshold tag-based encryption schemes, under the decisional bilinear Diffie-Hellman assumption and the decisional linear assumption, respectively. Thus, we obtain two concrete constructions of threshold public-key encryption schemes, both of which are non-interactive, robust and can be proved secure without random oracle model. Our threshold public-key encryption schemes are conceptually more simple and shown to be more efficient than those of Boneh, Boyen and Halevi.
Keywordsthreshold public-key encryption schemes tag-based encryption schemes the decisional bilinear Diffie-Hellman assumption the decisional linear assumption
Unable to display preview. Download preview PDF.