Information Security and Cryptology - ICISC 2003

DOI10.1007/B96249MaRDI QIDQ5714114zbMATH OpenOpenAlexFDO

Authors Jonathan Katz

Publication date 27 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b96249

Mathematics Subject Classification ID

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

Recommendations

• How to Construct Interval Encryption from Binary Tree Encryption
• Tree based symmetric key broadcast encryption
• On binary tree encodements
• Block-cipher-based tree hashing
• Tree-based cryptographic access control
• Tree-Based Key Distribution Patterns
• A dynamic cryptographic key assignment scheme in a tree structure
• scientific article; zbMATH DE number 1955783
• An optimization of tree topology based parallel cryptography
• Multiterminal Secrecy Generation and Tree Packing

Cited in

(5)

• How to Construct Interval Encryption from Binary Tree Encryption
• Unique-path identity based encryption with applications to strongly secure messaging
• Block-cipher-based tree hashing
• Forward-secure identity-based signature: security notions and construction
• ID-based public key cryptographic systems

This page was built for publication: Information Security and Cryptology - ICISC 2003

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