Decoupled name security binding for CCN objects

Information

  • Patent Grant
  • 9916457
  • Patent Number
    9,916,457
  • Date Filed
    Monday, January 12, 2015
    10 years ago
  • Date Issued
    Tuesday, March 13, 2018
    7 years ago
Abstract
A data-hosting system facilitates binding a decoupled name to a data object. During operation, the system can receive a command to generate a decoupled name that binds a new name to the data object. The system generates a hash for the data object based on the data object's content, such that the hash is not generated based on a name for the data object. The system then obtains a private key for signing the data object, and generates the decoupled name for the data object by encrypting the data object's hash and the new name using the private key. This decoupled name binds the new name to the data object. When a client request the data object based on the network name, the system can return the decoupled name associated with content of the data object. The client can use the decoupled name to validate the data object.
Description
BACKGROUND

Field


This disclosure is generally related to Content Centric Networking. More specifically, this disclosure is related to binding a name to a data object.


Related Art


In a typical Content Centric Networking (CCN) architecture, a Content Object has a name, and a content. Whenever a hash is created for the Content Object, the hash is generated based on the Content Object's content, as well as its name. Then, when a publisher signs a Content Object, the publisher generates the signature by encrypting the hash that binds of the Content Object's name and the content. Hence, the signature in the Content Object binds the Content Object's name to its content.


Also, some Content Objects can be requested based on their hash value. For example, a typical Manifest for a data collection can include a hash for a plurality of Content Object's in the data collection, and can include a signature for each of these hash values. An entity that obtains the Manifest can use the hash values in the Manifest to request the individual Content Objects listed in the Manifest. However, even though the Content Object can be requested by its hash value, the Content Object is still tied to a specific name because the hash was generated in part based on this network name.


These hash values make it difficult to bind other names to a Content Object without conflicting with the Content Object's signature or it's hash value. Assigning a new name to an existing Content Object in the typical CCN architecture requires creating a new Content Object that binds the new name to a copy of the existing Content Object's data. It is not currently possible for one piece of content to be assigned multiple signed names.


SUMMARY

One embodiment provides a data-hosting system that facilitates binding a decoupled name to a data object. This decoupled name includes a name for the data object, and includes a signature that binds the name to the data object's hash value. During operation, the system can receive a command to generate a decoupled name for a data object. The command can include a new name to bind to the data object. The system generates a hash for the data object based on the data object's content, such that the hash is not generated based on a name for the data object. The system then obtains a private key for signing the data object, and generates the decoupled name for the data object by encrypting the data object's hash and the new name using the private key.


In some embodiments, the data object includes a Content Centric Networking (CCN) Content Object or an Information Centric Networking (ICN) Content Object.


In Information Centric Networks, each piece of content is individually named, and each piece of data is bound to a unique name that distinguishes the data from any other piece of data, such as other versions of the same data or data from other sources. This unique name allows a network device to request the data by disseminating a request or an Interest that indicates the unique name, and can obtain the data independent from the data's storage location, network location, application, and means of transportation. Named-data network (NDN) or a content-centric network (CCN) are examples of ICN architecture; the following terms describe elements of an NDN or CCN architecture:


Content Object: A single piece of named data, which is bound to a unique name. Content Objects are “persistent,” which means that a Content Object can move around within a computing device, or across different computing devices, but does not change. If any component of the Content Object changes, the entity that made the change creates a new Content Object that includes the updated content, and binds the new Content Object to a new unique name.


Unique Names: A name in an CCN is typically location independent and uniquely identifies a Content Object. A data-forwarding device can use the name or name prefix to forward a packet toward a network node that generates or stores the Content Object, regardless of a network address or physical location for the Content Object. In some embodiments, the name may be a hierarchically structured variable-length identifier (HSVLI). The HSVLI can be divided into several hierarchical components, which can be structured in various ways. For example, the individual name components parc, home, ndn, and test.txt can be structured in a left-oriented prefix-major fashion to form the name “/parc/home/ndn/test.txt.” Thus, the name “/parc/home/ndn” can be a “parent” or “prefix” of “/parc/home/ndn/test.txt.” Additional components can be used to distinguish between different versions of the content item, such as a collaborative document.


In some embodiments, the name can include an identifier, such as a hash value that is derived from the Content Object's data (e.g., a checksum value) and/or from elements of the Content Object's name. A description of a hash-based name is described in U.S. patent application Ser. No. 13/847,814 (entitled “ORDERED-ELEMENT NAMING FOR NAME-BASED PACKET FORWARDING,” by inventor Ignacio Solis, filed 20 Mar. 2013), which is hereby incorporated by reference. A name can also be a flat label. Hereinafter, “name” is used to refer to any name for a piece of data in a name-data network, such as a hierarchical name or name prefix, a flat name, a fixed-length name, an arbitrary-length name, or a label (e.g., a Multiprotocol Label Switching (MPLS) label).


Interest: A packet that indicates a request for a piece of data, and includes a name (or a name prefix) for the piece of data. A data consumer can disseminate a request or Interest across an information-centric network, which CCN/NDN routers can propagate toward a storage device (e.g., a cache server) or a data producer that can provide the requested data to satisfy the request or Interest.


In some embodiments, the ICN system can include a content-centric networking (CCN) architecture. However, the methods disclosed herein are also applicable to other ICN architectures as well. A description of a CCN architecture is described in U.S. patent application Ser. No. 12/338,175 (entitled “CONTROLLING THE SPREAD OF INTERESTS AND CONTENT IN A CONTENT CENTRIC NETWORK,” by inventors Van L. Jacobson and Diana K. Smetters, filed 18 Dec. 2008), which is hereby incorporated by reference.


In some embodiments, the system can receive a request to access the data object, such that the request includes a network name for the content. The system selects the data object based on the network name for the content, and selects the decoupled name based on the hash for the content. The system then returns at least the decoupled name to the entity which requested the data object.


In some variations to these embodiments, while returning at least the decoupled name, the system returns the data object and the decoupled name as separate objects.


In some variations to these embodiments, while returning at least the decoupled name, the system can create a new data object that includes the original data object's contents and also includes the decoupled name, and returns the new data object that includes the decoupled name.


In some variations to these embodiments, while returning at least the decoupled name, the system generates a Manifest that includes the decoupled name, and returns the Manifest.


In some variations to these embodiments, the data object request can include an Interest message which includes the network name or the new name for the data object.


One embodiment provides a client device that can validate a data object based on a decoupled name received for the data object. During operation, the client can request a data object based on a network name for the data object. In response to sending the request, the client can receive a decoupled name associated with content of the data object. The decoupled name includes a second name different than the network name for the data object, and includes a signature generated based on a hash value of the data object's content and the second name. The client then validates the decoupled name.


In some embodiments, while receiving the decoupled name, the client can receive a respective decoupled name as a separate data object from the data object.


In some embodiments, while receiving the decoupled name, the client can receive a respective decoupled name embedded in the data object.


In some embodiments, while receiving the decoupled name, the client can receive a Manifest which includes the at least one decoupled name.


In some variations to these embodiments, the client obtains an object hash value from a decoupled name in the Manifest, and disseminates an Interest for a data object identified by the object hash value. Then, responsive to disseminating the Interest, the client can obtain a nameless data object whose hash value matches the decoupled name's object hash value.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 illustrates an exemplary network environment that facilitates assigning a decoupled name to a data object in accordance with an embodiment.



FIG. 2 illustrates a typical Content Centric Networking Content Object in accordance with an embodiment.



FIG. 3A illustrates a data object which includes a decoupled name in accordance with an embodiment.



FIG. 3B illustrates a nameless data object which includes a decoupled name in accordance with an embodiment.



FIG. 4 presents a flow chart illustrating a method for generating a decoupled name for a data object in accordance with an embodiment.



FIG. 5 presents a flow chart illustrating a method for responding to a request for a data object which may be associated with one or more decoupled name in accordance with an embodiment.



FIG. 6 illustrates a decoupled name which is returned separate from its associated data object in accordance with an embodiment.



FIG. 7 presents a flow chart illustrating a method for requesting a data object which may be associated with one or more decoupled names in accordance with an embodiment.



FIG. 8 illustrates an exemplary apparatus that facilitates assigning a decoupled name to a data object in accordance with an embodiment.



FIG. 9 illustrates an exemplary computer system that facilitates assigning a decoupled name to a data object in accordance with an embodiment.





In the figures, like reference numerals refer to the same figure elements.


DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the embodiments, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present disclosure. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.


Overview


Embodiments of the present invention provide a content management system that solves the problem of binding multiple names to a data object. For example, an entity such as a user or an online service may need a piece of content to have multiple names, perhaps to allow the content to be accessible via any of its multiple names, or to allow different entities to sign and name the same piece of content.


To achieve this, the entity generates a hash for a piece of content based on the content itself, and not based on a name for the content. This entity can cryptographically bind a name to the content by using its private key to generate a signature based on their name for the content and the content's hash. In some embodiments, this entity can generate the signature using the same hash they used to access the content (e.g., when accessing a nameless object); they don't need to recomputed the hash for the content.


Other entities can also generate their own decoupled names for the content by using their own private keys to generate a signature that cryptographically binds a different name to the content's hash. Hence, the content can have a signature for each name that is cryptographically bound to the content, regardless of which entity is binding (e.g., signing) the name and hash.


