Extensions of access structures and their cryptographic applications

Applicable Algebra in Engineering, Communications and Computing

Volumn 21, Issue 4, 2010, Pages 257-284

  Daza, Vanesa ^b   Herranz, Javier ^a   Morillo, Paz ^a   Ràfols, Carla ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b NONE

Author keywords

Attribute based encryption; Dynamic distributed encryption; Secret sharing

Indexed keywords

A-MONOTONE; ACCESS STRUCTURE; ATTRIBUTE-BASED ENCRYPTION; CRYPTOGRAPHIC APPLICATIONS; CRYPTOGRAPHIC PROTOCOLS; ENCRYPTION SCHEMES; EXPLICIT CONSTRUCTIONS; MINIMAL SUBSET; SECRET SHARING; SECRET SHARING SCHEMES; VECTOR SPACE ACCESS STRUCTURES;

DESIGN; SUPPORT VECTOR MACHINES; VECTOR SPACES; VECTORS;

CRYPTOGRAPHY;

EID: 77955694020     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-010-0125-1     Document Type: Article

References (27)

1. Shamir, A.: How to share a secret. Commun. ACM 22, 612-613 (1979)
2. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, American Federation of Information, Processing Societies Proceedings, vol.48, pp. 313-317 (1979)
3. Daza, V., Herranz, J., Morillo, P., Ràfols, C.: CCA2-secure threshold broadcast encryption with shorter ciphertexts. In: Proceedings of ProvSec'07, LNCS, vol.4784, pp. 35-50. Springer (2007)
4. Waters B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. Manuscript available at http://eprint.iacr.org/2008/290 (2008)
5. Brickell, E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput. 9, 105-113 (1989)
6. Martí-Farré, J., Padró, C.: On secret sharing schemes, matroids and polymatroids. In: Proceedings of TCC'07, LNCS, vol.4392, pp. 273-290. Springer (2007)
7. Simmons, G.J.: How to (really) share a secret. In: Proceedings of Crypto'88, LNCS, vol.403, pp. 390-448. Springer (1990)
8. Tassa, T.: Hierarchical threshold secret sharing. J. Cryptol. 20(2), 237-264 (2007)
9. Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptol. 22(2), 227-258 (2009)
10. Padró, C., Sáez, G.: Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7), 2596-2604 (2000)
11. Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. SIAM J. Discrete Math. 22(1), 360-397 (2008)
12. Canetti, R., Goldwasser, S.: An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In: Proceedings of Eurocrypt'99, LNCS, vol.1592, pp. 90-106. Springer (1999)
13. Boneh, D., Boyen, X., Halevi, S.: Chosen ciphertext secure public key threshold encryption without random oracles. In: Proceedings of CT-RSA'06, LNCS, vol.3860, pp. 226-243. Springer (2006)
14. Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Dynamic threshold cryptosystems: a new scheme in group oriented cryptography. In: Proceedings of Pragocrypt'96, CTU Publishing house, pp. 370-379 (1996)
15. Lim, C.H., Lee, P.J.: Directed signatures and application to threshold cryptosystems. In: Proceedings of Security Protocols Workshop'96, LNCS, vol.1189, pp. 131-138. Springer (1997)
16. Chai, Z., Cao, Z., Zhou, Y.: Efficient ID-based broadcast threshold decryption in ad hoc network. In: Proceedings of IMSCCS'06, vol.2, IEEE Computer Society, pp. 148-154 (2006)
17. Delerablée, C., Pointcheval, D.: Dynamic threshold public-key encryption. In: Proceedings of Crypto'08, LNCS, vol.5157, pp. 317-334. Springer (2008)
18. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469-472 (1985)
19. Boneh, D., Boyen, X.: Efficient selective-ID secure identity-based encryption without random oracles. In: Proceedings of Eurocrypt'04, LNCS, vol.3027, pp. 223-238. Springer (2004)
20. Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. In: Proceedings of Eurocrypt'04, LNCS, vol.3027, pp. 207-222. Springer (2004)
21. Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Proceedings of Eurocrypt'05, LNCS, vol.3494, pp. 457-473. Springer (2005)
22. Goyal, V., Pandey, O., Sahai, A.,Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of Computer and Communications Security, CCS'06, ACM, pp. 89-98 (2006)
23. Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 321-334. IEEE Society Press (2007)
24. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of Computer and Communications Security, CCS'93, ACM, pp. 62-73 (1993)
25. Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput. 32(3), 586-615 (2003)
26. Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Proceedings of Eurocrypt'05, LNCS, vol.3494, pp. 440-456. Springer (2005)
27. Boneh, D., Gentry, C.,Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Proceedings of Crypto'05, LNCS, vol.3621, pp. 258-275. Springer (2005) (Pubitemid 43902118)