Circular Link Resolution in Content-Centric Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Content-Centric Networks (CCNs) face challenges in resolving circular references when using hash-based names, as the interdependence of hash calculations prevents the formation of cycles in links between Content Objects, leading to limitations in content object linking and potential security vulnerabilities.
Innovation Solution
The introduction of linked Content Objects, which consist of two parts: a named portion containing the content object's name, key, payload, and signature, and a linked portion with external links, where the Content Object hash is calculated based only on the named portion, allowing for circular references without relying on the linked portion's information, and using a nonce and signatures for verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hash-based names are used for Content Objects in CCN, then security and integrity are improved through self-certified names, but circular references between Content Objects cannot be formed due to interdependence of hash calculations
Solution Approach 1:
The Content Object is divided into two independent parts: a named portion (containing name, key, payload, signature) and a linked portion (containing external links). The hash is calculated only on the named portion, making it independent of the linked portion. This segmentation allows circular references in the linked portion without affecting hash calculation integrity.
Solution Approach 2:
The external links are extracted from the hash calculation process and placed in a separate linked portion. Only the named portion contributes to the hash, which is used as the self-certified name. This extraction enables circular references while preserving the security properties of hash-based naming.
2Measurement precision
If the Content Object hash is calculated based on the entire object including external links, then uniqueness is improved, but circular references create interdependence that prevents proper hash calculation
Solution Approach 1:
The hash calculation is segmented to include only the named portion of the Content Object, excluding the linked portion with external links. This eliminates circular dependencies in hash calculation while maintaining uniqueness through the cryptographic hash of the named portion.
3Reliability
If self-certified hash-based names are used, then security verification is improved, but the system cannot handle circular links between Content Objects
Solution Approach 1:
The Content Object is segmented into a named portion for security verification (hashed for self-certified name) and a linked portion for external references. This allows circular links in the linked portion while maintaining security verification through the hash of the named portion.
Solution Approach 2:
External links are extracted from the security-critical hash calculation and placed in a separate linked portion. The named portion alone forms the basis for security verification, while the linked portion can contain circular references without affecting security properties.
Data Source
AI summary
One embodiment of the present invention provides a system for constructing a linked object. During operation, the system constructs a first portion of the linked object. The first portion includes at least one or more data items and a computable identifier calculated based on the one or more data items, and the first portion is referenced by a self-certified name associated with the linked object. The system constructs a second portion of the linked object. The second portion includes at least the computable identifier and an external link that references a second linked object using a self-certified name associated with the second linked object.