In some embodiments, a content producer can process a request's network name to determine which data objects to return to a client, regardless of which names are used to store the data objects. For example, the content producer may be a bank that stores a client's statements under the name prefix “/bank/statements/Ignacio/statement_date,” where “statement date” specifies a month and year for a statement. The client can request his latest statement by disseminating a request or Interest for the name prefix “/bank/Ignacio/recent_statement.” The bank can determine the type of information the user is requesting based on the request's name elements, and searches for the most recent statement to return to the client, even though the statement's name does not match the request's network name.


Once the content producer selects the data object to return for the request, the content producer can create a return object with a name that includes the request's name, and with a payload that includes the requested data object and one or more decoupled names that each cryptographically binds a name to the data object. This makes it possible for the content producer to sign the data object based on the unique identifier it uses to store the data object. The client can use a decoupled name's signature to validate the data object, even though the client's request included a different network name.


In contrast, a traditional CCN architecture uses a Content Object's name to forward the Content Object, and to match the Content Object to an Interest. Hence, the Content Object's name is used by the network's forwarders, by the application that generates the Content Object, by the application that is requesting the Content Object, and by security agents that validate the Content Object. This makes it impossible for the traditional CCN architecture to allow a data object to be accessed, forwarded, or validated using any of a multiple names that are cryptographically bound to the data object.


Exemplary Network Environment



FIG. 1 illustrates an exemplary network environment 100 that facilitates assigning a decoupled name to a data object in accordance with an embodiment. Computing environment 100 can include a computer network 102, which can include any wired or wireless network that interfaces various computing devices to each other, such as a computer network implemented via one or more technologies (e.g., Bluetooth, Wi-Fi, cellular, Ethernet, fiber-optic, etc.). Network 102 can include a Content Centric Network. In some embodiments, network 102 can include the Internet.


Computing environment 100 can also include a client device 108, which can include any computing device that can disseminate Interests and receive Content Objects via network 102. For example, client device 108 can include a smartphone 108.1, a tablet computer 108.2, and/or a personal computing device 108.m (e.g., a laptop). Specifically, client device 108 can disseminate an Interest that can disseminate Interests across network 102 to obtain data objects.


In some embodiments, computing environment 100 can include a content producer 104 that can host data or services for one or more client devices. For example, content producer 104 can receive and process a request or Interests from client device 108. When content producer 104 receives the request, content producer 104 can select a piece of data based on the request's name and/or search criteria, regardless of the name used to store the selected piece of data. Content producer can use a decoupled name to bind the data's local name to the data, and to sign the data and its local name for the data.


Recall that in a typical CCN architecture, a Content Object being returned over a network needs to have a name or name prefix that matches that of an Interest which requested the Content Object. In some embodiments, it's possible for network 102 to use one name for forwarding data, and for applications or client devices to use a different name (e.g., a decoupled name) to request the content and verify it's authenticity.


Hence, content producer 104 can return the data to client device 108 by generating a Content Object that includes the network name from the client's request for the data (e.g., an Interest name), and whose payload includes the piece of data and the decoupled name. The routers along a return path over the CCN can use the Content Object's network name to return the Content Object to client device 108, and client device 108 can use the decoupled name to validate the Content Object's data.


For example, an application on client device 108 can generate an Interest that requests a piece of data, such as an Interest with the name “/PARC/ccn.doc” to request ccn.doc from the “/PARC” domain. Client device 108 then disseminates the Interest across network 102, which is then forwarded toward content producer 104 that can satisfy the Interest “/PARC/ccn.doc.” The content producer 104 then uses the name “/PARC/ccn.doc” to determine which local data can be used to satisfy the Interest, and generates a Content Object that includes the Interest's name, and includes the document “ccn.doc” in the payload.


Note that when content producer 104 searches for the data to return, content producer is not limited to searching for existing data that matches the name prefix “/PARC” or “/PARC/ccn.doc.” In some embodiments, content producer can obtain a document “/PARC_Storage/ccn_v5.doc” that is known to be associated with “ccn.doc,” and generates a Content Object that includes “ccn_v5.doc.” Content producer can sign the document “ccn_v5.doc” by generating a signed decoupled name that binds any name to the document, and generates the Content Object to include this decoupled name. The name in the decoupled name can include, for example, the network name “/PARC/ccn.doc,” the storage name “/PARC_Storage/ccn_v5.doc,” or any other name which content producer 104 uses to sign the document.


