Cryptographic Enforcement of Information Flow Policies Without Public Information

DOI10.1007/978-3-319-28166-7_19zbMath1443.94053arXiv1410.5567OpenAlexW1931655952MaRDI QIDQ2794512

No author found.

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.5567

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (2)

Tree-based cryptographic access control ⋮ Acyclic Digraphs

Cites Work

• Unnamed Item
• Provably-secure time-bound hierarchical key assignment schemes
• New constructions for provably-secure time-bound hierarchical key assignment schemes
• Minimum leaf out-branching and related problems
• Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes
• Digraphs

This page was built for publication: Cryptographic Enforcement of Information Flow Policies Without Public Information