Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions

Authors:
Seiko Arita;Koji Tsurudome
Affiliations:
Institute of Information Security, Yokohama, Japan;Institute of Information Security, Yokohama, Japan
Venue:
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Year:
2009

Citing 5
Cited 5

How to share a secret

Communications of the ACM
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Chosen ciphertext secure public key threshold encryption without random oracles

CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Chosen-Ciphertext security from tag-based encryption

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Public-key encryption with non-interactive opening: new constructions and stronger definitions

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient threshold encryption from lossy trapdoor functions

PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Generic construction of chosen ciphertext secure proxy re-encryption

CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Secret handshake scheme with request-based-revealing

Computers & Mathematics with Applications
Adaptively secure non-interactive threshold cryptosystems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.