In some embodiments, another content producer 106 can also generate a decoupled name for the piece of data hosted by content producer 104, even though content producer 106 does not host or did not generate the piece of data. For example, client device 108 can send a request to a trusted entity (e.g., content producer 106) to obtain a signed name for the data. This request can identify the data using an object hash of the data (and not of the data's name). The trusted entity can process this request by looking up a signed name prefix associated with this object hash, and returns this decoupled name to client device 108. The decoupled name includes the data's object hash value, a name which the trusted entity uses for the data, and the signature which binds the name to the data's object hash value.


In some embodiments, using decoupled names allows content producer 104 to move or copy the content to a new location, and to assign a new name to the content, such as a name associated with the new location. For example, if content producer 104 moves the document “ccn.doc” to a server on the domain “/PARC/CSL,” it's possible for the same Content Object to satisfy a request for “/PARC/CSL/ccn.doc,” even though the Content Object is cryptographically bound to the name “/PARC/ccn.doc.” The Content Object has the name “/PARC/CSL/ccn.doc,” but has a cryptographic signature that binds the Content Object's content to “/PARC/ccn.doc.” Thus, the Content Object can now have a network name, and can have a signed name that is different than the network name.


As another example, if content producer 104 corresponds to a bank's server that hosts banking statements, client device 108 can retrieve a bank statement by disseminating an Interest for the statement to content producer 104. Content producer 104 can use any criteria to select the matching content to return to client device 108; the data being returned does not need to match the name or name prefix of the CCN Interest. A user may disseminate an Interest that includes a query: “/bank/ignacio/statement/?month=oct&balance<10000.” Content producer 104 can process the query to search through the user's bank statements for any statement that matches the search criteria, even though the signed name may not satisfy the Interest. Once content producer 104 finds a matching piece of data, content producer 104 generates and returns a Content Object that includes the Interest's name, and that includes the matching data and a corresponding decoupled name for the data in the Content Object's payload.



FIG. 2 illustrates a typical Content Centric Networking Content Object 200 in accordance with an embodiment. Specifically, Content Object 200 includes a network name 202, data 204, and a signature which is generated based on a hash of network name 202 and data 204.



FIG. 3A illustrates a data object 300 which includes a decoupled name in accordance with an embodiment. Specifically, data object 300 includes a network name 302, data 304, and a decoupled name 306. Decoupled name 306 includes a name 310, a data hash 312 computed from data 304, and a signature 308 which is generated based on data hash 312. Neither data hash 312 nor signature 308 are generated based on network name 302 or name 310.


In some embodiments, network name 302 can include, for example, a name which was used by a client device to access data 304. Name 310, on the other hand, can include a name that is permanently bound to data 304, and which is signed by the entity which generated decoupled name 306. If multiple entities have bound a decoupled name to data 304, content producer can generate data object 300 to include multiple decoupled names.


In some embodiments, a Content Object can be a nameless object which does not include a network name for the data. However, the data can still be self-certifying by including a signed decoupled name which is signed by a trusted entity (e.g., a content producer or host for the data) and bound to the nameless object.



FIG. 3B illustrates a nameless data object 350 which includes a decoupled name in accordance with an embodiment. Specifically, data object 350 includes data 352 and a decoupled name 354. Decoupled name 354 includes a name 358, a data hash 360 computed from data 356, and a signature 356 which is generated based on data hash 360. Neither data hash 360 nor signature 356 are generated based on name 358.



FIG. 4 presents a flow chart illustrating a method 400 for generating a decoupled name for a data object in accordance with an embodiment. During operation, a content producer can receive a command to bind a new name to a data object (operation 402). To process the request, the content producer generates a hash for the data object based on the data object's content, and not based on a name for the data (operation 404). Note that generating the hash based on the data object's content allows the content producer to cryptographically bind new names to the content, regardless of the name currently being used to store the content.


The content producer can generate this cryptographic binding by obtaining a private key for signing the data object (operation 406), and encrypts the new name and the data object's hash using the private key to bind the new name to the data object's content (operation 408). The content producer the stores the decoupled name (operation 410).


Returning Data Objects with Decoupled Names


In some embodiments, a client can receive a decoupled name implicitly, for example, when the client receives a data object that includes one or more decoupled names as illustrated in FIG. 3. Alternatively, the client can receive a data object and any associated decoupled names as separate objects, each accessed via its own network name. For example, after processing a request from a client, a content producer can return a data object that includes a pointer (e.g., network names) to the signed decoupled name. The client can obtain the signed decoupled name using the pointer, and can use the signed decoupled name to validate the data object.



FIG. 5 presents a flow chart illustrating a method 500 for responding to a request for a data object which may be associated with one or more decoupled name in accordance with an embodiment. During operation, the content producer receives a request for access to a data object (operation 502). This request can include a network name which uniquely identifies the data object, such as a CCN name (e.g., an HSVLI) for the data object. The content producer then selects the data object from a data repository based on the network name (operation 504), and determines whether a decoupled name exists that is associated with the data object's contents (operation 506). If a decoupled name does not exist, the content producer returns the data object alone to satisfy the request (operation 508).


However, if a decoupled name does exist for the data object, the content producer obtains the decoupled name from a storage repository (operation 510), and returns the data object and the decoupled name to the client device to satisfy the request. For example, the content producer can determine whether it needs to return the decoupled name together or separate from the data object (operation 512). The content producer can determine how it needs to return the decoupled name based on a configuration pre-set by an administrator, or based on an instruction in the request.


If the content producer is to return the decoupled name separately, the content producer proceeds to return the data object and the decoupled name as separate data objects (operation 514). Otherwise, if the content producer is to return the data object and the decoupled names together, the content producer can generate a new data object that includes the decoupled name embedded in the data object (operation 516), and returns the new data object (operation 518).


In some embodiments, a client can receive a data object for a piece of content and any associated decoupled names as separate objects, each accessed via its own network name. This allows the content and its decoupled names to be stored separately, and to hosted and served by different entities.



FIG. 6 illustrates a decoupled name 624 which is returned separate from its associated data object 650 in accordance with an embodiment. For example, after processing a request form the client, a content producer can return a data object 600 that includes two references (e.g., network names): a security binding reference 604 that includes a network name 622 for the signed decoupled name 624; and a data reference that includes a network name 652 for the piece of data 654 (e.g., a Content Object with the data, which may not itself include a signature for the data). If the data is stored as a nameless object, data reference 606 can include a hash value for data 654. The client can then use reference 604 to request a data object 620 that includes signed decoupled name 624, and uses reference 606 to request a data object 650 that includes data 654. The client then receives decoupled name 624 and data 654 via separate data objects.



FIG. 7 presents a flow chart illustrating a method 700 for requesting a data object which may be associated with one or more decoupled names in accordance with an embodiment. During operation, a client can request a data object from a content producer (operation 702). When the client receives a response that includes the data object (operation 704), the client can analyze the response to determine whether the response also includes or references a decoupled name (operation 706).


If so, the client device can obtain the decoupled name (operation 708). For example, the client device can obtain the decoupled name directly from the response received from the content producer. Alternatively, the client can obtain a reference to the decoupled name from the response, and can issue a separate request to receive the decoupled name for the requested data object in a separate data object. The client then validates the decoupled name (operation 710). If the decoupled name is valid, the client can accept the data object (operation 712). However, if validation was not successful, the client may perform a remedial action (operation 714), such as to reject the data object, prompt the user to decide whether to accept the data object, or perform another remedial action.


Manifests with Decoupled Names


A publisher can host a collection of nameless Content Objects across various replica servers or hosting servers. These nameless Content Objects are truly placeless objects, as they do not include a name, and thus don't have an implied routing. The publisher can create a Manifest (or a hierarchy of Manifests) for a nameless Content Object or a collection of nameless Content Objects. This allows the publisher to provide the Manifest (or a root Manifest of a Manifest hierarchy) to a client that requests these Content Objects so that the client can generate Interests to request the nameless Content Objects. A description of a Manifest is described in U.S. patent application Ser. No. 14/337,026, entitled “SYSTEM FOR DISTRIBUTING NAMELESS OBJECTS USING SELF-CERTIFYING NAMES,” by inventor Marc Mosko, filed 21 Jul. 2014), which is hereby incorporated by reference.


The Manifest (or root Manifest) can include Content Object hash (COH) values that can be used to uniquely identify nameless Content Objects or other non-root Manifests. The Manifest also includes a network name or name prefix for a server that hosts the Manifest, and that may also host the nameless Content Objects.


In some embodiments, a Manifest can include decoupled names to one or more data objects. For example, the Manifest can point to other Manifests or content (e.g., Content Objects) by their hash value, regardless of their name. The content can be a data object produced by a content producer, such as a picture taken by a user's mobile phone. The mobile phone can compute a hash of the data object, and can create a decoupled name that is cryptographically binds the name to the data object's hash, and can create a Manifest that includes this decoupled name. This Manifest can be stored across any namespace or name prefix, such as a name prefix for the user's mobile phone, for his personal computer, for an online storage repository (e.g., Dropbox), or for an online service (e.g., an online social network).


A data consumer can obtain the data object by first obtaining the Manifest from any of the namespaces that can provide the Manifest. For example, the data object can be for a picture which the user's mobile phone named “/isolis/pictures/101.jpg.” If the user shared the picture via an online service (e.g., the photo hosting service Flickr by Yahoo! Inc.), the online service can return a Manifest that includes a decoupled name that binds the picture's name and signature to a COH for the picture. When the data consumer receives the Manifest, the consumer can use the decoupled name to obtain the COH for the picture, as well as to determine a name binding for the picture.


In some embodiments, the Manifest can be signed by the online service that is hosting the Manifest, for example, by including a decoupled name bound to the Manifest's COH. Also, the decoupled name for the picture may have been generated by the user's mobile phone. Hence, when the data consumer receives the Manifest, the consumer can use the Manifest's signature to verify that the Manifest indeed originated from the online service, and can use the picture's decoupled name in the Manifest to verify the authenticity of the object itself (e.g., to verify that the picture itself originated from the user's mobile phone). Hence, the decoupled name can be used to validate the picture, regardless of which entity provided the Manifest, and regardless of where the picture is hosted or from which namespace the picture is received.


In some embodiments, a data object may have multiple names that are cryptographically bound to the data object, by different entities. For example, if the data object is a picture that includes multiple people, each person in the picture can generate a separate decoupled name for the picture, which is signed using that person's private key. Other users can use the COH to obtain the picture, and can use a decoupled name from a person in the picture to validate the picture (e.g., to verify that this person is indeed in the picture).


These decoupled name objects can be stored and disseminated separately (e.g., as their own objects), in a Manifest (which can include decoupled names for different objects or the same object), or embedded in the object they're naming. For example, a picture hosting service can allow various users to “tag” themselves in the picture. Then, when a user views or downloads the picture, the hosting service can return a picture object that includes the separate decoupled name objects from each person in the picture that has digitally signed the picture. Alternatively, the online service can generate a Manifest that includes these separate decoupled name objects from each person in the picture.



FIG. 8 illustrates an exemplary apparatus 800 that facilitates assigning a decoupled name to a data object in accordance with an embodiment. Apparatus 800 can comprise a plurality of modules which may communicate with one another via a wired or wireless communication channel. Apparatus 800 may be realized using one or more integrated circuits, and may include fewer or more modules than those shown in FIG. 8. Further, apparatus 800 may be integrated in a computer system, or realized as a separate device which is capable of communicating with other computer systems and/or devices. Specifically, apparatus 800 can comprise a communication module 802, a hash-computing module 804, a name-binding module 806, a manifest-generating module 808, and a data-validating module 810.


In some embodiments, communication module 802 can send a decoupled name for a data object to a client, and/or can receive a decoupled name from a content producer. Hash-computing module 804 can compute a hash for the data object's contents without accounting for the data object's name. Name-binding module 806 can bind a name to the data object by using a publisher's key to sign the name and the hash for the data object. Manifest-generating module 808 can generate a Manifest which includes one or more decoupled names associated with one or more data objects in a collection of objects. Data-validating module 810 can validate a data object by validating a signature in a decoupled name for the data object.



FIG. 9 illustrates an exemplary computer system 902 that facilitates assigning a decoupled name to a data object in accordance with an embodiment. Computer system 902 includes a processor 904, a memory 906, and a storage device 908. Memory 906 can include a volatile memory (e.g., RAM) that serves as a managed memory, and can be used to store one or more memory pools. Furthermore, computer system 902 can be coupled to a display device 910, a keyboard 912, and a pointing device 914. Storage device 908 can store operating system 916, a data-managing system 918, and data 926.


Data-managing system 918 can include instructions, which when executed by computer system 902, can cause computer system 902 to perform methods and/or processes described in this disclosure. Specifically, data-managing system 918 may include instructions for sending a decoupled name for a data object to a client, and/or can receiving a decoupled name from a content producer (communication module 920). Further, data-managing system 918 can include instructions for computing a hash for the data object's contents without accounting for the data object's name (hash-computing module 922). Data-managing system 918 can also include instructions for binding a name to the data object by using a publisher's key to sign the name and the hash for the data object (name-binding module 924).


Data-managing system 918 can include instructions for generating a Manifest which includes one or more decoupled names associated with one or more data objects in a collection of objects (manifest-generating module 922). Data-managing system 918 can also include instructions for validating a data object by validating a signature in a decoupled name for the data object (data-validating module 924).


Data 926 can include any data that is required as input or that is generated as output by the methods and/or processes described in this disclosure. Specifically, data 926 can store at least a collection of data objects, and a set of decoupled names for the data objects.


The data structures and code described in this detailed description are typically stored on a computer-readable storage medium, which may be any device or medium that can store code and/or data for use by a computer system. The computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing computer-readable media now known or later developed.


The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the computer-readable storage medium.


Furthermore, the methods and processes described above can be included in hardware modules. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), and other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.


The foregoing descriptions of embodiments of the present invention have been presented for purposes of illustration and description only. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims.

Claims
  • 1. A computer-implemented method, comprising: responsive to receiving, by a computing device, a command to generate a decoupled name for a data object having content and a network name, wherein the command includes a new name to bind to the data object: generating a hash for the data object based on the content, but not based on either of the name or the new name;obtaining a private key for signing the data object; andencrypting the hash using the private key to produce a cryptographic signature for the data object, wherein the new name, the hash, and the cryptographic signature collectively represent the decoupled name for the data object;responsive to receiving a request to access the data object, determining whether the decoupled name is associated with the data object;when the decoupled name is associated with the data object, determining whether to return the decoupled name and the data object separately or together;when the decoupled name is associated with the data object and when the determining is to return the decoupled name and the data object together, generating a new data object including the decoupled name embedded with the data object, and returning the new data object; andwhen the decoupled name is associated with the data object and when the determining is not to return the decoupled name and the data object together, returning the decoupled name and the data object as separate objects using separate object names.
  • 2. The method of claim 1, wherein the data object includes a Content Centric Networking (CCN) Content Object.
  • 3. The method of claim 1, wherein the request to access the data object includes a network name for the content; and the returning the content and the decoupled name further comprises: selecting the data object based on the network name for the content; andselecting the decoupled name based on the hash for the content.
  • 4. The method of claim 3, wherein the returning at least the decoupled name and the content further involves: generating a Manifest that includes the decoupled name; andreturning the Manifest.
  • 5. The method of claim 3, wherein the data object request includes an Interest message which includes the network name or the new name for the data object.
  • 6. The method of claim 1, wherein the data object is additionally bound to a name differing from the decoupled name.
  • 7. The method of claim 1, wherein the request is received from a client.
  • 8. The method of claim 1, wherein the encrypting the hash using the private key includes encrypting the hash using the private key, but not using the network name or the new name, to produce the cryptographic signature for the data object.
  • 9. A non-transitory, computer-readable storage medium storing instructions that, when executed by a computer, cause the computer to perform a method, the method comprising: responsive to receiving a command to generate a decoupled name for a data object having content and a network name, wherein the command includes a new name to bind to the data object: generating a hash for the data object based on the content, but not based on either of the name or the new name;obtaining a private key for signing the data object; andencrypting the hash using the private key to produce a cryptographic signature for the data object, wherein the new name, the hash, and the cryptographic signature collectively represent the decoupled name for the data object;responsive to receiving a request to access the data object, determining whether the decoupled name is associated with the data object;when the decoupled name is associated with the data object, determining whether to return the decoupled name and the data object separately or together;when the decoupled name is associated with the data object and when the determining is to return the decoupled name and the data object together, generating a new data object including the decoupled name embedded with the data object, and returning the new data object; andwhen the decoupled name is associated with the data object and when the determining is not to return the decoupled name and the data object together, returning the decoupled name and the data object as separate objects using separate object names.
  • 10. The storage medium of claim 9, wherein the data object includes a Content Centric Networking (CCN) Content Object.
  • 11. The storage medium of claim 9, wherein the method further comprises: receiving the request to access the data object, wherein the request includes a network name for the content;selecting the data object based on the network name for the content; andselecting the decoupled name based on the hash for the content.
  • 12. The storage medium of claim 11, wherein the returning involves: generating a Manifest that includes the decoupled name; andreturning the Manifest.
  • 13. The storage medium of claim 11, wherein the data object request includes an Interest message which includes the network name or the new name for the data object.
  • 14. The storage medium of claim 9, wherein the request is received from a client.
  • 15. The storage medium of claim 9, wherein the encrypting the hash using the private key includes encrypting the hash using the private key, but not using the network name or the new name, to produce the cryptographic signature for the data object.
  • 16. A computer system, comprising: one or more processors; anda non-transitory computer-readable medium storing instructions that, when executed by the one or more processors, cause the computer system to perform a method including: responsive to receiving a command to generate a decoupled name for a data object having content and a network name, wherein the command includes a new name to bind to the data object:generating a hash for the data object based on the content, but not based on either of the name or the new name;obtaining a private key for signing the data object; andencrypting the hash using the private key to produce a cryptographic signature for the data object, wherein the new name, the hash, and the cryptographic signature collectively represent the decoupled name for the data object;responsive to receiving a request to access the data object, determining whether the decoupled name is associated with the data object;when the decoupled name is associated with the data object, determining whether to return the decoupled name and the data object separately or together;when the decoupled name is associated with the data object and when the determining is to return the decoupled name and the data object together, generating a new data object including the decoupled name embedded with the data object, and returning the new data object; andwhen the decoupled name is associated with the data object and when the determining is not to return the decoupled name and the data object together, returning the decoupled name and the data object as separate objects using separate object names.
  • 17. The computer system of claim 16, wherein the request is received from a client.
  • 18. The computer system of claim 16, wherein the encrypting the hash using the private key includes encrypting the hash using the private key, but not using the network name or the new name, to produce the cryptographic signature for the data object.
US Referenced Citations (585)
Number Name Date Kind
817441 Niesz Apr 1906 A
4309569 Merkle Jan 1982 A
4921898 Lenney May 1990 A
5070134 Oyamada Dec 1991 A
5110856 Oyamada May 1992 A
5214702 Fischer May 1993 A
5377354 Scannell Dec 1994 A
5506844 Rao Apr 1996 A
5629370 Freidzon May 1997 A
5845207 Amin Dec 1998 A
5870605 Bracho Feb 1999 A
6047331 Medard Apr 2000 A
6052683 Irwin Apr 2000 A
6085320 Kaliski, Jr. Jul 2000 A
6091724 Chandra Jul 2000 A
6128623 Mattis Oct 2000 A
6128627 Mattis Oct 2000 A
6173364 Zenchelsky Jan 2001 B1
6209003 Mattis Mar 2001 B1
6226618 Downs May 2001 B1
6233617 Rothwein May 2001 B1
6233646 Hahm May 2001 B1
6289358 Mattis Sep 2001 B1
6292880 Mattis Sep 2001 B1
6332158 Risley Dec 2001 B1
6363067 Chung Mar 2002 B1
6366988 Skiba Apr 2002 B1
6574377 Cahill Jun 2003 B1
6654792 Verma Nov 2003 B1
6667957 Corson Dec 2003 B1
6681220 Kaplan Jan 2004 B1
6681326 Son Jan 2004 B2
6732273 Byers May 2004 B1
6769066 Botros Jul 2004 B1
6772333 Brendel Aug 2004 B1
6775258 vanValkenburg Aug 2004 B1
6862280 Bertagna Mar 2005 B1
6901452 Bertagna May 2005 B1
6915307 Mattis Jul 2005 B1
6917985 Madruga Jul 2005 B2
6957228 Graser Oct 2005 B1
6968393 Chen Nov 2005 B1
6981029 Menditto Dec 2005 B1
7007024 Zelenka Feb 2006 B2
7013389 Srivastava Mar 2006 B1
7031308 Garcia-Luna-Aceves Apr 2006 B2
7043637 Bolosky May 2006 B2
7061877 Gummalla Jun 2006 B1
7080073 Jiang Jul 2006 B1
RE39360 Aziz Oct 2006 E
7149750 Chadwick Dec 2006 B2
7152094 Jannu Dec 2006 B1
7177646 ONeill Feb 2007 B2
7206860 Murakami Apr 2007 B2
7206861 Callon Apr 2007 B1
7210326 Kawamoto May 2007 B2
7246159 Aggarwal Jul 2007 B2
7257837 Xu Aug 2007 B2
7287275 Moskowitz Oct 2007 B2
7315541 Housel Jan 2008 B1
7339929 Zelig Mar 2008 B2
7350229 Lander Mar 2008 B1
7362727 ONeill Apr 2008 B1
7382787 Barnes Jun 2008 B1
7395507 Robarts Jul 2008 B2
7430755 Hughes Sep 2008 B1
7444251 Nikovski Oct 2008 B2
7466703 Arunachalam Dec 2008 B1
7472422 Agbabian Dec 2008 B1
7496668 Hawkinson Feb 2009 B2
7509425 Rosenberg Mar 2009 B1
7523016 Surdulescu Apr 2009 B1
7542471 Samuels Jun 2009 B2
7543064 Juncker Jun 2009 B2
7552233 Raju Jun 2009 B2
7555482 Korkus Jun 2009 B2
7555563 Ott Jun 2009 B2
7564812 Elliott Jul 2009 B1
7567547 Mosko Jul 2009 B2
7567946 Andreoli Jul 2009 B2
7580971 Gollapudi Aug 2009 B1
7623535 Guichard Nov 2009 B2
7636767 Lev-Ran Dec 2009 B2
7647507 Feng Jan 2010 B1
7660324 Oguchi Feb 2010 B2
7685290 Satapati Mar 2010 B2
7698463 Ogier Apr 2010 B2
7698559 Chaudhury Apr 2010 B1
7769887 Bhattacharyya Aug 2010 B1
7779467 Choi Aug 2010 B2
7801069 Cheung Sep 2010 B2
7801177 Luss Sep 2010 B2
7816441 Elizalde Oct 2010 B2
7831733 Sultan Nov 2010 B2
7873619 Faibish Jan 2011 B1
7908337 Garcia-Luna-Aceves Mar 2011 B2
7924837 Shabtay Apr 2011 B1
7953014 Toda May 2011 B2
7953885 Devireddy May 2011 B1
7979912 Roka Jul 2011 B1
8000267 Solis Aug 2011 B2
8010691 Kollmansberger Aug 2011 B2
8069023 Frailong Nov 2011 B1
8074289 Carpentier Dec 2011 B1
8117441 Kurien Feb 2012 B2
8160069 Jacobson Apr 2012 B2
8204060 Jacobson Jun 2012 B2
8214364 Bigus Jul 2012 B2
8224985 Takeda Jul 2012 B2
8225057 Zheng Jul 2012 B1
8271578 Sheffi Sep 2012 B2
8271687 Turner Sep 2012 B2
8312064 Gauvin Nov 2012 B1
8332357 Chung Dec 2012 B1
8386622 Jacobson Feb 2013 B2
8447851 Anderson May 2013 B1
8462781 McGhee Jun 2013 B2
8467297 Liu Jun 2013 B2
8473633 Eardley Jun 2013 B2
8553562 Allan Oct 2013 B2
8572214 Garcia-Luna-Aceves Oct 2013 B2
8654649 Vasseur Feb 2014 B2
8665757 Kling Mar 2014 B2
8667172 Ravindran Mar 2014 B2
8677451 Bhimaraju Mar 2014 B1
8688619 Ezick Apr 2014 B1
8699350 Kumar Apr 2014 B1
8718055 Vasseur May 2014 B2
8750820 Allan Jun 2014 B2
8761022 Chiabaut Jun 2014 B2
8762477 Xie Jun 2014 B2
8762570 Qian Jun 2014 B2
8762707 Killian Jun 2014 B2
8767627 Ezure Jul 2014 B2
8817594 Gero Aug 2014 B2
8826381 Kim Sep 2014 B2
8832302 Bradford Sep 2014 B1
8836536 Marwah Sep 2014 B2
8861356 Kozat Oct 2014 B2
8862774 Vasseur Oct 2014 B2
8868779 ONeill Oct 2014 B2
8874842 Kimmel Oct 2014 B1
8880682 Bishop Nov 2014 B2
8903756 Zhao Dec 2014 B2
8923293 Jacobson Dec 2014 B2
8934496 Vasseur Jan 2015 B2
8937865 Kumar Jan 2015 B1
8972969 Gaither Mar 2015 B2
8977596 Montulli Mar 2015 B2
9002921 Westphal Apr 2015 B2
9032095 Traina May 2015 B1
9071498 Beser Jun 2015 B2
9112895 Lin Aug 2015 B1
9137152 Xie Sep 2015 B2
9253087 Zhang Feb 2016 B2
9270598 Oran Feb 2016 B1
9280610 Gruber Mar 2016 B2
20020002680 Carbajal Jan 2002 A1
20020010795 Brown Jan 2002 A1
20020038296 Margolus Mar 2002 A1
20020048269 Hong Apr 2002 A1
20020054593 Morohashi May 2002 A1
20020077988 Sasaki Jun 2002 A1
20020078066 Robinson Jun 2002 A1
20020138551 Erickson Sep 2002 A1
20020152305 Jackson Oct 2002 A1
20020176404 Girard Nov 2002 A1
20020188605 Adya Dec 2002 A1
20020199014 Yang Dec 2002 A1
20030004621 Bousquet Jan 2003 A1
20030009365 Tynan Jan 2003 A1
20030033394 Stine Feb 2003 A1
20030046396 Richter Mar 2003 A1
20030046421 Horvitz et al. Mar 2003 A1
20030046437 Eytchison Mar 2003 A1
20030048793 Pochon Mar 2003 A1
20030051100 Patel Mar 2003 A1
20030061384 Nakatani Mar 2003 A1
20030074472 Lucco Apr 2003 A1
20030088696 McCanne May 2003 A1
20030097447 Johnston May 2003 A1
20030099237 Mitra May 2003 A1
20030140257 Paterka Jul 2003 A1
20030229892 Sardera Dec 2003 A1
20040024879 Dingman Feb 2004 A1
20040030602 Rosenquist Feb 2004 A1
20040064737 Milliken Apr 2004 A1
20040071140 Jason Apr 2004 A1
20040073617 Milliken Apr 2004 A1
20040073715 Folkes Apr 2004 A1
20040139230 Kim Jul 2004 A1
20040196783 Shinomiya Oct 2004 A1
20040218548 Kennedy Nov 2004 A1
20040221047 Grover Nov 2004 A1
20040225627 Botros Nov 2004 A1
20040233916 Takeuchi Nov 2004 A1
20040246902 Weinstein Dec 2004 A1
20040252683 Kennedy Dec 2004 A1
20050003832 Osafune Jan 2005 A1
20050028156 Hammond Feb 2005 A1
20050043060 Brandenberg Feb 2005 A1
20050050211 Kaul Mar 2005 A1
20050074001 Mattes Apr 2005 A1
20050132207 Mourad Jun 2005 A1
20050149508 Deshpande Jul 2005 A1
20050159823 Hayes Jul 2005 A1
20050198351 Nog Sep 2005 A1
20050249196 Ansari Nov 2005 A1
20050259637 Chu Nov 2005 A1
20050262217 Nonaka Nov 2005 A1
20050281288 Banerjee Dec 2005 A1
20050286535 Shrum Dec 2005 A1
20050289222 Sahim Dec 2005 A1
20060010249 Sabesan Jan 2006 A1
20060029102 Abe Feb 2006 A1
20060039379 Abe Feb 2006 A1
20060051055 Ohkawa Mar 2006 A1
20060072523 Richardson Apr 2006 A1
20060099973 Nair May 2006 A1
20060129514 Watanabe Jun 2006 A1
20060133343 Huang Jun 2006 A1
20060146686 Kim Jul 2006 A1
20060173831 Basso Aug 2006 A1
20060193295 White Aug 2006 A1
20060203804 Whitmore Sep 2006 A1
20060206445 Andreoli Sep 2006 A1
20060215684 Capone Sep 2006 A1
20060223504 Ishak Oct 2006 A1
20060242155 Moore Oct 2006 A1
20060256767 Suzuki Nov 2006 A1
20060268792 Belcea Nov 2006 A1
20070019619 Foster Jan 2007 A1
20070073888 Madhok Mar 2007 A1
20070094265 Korkus Apr 2007 A1
20070112880 Yang May 2007 A1
20070124412 Narayanaswami May 2007 A1
20070127457 Mirtorabi Jun 2007 A1
20070160062 Morishita Jul 2007 A1
20070162394 Zager Jul 2007 A1
20070171828 Dalal Jul 2007 A1
20070189284 Kecskemeti Aug 2007 A1
20070195765 Heissenbuttel Aug 2007 A1
20070204011 Shaver Aug 2007 A1
20070209067 Fogel Sep 2007 A1
20070239892 Ott Oct 2007 A1
20070240207 Belakhdar Oct 2007 A1
20070245034 Retana Oct 2007 A1
20070253418 Shiri Nov 2007 A1
20070255677 Alexander Nov 2007 A1
20070255699 Sreenivas Nov 2007 A1
20070255781 Li Nov 2007 A1
20070274504 Maes Nov 2007 A1
20070275701 Jonker Nov 2007 A1
20070276907 Maes Nov 2007 A1
20070283158 Danseglio Dec 2007 A1
20070294187 Scherrer Dec 2007 A1
20080005056 Stelzig Jan 2008 A1
20080005223 Flake Jan 2008 A1
20080010366 Duggan Jan 2008 A1
20080037420 Tang Feb 2008 A1
20080043989 Furutono Feb 2008 A1
20080046340 Brown Feb 2008 A1
20080059631 Bergstrom Mar 2008 A1
20080080440 Yarvis Apr 2008 A1
20080082662 Dandliker Apr 2008 A1
20080095159 Suzuki Apr 2008 A1
20080101357 Iovanna May 2008 A1
20080107034 Jetcheva May 2008 A1
20080107259 Satou May 2008 A1
20080123862 Rowley May 2008 A1
20080133583 Artan Jun 2008 A1
20080133755 Pollack Jun 2008 A1
20080151755 Nishioka Jun 2008 A1
20080159271 Kutt Jul 2008 A1
20080165775 Das Jul 2008 A1
20080186901 Itagaki Aug 2008 A1
20080200153 Fitzpatrick Aug 2008 A1
20080215669 Gaddy Sep 2008 A1
20080216086 Tanaka Sep 2008 A1
20080243992 Jardetzky Oct 2008 A1
20080250006 Dettinger Oct 2008 A1
20080256138 Sim-Tang Oct 2008 A1
20080256359 Kahn Oct 2008 A1
20080270618 Rosenberg Oct 2008 A1
20080271143 Stephens Oct 2008 A1
20080287142 Keighran Nov 2008 A1
20080288580 Wang Nov 2008 A1
20080291923 Back Nov 2008 A1
20080298376 Takeda Dec 2008 A1
20080320148 Capuozzo Dec 2008 A1
20090006659 Collins Jan 2009 A1
20090013324 Gobara Jan 2009 A1
20090022154 Kiribe Jan 2009 A1
20090024641 Quigley Jan 2009 A1
20090030978 Johnson Jan 2009 A1
20090037763 Adhya Feb 2009 A1
20090052660 Chen Feb 2009 A1
20090067429 Nagai Mar 2009 A1
20090077184 Brewer Mar 2009 A1
20090092043 Lapuh Apr 2009 A1
20090097631 Gisby Apr 2009 A1
20090103515 Pointer Apr 2009 A1
20090113068 Fujihira Apr 2009 A1
20090116393 Hughes May 2009 A1
20090117922 Bell May 2009 A1
20090132662 Sheridan May 2009 A1
20090135728 Shen May 2009 A1
20090144300 Chatley Jun 2009 A1
20090157887 Froment Jun 2009 A1
20090185745 Momosaki Jul 2009 A1
20090193101 Munetsugu Jul 2009 A1
20090198832 Shah Aug 2009 A1
20090222344 Greene Sep 2009 A1
20090228593 Takeda Sep 2009 A1
20090254572 Redlich Oct 2009 A1
20090268905 Matsushima Oct 2009 A1
20090274158 Sharp Nov 2009 A1
20090276396 Gorman Nov 2009 A1
20090285209 Stewart Nov 2009 A1
20090287835 Jacobson Nov 2009 A1
20090287853 Carson Nov 2009 A1
20090288076 Johnson Nov 2009 A1
20090288143 Stebila Nov 2009 A1
20090288163 Jacobson Nov 2009 A1
20090292743 Bigus Nov 2009 A1
20090293121 Bigus Nov 2009 A1
20090296719 Maier Dec 2009 A1
20090300079 Shitomi Dec 2009 A1
20090300407 Kamath Dec 2009 A1
20090300512 Ahn Dec 2009 A1
20090307333 Welingkar Dec 2009 A1
20090323632 Nix Dec 2009 A1
20100005061 Basco Jan 2010 A1
20100027539 Beverly Feb 2010 A1
20100046546 Ram Feb 2010 A1
20100057929 Merat Mar 2010 A1
20100058346 Narang Mar 2010 A1
20100088370 Wu Apr 2010 A1
20100094767 Miltonberger Apr 2010 A1
20100094876 Huang Apr 2010 A1
20100098093 Ejzak Apr 2010 A1
20100100465 Cooke Apr 2010 A1
20100103870 Garcia-Luna-Aceves Apr 2010 A1
20100124191 Vos May 2010 A1
20100125911 Bhaskaran May 2010 A1
20100131660 Dec May 2010 A1
20100150155 Napierala Jun 2010 A1
20100165976 Khan Jul 2010 A1
20100169478 Saha Jul 2010 A1
20100169503 Kollmansberger Jul 2010 A1
20100180332 Ben-Yochanan Jul 2010 A1
20100182995 Hwang Jul 2010 A1
20100185753 Liu Jul 2010 A1
20100195653 Jacobson Aug 2010 A1
20100195654 Jacobson Aug 2010 A1
20100195655 Jacobson Aug 2010 A1
20100217874 Anantharaman Aug 2010 A1
20100217985 Fahrny Aug 2010 A1
20100232402 Przybysz Sep 2010 A1
20100232439 Dham Sep 2010 A1
20100235516 Nakamura Sep 2010 A1
20100246549 Zhang Sep 2010 A1
20100250497 Redlich Sep 2010 A1
20100250939 Adams Sep 2010 A1
20100257149 Cognigni Oct 2010 A1
20100268782 Zombek Oct 2010 A1
20100272107 Papp Oct 2010 A1
20100281263 Ugawa Nov 2010 A1
20100284309 Allan Nov 2010 A1
20100284404 Gopinath Nov 2010 A1
20100293293 Beser Nov 2010 A1
20100322249 Thathapudi Dec 2010 A1
20110013637 Xue Jan 2011 A1
20110019674 Iovanna Jan 2011 A1
20110022812 vanderLinden Jan 2011 A1
20110029952 Harrington Feb 2011 A1
20110055392 Shen Mar 2011 A1
20110055921 Narayanaswamy Mar 2011 A1
20110060716 Forman Mar 2011 A1
20110060717 Forman Mar 2011 A1
20110090908 Jacobson Apr 2011 A1
20110106755 Hao May 2011 A1
20110131308 Eriksson Jun 2011 A1
20110137919 Ryu Jun 2011 A1
20110145597 Yamaguchi Jun 2011 A1
20110145858 Philpott Jun 2011 A1
20110149858 Hwang Jun 2011 A1
20110153840 Narayana Jun 2011 A1
20110158122 Murphy Jun 2011 A1
20110161408 Kim Jun 2011 A1
20110202609 Chaturvedi Aug 2011 A1
20110219093 Ragunathan Sep 2011 A1
20110219427 Hito Sep 2011 A1
20110219727 May Sep 2011 A1
20110225293 Rathod Sep 2011 A1
20110231578 Nagappan Sep 2011 A1
20110239256 Gholmieh Sep 2011 A1
20110258049 Ramer Oct 2011 A1
20110264824 Venkata Subramanian Oct 2011 A1
20110265159 Ronda Oct 2011 A1
20110265174 Thornton Oct 2011 A1
20110271007 Wang Nov 2011 A1
20110280214 Lee Nov 2011 A1
20110286457 Ee Nov 2011 A1
20110286459 Rembarz Nov 2011 A1
20110295783 Zhao Dec 2011 A1
20110299454 Krishnaswamy Dec 2011 A1
20120011170 Elad Jan 2012 A1
20120011551 Levy Jan 2012 A1
20120023113 Ferren Jan 2012 A1
20120036180 Thornton Feb 2012 A1
20120045064 Rembarz Feb 2012 A1
20120047361 Erdmann Feb 2012 A1
20120066727 Nozoe Mar 2012 A1
20120106339 Mishra May 2012 A1
20120110159 Richardson May 2012 A1
20120114313 Phillips May 2012 A1
20120120803 Farkas May 2012 A1
20120127994 Ko May 2012 A1
20120136676 Goodall May 2012 A1
20120136936 Quintuna May 2012 A1
20120136945 Lee May 2012 A1
20120137367 Dupont May 2012 A1
20120141093 Yamaguchi Jun 2012 A1
20120155464 Kim Jun 2012 A1
20120158973 Jacobson Jun 2012 A1
20120163373 Lo Jun 2012 A1
20120166433 Tseng Jun 2012 A1
20120170913 Isozaki Jul 2012 A1
20120179653 Araki Jul 2012 A1
20120197690 Agulnek Aug 2012 A1
20120198048 Ioffe Aug 2012 A1
20120221150 Arensmeier Aug 2012 A1
20120224487 Hui Sep 2012 A1
20120226902 Kim Sep 2012 A1
20120257500 Lynch Oct 2012 A1
20120284791 Miller Nov 2012 A1
20120290669 Parks Nov 2012 A1
20120290919 Melnyk Nov 2012 A1
20120291102 Cohen Nov 2012 A1
20120300669 Zahavi Nov 2012 A1
20120307629 Vasseur Dec 2012 A1
20120314580 Hong Dec 2012 A1
20120317307 Ravindran Dec 2012 A1
20120322422 Frecks Dec 2012 A1
20120323933 He Dec 2012 A1
20120331112 Chatani Dec 2012 A1
20130024560 Vasseur Jan 2013 A1
20130041982 Shi Feb 2013 A1
20130051392 Filsfils Feb 2013 A1
20130054971 Yamaguchi Feb 2013 A1
20130060962 Wang Mar 2013 A1
20130061084 Barton Mar 2013 A1
20130066823 Sweeney Mar 2013 A1
20130073552 Rangwala Mar 2013 A1
20130073882 Inbaraj Mar 2013 A1
20130074155 Huh Mar 2013 A1
20130090942 Robinson Apr 2013 A1
20130091539 Khurana Apr 2013 A1
20130110987 Kim May 2013 A1
20130111063 Lee May 2013 A1
20130128786 Sultan May 2013 A1
20130132719 Kobayashi May 2013 A1
20130139245 Thomas May 2013 A1
20130151584 Westphal Jun 2013 A1
20130151646 Chidambaram Jun 2013 A1
20130152070 Bhullar Jun 2013 A1
20130163426 Beliveau Jun 2013 A1
20130166668 Byun Jun 2013 A1
20130173822 Hong Jul 2013 A1
20130182568 Lee Jul 2013 A1
20130182931 Fan Jul 2013 A1
20130185406 Choi Jul 2013 A1
20130191412 Kitamura Jul 2013 A1
20130197698 Shah Aug 2013 A1
20130198119 Eberhardt, III Aug 2013 A1
20130212185 Pasquero Aug 2013 A1
20130219038 Lee Aug 2013 A1
20130219081 Qian Aug 2013 A1
20130219478 Mahamuni Aug 2013 A1
20130223237 Hui Aug 2013 A1
20130227048 Xie Aug 2013 A1
20130227114 Vasseur Aug 2013 A1
20130227166 Ravindran Aug 2013 A1
20130242996 Varvello Sep 2013 A1
20130250809 Hui Sep 2013 A1
20130262365 Dolbear Oct 2013 A1
20130262698 Schwan Oct 2013 A1
20130282854 Jang Oct 2013 A1
20130282860 Zhang Oct 2013 A1
20130282920 Zhang Oct 2013 A1
20130304758 Gruber Nov 2013 A1
20130304937 Lee Nov 2013 A1
20130325888 Oneppo Dec 2013 A1
20130329696 Xu Dec 2013 A1
20130332971 Fisher Dec 2013 A1
20130336103 Vasseur Dec 2013 A1
20130336323 Srinivasan Dec 2013 A1
20130339481 Hong Dec 2013 A1
20130343408 Cook Dec 2013 A1
20140003232 Guichard Jan 2014 A1
20140003424 Matsuhira Jan 2014 A1
20140006354 Parkison Jan 2014 A1
20140006565 Muscariello Jan 2014 A1
20140029445 Hui Jan 2014 A1
20140032714 Liu Jan 2014 A1
20140033193 Palaniappan Jan 2014 A1
20140040505 Barton Feb 2014 A1
20140040628 Fort Feb 2014 A1
20140043987 Watve Feb 2014 A1
20140047513 vantNoordende Feb 2014 A1
20140074730 Arensmeier Mar 2014 A1
20140075567 Raleigh Mar 2014 A1
20140082135 Jung Mar 2014 A1
20140082661 Krahnstoever Mar 2014 A1
20140089454 Jeon Mar 2014 A1
20140096249 Dupont Apr 2014 A1
20140098685 Shattil Apr 2014 A1
20140108313 Heidasch Apr 2014 A1
20140108474 David Apr 2014 A1
20140115037 Liu Apr 2014 A1
20140122587 Petker et al. May 2014 A1
20140129736 Yu May 2014 A1
20140136814 Stark May 2014 A1
20140140348 Perlman May 2014 A1
20140143370 Vilenski May 2014 A1
20140146819 Bae May 2014 A1
20140149733 Kim May 2014 A1
20140156396 deKozan Jun 2014 A1
20140165207 Engel Jun 2014 A1
20140172783 Suzuki Jun 2014 A1
20140172981 Kim Jun 2014 A1
20140173034 Liu Jun 2014 A1
20140173076 Ravindran Jun 2014 A1
20140181140 Kim Jun 2014 A1
20140192677 Chew Jul 2014 A1
20140192717 Liu Jul 2014 A1
20140195328 Ferens Jul 2014 A1
20140195641 Wang Jul 2014 A1
20140195666 Dumitriu Jul 2014 A1
20140204945 Byun Jul 2014 A1
20140214942 Ozonat Jul 2014 A1
20140233575 Xie Aug 2014 A1
20140237085 Park Aug 2014 A1
20140237095 Bevilacqua-Linn Aug 2014 A1
20140245359 DeFoy Aug 2014 A1
20140254595 Luo Sep 2014 A1
20140280823 Varvello Sep 2014 A1
20140281489 Peterka Sep 2014 A1
20140281505 Zhang Sep 2014 A1
20140282816 Xie Sep 2014 A1
20140289325 Solis Sep 2014 A1
20140289790 Wilson Sep 2014 A1
20140298248 Kang Oct 2014 A1
20140314093 You Oct 2014 A1
20140337276 Iordanov Nov 2014 A1
20140365550 Jang Dec 2014 A1
20150006896 Franck Jan 2015 A1
20150018770 Baran Jan 2015 A1
20150032892 Narayanan Jan 2015 A1
20150033365 Mellor Jan 2015 A1
20150039890 Khosravi Feb 2015 A1
20150063802 Bahadur Mar 2015 A1
20150089081 Thubert Mar 2015 A1
20150095481 Ohnishi Apr 2015 A1
20150095514 Yu Apr 2015 A1
20150120663 LeScouarnec Apr 2015 A1
20150169758 Assom Jun 2015 A1
20150188770 Naiksatam Jul 2015 A1
20150195149 Vasseur Jul 2015 A1
20150207633 Ravindran Jul 2015 A1
20150207864 Wilson Jul 2015 A1
20150279348 Cao Oct 2015 A1
20150288755 Mosko Oct 2015 A1
20150312300 Mosko Oct 2015 A1
20150349961 Mosko Dec 2015 A1
20150372903 Hui Dec 2015 A1
20150381546 Mahadevan Dec 2015 A1
20160019275 Mosko Jan 2016 A1
20160021172 Mahadevan Jan 2016 A1
20160062840 Scott Mar 2016 A1
20160110466 Uzun Apr 2016 A1
20160134915 Oran May 2016 A1
20160149978 Wissingh May 2016 A1
20160171184 Solis Jun 2016 A1
Foreign Referenced Citations (29)
Number Date Country
103873371 Jun 2014 CN
1720277 Jun 1967 DE
19620817 Nov 1997 DE
0295727 Dec 1988 EP
0757065 Jul 1996 EP
1077422 Feb 2001 EP
1383265 Jan 2004 EP
1384729 Jan 2004 EP
1473889 Nov 2004 EP
2120402 Nov 2009 EP
2120419 Nov 2009 EP
2120419 Nov 2009 EP
2124415 Nov 2009 EP
2214357 Aug 2010 EP
2299754 Mar 2011 EP
2323346 May 2011 EP
2552083 Jan 2013 EP
2214356 May 2016 EP
03005288 Jan 2003 WO
03042254 May 2003 WO
03049369 Jun 2003 WO
03091297 Nov 2003 WO
2007113180 Oct 2007 WO
2007122620 Nov 2007 WO
2007144388 Dec 2007 WO
2011049890 Apr 2011 WO
2012077073 Jun 2012 WO
2013123410 Aug 2013 WO
2015084327 Jun 2015 WO
Non-Patent Literature Citations (80)
Entry
Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9.
Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192.
Fall, K. et al., “DTN: an architectural retrospective”, Selected areas in communications, IEEE Journal on, vol. 28, No. 5, Jun. 1, 2008, pp. 828-835.
Gritter, M. et al., ‘An Architecture for content routing support in the Internet’, Proceedings of 3rd Usenix Symposium on Internet Technologies and Systems, 2001, pp. 37-48.
A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53.
A. Wolman, M. Voelker, N. Sharma N. Cardwell, A. Karlin, and H.M. Levy, “On the scale and performance of cooperative web proxy caching,” ACM SIGHOPS Operating Systems Review, vol. 33, No. 5, pp. 16-31, Dec. 1999.
B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36.
Bari, MdFaizul, et al. ‘A survey of naming and routing in information-centric networks.’ Communications Magazine, IEEE 50.12 (2012): 44-53.
Baugher, Mark et al., “Self-Verifying Names for Read-Only Named Data”, 2012 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Mar. 2012, pp. 274-279.
Cho, Jin-Hee, Ananthram Swami, and Ray Chen. “A survey on trust management for mobile ad hoc networks.” Communications Surveys & Tutorials, IEEE 13.4 (2011): 562-583.
Detti et al., “Supporting the Web with an information centric network that routes by name”, Aug. 2012, Computer Networks 56, pp. 3705-3702.
Dijkstra, Edsger W., and Carel S. Scholten. ‘Termination detection for diffusing computations.’ Information Processing Letters 11.1 (1980): 1-4.
Dijkstra, Edsger W., Wim HJ Feijen, and A—J M. Van Gasteren. “Derivation of a termination detection algorithm for distributed computations.” Control Flow and Data Flow: concepts of distributed programming. Springer Berlin Heidelberg, 1986. 507-512.
Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., & Shenker, S. {Aug. 2013). Less pain, most of the gain: Incrementally deployable ICN. In ACM SIGCOMM Computer Communication Review (vol. 43, No. 4, pp. 147-158). ACM.
G. Tyson, S. Kaune, S. Miles, Y. El-Khatib, A. Mauthe, and A. Taweel, “A trace-driven analysis of caching in content-centric networks,” in Proc. IEEE ICCCN 2012, Munich, Germany, Jul.-Aug. 2012, pp. 1-7.
G. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for fine-grained access control in cloud storage services,” in Proc. ACM CCS 2010, Chicago, IL, USA, Oct. 2010, pp. 735-737.
Herlich, Matthias et al., “Optimizing Energy Efficiency for Bulk Transfer Networks”, Apr. 13, 2010, pp. 1-3, retrieved for the Internet: URL:http://www.cs.uni-paderborn.de/fileadmin/informationik/ag-karl/publications/miscellaneous/optimizing.pdf (retrieved on Mar. 9, 2012).
Hoque et al., ‘NLSR: Named-data Link State Routing Protocol’, Aug. 12, 2013, ICN 2013, pp. 15-20.
I. Psaras, R.G. Clegg, R. Landa, W.K. Chai, and G. Pavlou, “Modelling and evaluation of CCN-caching trees,” in Proc. IFIP Networking 2011, Valencia, Spain, May 2011, pp. 78-91.
J. Bethencourt, A, Sahai, and B. Waters, ‘Ciphertext-policy attribute-based encryption,’ in Proc. IEEE Security & Privacy 2007, Berkeley, CA, USA, May 2007, pp. 321-334.
J. Hur, “Improving security and efficiency in attribute-based data sharing,” IEEE Trans. Knowledge Data Eng., vol. 25, No. 10, pp. 2271-2282, Oct. 2013.
Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843).
K. Liang, L. Fang, W. Susilo, and D.S. Wong, “A Ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security,” in Proc. INCoS 2013, Xian, China, Sep. 2013, pp. 552-559.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part I.” HVAC&R Research 11.1 (2005): 3-25.
Katipamula, Srinivas, and Michael R. Brambley. “Review article: methods for fault detection, diagnostics, and prognostics for building systemsa review, Part II.” HVAC&R Research 11.2 (2005): 169-187.
L. Zhou, V. Varadharajan, and M. Hitchens, “Achieving secure role-based access control on encrypted data in cloud storage,” IEEE Trans. Inf. Forensics Security, vol. 8, No. 12, pp. 1947-1960, Dec. 2013.
Lopez, Javier, et al. “Trust management systems for wireless sensor networks: Best practices.” Computer Communications 33.9 (2010): 1086-1093.
M. Blaze, G. Bleumer, and M. Strauss, ‘Divertible protocols and atomic prosy cryptography,’ in Proc. EUROCRYPT 1998, Espoo, Finland, May-Jun. 1998, pp. 127-144.
M. Green and G. Ateniese, “Identity-based proxy re-encryption,” in Proc. ACNS 2007, Zhuhai, China, Jun. 2007, pp. 288-306.
M. Ion, J. Zhang, and E.M. Schooler, “Toward content-centric privacy in ICN: Attribute-based encryption and routing,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 39-40.
M. Naor and B. Pinkas “Efficient trace and revoke schemes,” in Proc. FC 2000, Anguilla, British West Indies, Feb. 2000, pp. 1-20.
M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737.
Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221.
Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140.
Narasimhan, Sriram, and Lee Brownston. “HyDE—A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169.
Omar, Mawloud, Yacine Challal, and Abdelmadjid Bouabdallah. “Certification-based trust models in mobile ad hoc networks: A survey and taxonomy.” Journal of Network and Computer Applications 35.1 (2012): 268-286.
P. Mahadevan, E.Uzun, S. Sevilla, and J. Garcia-Luna-Aceves, “CCN-krs: A key resolution service for ccn,” in Proceedings of the 1st International Conference on Information-centric Networking, Ser. INC 14 New York, NY, USA: ACM, 2014, pp. 97-106. [Online]. Available: http://doi.acm.org/10.1145/2660129.2660154.
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
S. Jahid, P. Mittal, and N. Borisov, “EASiER: Encryption-based access control in social network with efficient revocation,” in Proc. ACM ASIACCS 2011, Hong Kong, China, Mar. 2011, pp. 411-415.
S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. FC 2010, Tenerife, Canary Islands, Spain, Jan. 2010, pp. 136-149.
S. Kumar et al. “Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking,” 2008, pp. 556-564.
S. Misra, R. Tourani, and N.E. Majd, “Secure content delivery in information-centric networks: Design, implementation, and analyses,” in Proc. ACM SIGCOMM ICN 2013, Hong Kong, China, Aug. 2013, pp. 73-78.
S. Yu, C. Wang, K. Ren, and W. Lou, “Achieving secure, scalable, and fine-grained data access control in cloud computing,” in Proc. IEEE INFOCOM 2010, San Diego, CA, USA, Mar. 2010, pp. 1-9.
S.J. Lee, M. Gerla, and C. Chiang, “On-demand Multicast Routing Protocol in Multihop Wireless Mobile Networks,” Mobile Networks and Applications, vol. 7, No. 6, 2002.
Shani, Guy, Joelle Pineau, and Robert Kaplow. “A survey of point-based POMDP solvers.” Autonomous Agents and Multi-Agent Systems 27.1 (2013): 1-51.
Shih, Eugene et al., ‘Wake on Wireless: An Event Driven Energy Saving Strategy for Battery Operated Devices’, Sep. 23, 2002, pp. 160-171.
Shneyderman, Alex et al., ‘Mobile VPN: Delivering Advanced Services in Next Generation Wireless Systems’, Jan. 1, 2003, pp. 3-29.
T. Koponen, M. Chawla, B.-G. Chun, A. Ermolinskiy, K.H. Kim, S. Shenker, and I. Stoica, ‘A data-oriented (and beyond) network architecture,’ ACM SIGCOMM Computer Communication Review, vol. 37, No. 4, pp. 181-192, Oct. 2007.
V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proc. ACM CCS 2006, Alexandria, VA, USA, Oct.-Nov. 2006, pp. 89-98.
V. Jacobson, D.K. Smetters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard, ‘Networking named content,’ in Proc. ACM CoNEXT 2009, Rome, Italy, Dec. 2009, pp. 1-12.
W.-G. Tzeng and Z.-J. Tzeng, “A public-key traitor tracing scheme with revocation using dynamic shares,” in Proc. PKC 2001, Cheju Island, Korea, Feb. 2001, pp. 207-224.
Wang, Jiangzhe et al.,“DMND: Collecting Data from Mobiles Using Named Data”, Vehicular Networking Conference, 2010 IEEE, pp. 49-56.
Xylomenos, George, et al. “A survey of information-centric networking research.” Communications Surveys & Tutorials, IEEE 16.2 (2014): 1024-1049.
Yi, Cheng, et al. ‘A case for stateful forwarding plane.’ Computer Communications 36.7 (2013): 779-791.
Yi, Cheng, et al. ‘Adaptive forwarding in named data networking.’ ACM SIGCOMM computer communication review 42.3 (2012): 62-67.
Zahariadis, Theodore, et al. “Trust management in wireless sensor networks.” European Transactions on Telecommunications 21.4 (2010): 386-395.
Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73.
D. Trossen and G. Parisis, “Designing and realizing and information-centric internet,” IEEE Communications Magazing, vol. 50, No. 7, pp. 60-67, Jul. 2012.
Gasti, Paolo et al., ‘DoS & DDoS in Named Data Networking’, 2013 22nd International Conference on Computer Communications and Networks (ICCCN), Aug. 2013, pp. 1-7.
J. Hur and D.K. Noh, “Attribute-based access control with efficient revocation in data outsourcing systers,” IEEE Trans. Parallel Distrib. Syst, vol. 22, No. 7, pp. 1214-1221, Jul. 2011.
Wetherall, David, “Active Network vision and reality: Lessons form a capsule-based system”, ACM Symposium on Operating Systems Principles, Dec. 1, 1999. pp. 64-79.
Kulkarni A.B. et al., “Implementation of a prototype active network”, IEEE, Open Architectures and Network Programming, Apr. 3, 1998, pp. 130-142.
Xie et al. “Collaborative Forwarding and Caching in Content Centric Networks”, Networking 2012.
Lui et al. (A TLV-Structured Data Naming Scheme for Content-Oriented Networking, pp. 5822-5827, International Workshop on the Network of the Future, Communications (ICC), 2012 IEEE International Conference on Jun. 10-15, 2012).
Peter Dely et al. “OpenFlow for Wireless Mesh Networks” Computer Communications and Networks, 2011 Proceedings of 20th International Conference on, IEEE, Jul. 31, 2011 (Jul. 31, 2011), pp. 1-6.
Garnepudi Parimala et al “Proactive, reactive and hybrid multicast routing protocols for Wireless Mesh Networks”, 2013 IEEE International Conference on Computational Intelligence and Computing Research, IEEE, Dec. 26, 2013, pp. 1-7.
Tiancheng Zhuang et al. “Managing Ad Hoc Networks of Smartphones”, International Journal of Information and Education Technology, Oct. 1, 2013.
Amadeo et al. “Design and Analysis of a Transport-Level Solution for Content-Centric VANETs”, University “Mediterranea” of Reggio Calabria, Jun. 15, 2013.
Marc Mosko: “CCNx 1.0 Protocol Introduction” Apr. 2, 2014 [Retrieved from the Internet Jun. 8, 2016] http://www.ccnx.org/pubs/hhg/1.1%20CCNx%201.0%20Protocol%20Introduction.pdf paragraphs [01.3], [002], [02.1], [0003].
Akash Baid et al: “Comparing alternative approaches for networking of named objects in the future Internet”, Computer Communications Workshops (Infocom Wkshps), 2012 IEEE Conference on, IEEE, Mar. 25, 2012, pp. 298-303, *Paragraph [002]* *figure1*.
Priya Mahadevan: “CCNx 1.0 Tutorial”, Mar. 16, 2014, pp. 1-11, Retrieved from the Internet: http://www.ccnx.org/pubs/hhg/1.2%20CCNx%201.0%20Tutorial.pdf [retrieved on Jun. 8, 2016] *paragraphs [003]-[006], [0011], [0013]* *figures 1,2*.
Marc Mosko et al “All-In-One Streams for Content Centric Networks”, May 24, 2015, retrieved from the Internet: http://www.ccnx.org/pubs/AllinOne.pdf [downloaded Jun. 9, 2016] *the whole document*.
Cesar Ghali et al. “Elements of Trust in Named-Data Networking”, Feb. 13, 2014 Retrieved from the internet Jun. 17, 2016 http://arxiv.org/pdf/1402.3332v5.pdf *p. 5, col. 1* *p. 2, col. 1-2* * Section 4.1; p. 4, col. 2* *Section 4.2; p. 4, col. 2*.
Priya Mahadevan et al. “CCN-KRS”, Proceedings of the 1st International Conference on Information-Centric Networking, Inc. '14, Sep. 24, 2014.
Flavio Roberto Santos Et al. “Funnel: Choking Polluters in BitTorrent File Sharing Communities”, IEEE Transactions on Network and Service Management, IEEE vol. 8, No. 4, Dec. 1, 2011.
Liu Wai-Xi et al: “Multisource Dissemination in content-centric networking”, 2013 Fourth International conference on the network of the future (NOF), IEEE, Oct. 23, 2013, pp. 1-5.
Marie-Jose Montpetit et al.: “Network coding meets information-centric networking”, Proceedings of the 1st ACM workshop on emerging Name-Oriented mobile networking design, architecture, algorithms, and applications, NOM '12, Jun. 11, 2012, pp. 31-36.
Asokan et al.: “Server-Supported Signatures”, Computer Security Esorics 96, Sep. 25, 1996, pp. 131-143, Section 3.
Mandl et al.: “A Fast FPGA Based Coprocessor Supporting Hard Real-Time Search”, New Frontiers of Information Technology, Proceedings of the 23rd Euromicro Conference Budapest, Sep. 1, 1997, pp. 499-506 *The Whole Document*.
Sun et al.: “Content-Based Route Lookup Using CAMs”, Global Communications Conference, IEEE, Dec. 3, 2012 *The Whole Document*.
Related Publications (1)
Number Date Country
20160203322 A1 Jul 2016 US