Recently proposed content manipulation signatures schemes have a broad range of applications, such as authenticated content extraction, adaptive multimedia con- tent delivery, and XML authentication. Most of the constructions are based on Merkle trees. We show that these constructions are unable to enforce manipulation (extraction) policies, i.e. rules defining what manipulations are permitted/prohibited. We propose a generalization of Merkle trees, so called Relaxed Merkle trees. We present their ability to enforce some useful classes of policies, analyze their expressive power, and discuss few enhancements.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。