How to Construct Interval Encryption from Binary Tree Encryption

DOI10.1007/978-3-642-13708-2_2MaRDI QIDQ3575034zbMATH OpenOpenAlexFDO

Authors Huang Lin, Muxin Zhou, Haojin Zhu, Dongsheng Xing, Zhenfu Cao, Xiao-Hui Liang

Publication date 6 July 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-13708-2_2

zbMATH Keywords

binary tree encryptionhierarchical IBEinterval encryptionpublic key broadcast encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Information Security and Cryptology - ICISC 2003
• Tree based symmetric key broadcast encryption
• Block-cipher-based tree hashing
• On binary tree encodements
• Complete tree subset difference broadcast encryption scheme and its analysis
• Tree-Based Key Distribution Patterns
• scientific article; zbMATH DE number 1955783
• A dynamic cryptographic key assignment scheme in a tree structure
• Tree-based cryptographic access control
• Information Security and Privacy

Cited in

(1)

• Information Security and Cryptology - ICISC 2003

This page was built for publication: How to Construct Interval Encryption from Binary Tree Encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575034)