Content-based transport security

Abstract
A computer system can send a secure request over a named-data network to a remote device by generating an Interest with encrypted name components. During operation, the computer system can receive or obtain a request for data, such as from a local user or from a local application. If the system cannot satisfy the request locally, the system can determine at least a routable prefix and a name suffix associated with the request. The system can generate the secure Interest for the request by determining an encryption key that corresponds to a session with the remote computer system, and encrypts the name suffix using the session encryption key. The system then generates an Interest whose name includes the routable prefix and the encrypted name suffix, and disseminates the Interest over a named-data network to send the request to the remote computer system.
Description
RELATED APPLICATION

The subject matter of this application is related to the subject matter in a co-pending non-provisional application by the same inventors as the instant application and filed on the same day as the instant application entitled “CONTENT-BASED TRANSPORT SECURITY FOR DISTRIBUTED PRODUCERS,” having serial number TO BE ASSIGNED, and filing date TO BE ASSIGNED.


BACKGROUND

Field


This disclosure is generally related to establishing secure network connections. More specifically, this disclosure is related to generating and/or processing Interest and Content Object packets that include an encrypted name suffix.


Related Art


Advancements in computer networks and wireless technologies have made it easier for manufacturers to create Internet-enabled consumer devices. Some of these Internet-enabled devices come in the form of consumer appliances, such as digital thermostats, home-theater equipment, and home security systems. Manufacturers oftentimes provide software applications and/or online services that allow a user to remotely access or configure their devices. Also, many of these devices can auto-discover each other, and can stream data between each other to provide a unified experience for the user. One example is home-entertainment equipment, where a user's laptop or mobile computing device can detect the presence of a television or audio-video receiver (AVR) within a computer network, and can stream content to the television or AVR to present the content to a user.


These Internet-enabled consumer devices can communicate with an online service or with a peer consumer device by establishing a transmission control protocol (TCP) connection over an Internet-protocol (IP) network. Oftentimes, these consumer devices can establish a secure connection that encrypts the user's information by employing a transport layer security (TLS) protocol or a secure socket layer (SSL) protocol that encrypts data before transmitting the data over the IP network.


Unfortunately, the TLS and SSL protocols are specific to IP-based network protocols, and cannot be used to establish a secure connection on other types of computer networks. For example, smartphone and other mobile devices oftentimes switch between different networks within a single day, which makes it difficult to reach a given mobile device when its IP address has changed. To solve this problem, computer scientists are developing a content-centric network (CCN) architecture that allows a computer network to route packets based on the packet's name, and not based on a device's IP address. However, it is not possible to use the TLS or SSL protocol on a CCN network, given that the TLS and SSL protocols require using an IP address to establish the network connection.


SUMMARY

One embodiment provides a computer system that can send a secure request over a named-data network to a remote device by generating an Interest with encrypted name components. During operation, the computer system can receive or obtain a request for data or a service, such as from a local user or from a local application. If the system cannot satisfy the request locally, the system can determine at least a routable prefix and a name suffix associated with the request. The system can generate a secure Interest for the request by determining an encryption key that corresponds to a session with the remote computer system, and encrypts the name suffix using the session encryption key. The system then generates an Interest whose name includes the routable prefix and the encrypted name suffix, and disseminates the Interest over a named-data network to send the request to the remote computer system.


In some embodiments, the system can provide a temporary key to the remote computer system. To provide the temporary key, the system can send, to the remote computer system, a request for a digital certificate from the remote computer system. In response to the request, the system can receive a response that includes the remote computer system's digital certificate. The system then generates an encrypted packet that includes the temporary key, and that is encrypted using a public key from the digital certificate, and sends the encrypted packet to the remote computer system.


In some embodiments, the system can provide a public key of the local computer system to the remote computer system. To provide the public key, the system can send, to the remote computer system, a digital certificate or encoded public key object.


In some embodiments, determining the encryption key involves obtaining a symmetric session key from the remote computer system.


In some embodiments, while determining the encryption key, the system can generate a session key using a key-generating function that takes as input one or more of: a session identifier for the local client device's session with the computer system service; and a secret number that is secret to the local client device.


In some embodiments, the system can initiate the session with the remote computer system by providing a local public key to the remote computer system, and receiving an encrypted session-setup packet that includes at least a session identifier and a symmetric session key, and includes the remote computer system's certificate. The encrypted session-setup packet is encrypted using the local client device's public key, and can be signed according to the remote computer system's certificate. The system can decrypt the encrypted session-setup packet using a local private key to obtain the session identifier and the symmetric session key.


In some embodiments, the session-setup packet is encrypted using the local client device's public key.


In some embodiments, the system can initiate the session by signing the session identifier using the local client device's private key, and generating a resume-setup packet that includes the session identifier and a public key certificate of the local client device. The system also encrypts the resume-setup packet using the session key, and generates an Interest that includes the encrypted resume-setup packet. The system disseminates the Interest to provide the client-device authentication information to the remote computer system.


In some embodiments, the system can receiving a response Content Object that satisfies the Interest, and decrypts the Content Object using the symmetric session key.


In some embodiments, the system can generate a private-key and public-key pair for the local client device. The system can generate the Interest packet to include the client-device public key


In some embodiments, the system can receive a response Content Object that satisfies the Interest, and decrypts the Content Object using the client-device private key.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 illustrates an exemplary computer system that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy in accordance with an embodiment.



FIG. 2 illustrates exemplary communications between a client device and a content producer in accordance with an embodiment.



FIG. 3 presents a flow chart illustrating a method for initiating a session with a content producer at a client device in accordance with an embodiment.



FIG. 4A presents a flow chart illustrating a method for initiating a session with a client device at a content producer in accordance with an embodiment.



FIG. 4B presents a flow chart illustrating a method for authenticating a client device in accordance with an embodiment.



FIG. 5A presents a flow chart illustrating a method for using a producer-generated symmetric session key to generate and disseminate an Interest that includes an encrypted name in accordance with an embodiment.



FIG. 5B presents a flow chart illustrating a method for using the symmetric session key to process a Content Object that includes an encrypted name in accordance with an embodiment.



FIG. 6A presents a flow chart illustrating a method for using the symmetric session key at the content producer to process an Interest that includes an encrypted name in accordance with an embodiment.



FIG. 6B presents a flow chart illustrating a method for using the symmetric session key to generate and return a Content Object that includes an encrypted name in accordance with an embodiment.



FIG. 7A presents a flow chart illustrating a method performed by a content producer to use a producer-generated public key to generate and disseminate an Interest that includes an encrypted name in accordance with an embodiment.



FIG. 7B presents a flow chart illustrating a method for using a local private key to process a Content Object that includes an encrypted name in accordance with an embodiment.



FIG. 8 presents a flow chart illustrating a method for using a client-generated public key to generate a Content Object that satisfies an Interest with an encrypted name in accordance with an embodiment.



FIG. 9 illustrates an exemplary apparatus that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy in accordance with an embodiment.



FIG. 10 illustrates an exemplary computer system that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy 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 network devices that solve the problem of protecting a user's privacy by using Interest packets with encrypted names. For example, a client device can establish a session with a remote content producer over a named data network (NDN) to reach an agreement on the keys that each device can use to encrypt and decrypt an Interest's name or a Content Object's payload. Once the session is established, the client device can request a piece of data by encrypting a portion of the name that identifies the data being requested, and disseminating the Interest over the NDN. The Interest's name can include a beginning portion that indicates a routable prefix, which can be used by various network nodes of a named data network to determine how to forward the Interest toward the content producer.


Once the content producer receives the Interest, the content producer can use one of the established keys decrypt the portion of the name that's encrypted to determine the data or service requested by the Interest. In some embodiments, the content producer can obtain a session identifier from the Interest's name, and can use this session identifier to generate a session key on-the-fly. This allows the content producer to establish sessions with a plurality of client devices without having to store session keys. Also, if the content producer deploys a service across multiple server nodes, a session can span multiple server nodes without requiring the content producer to propagate a session's keys toward other server nodes.


The following terms describe elements of a named data network (NDN) architecture, such as a content-centric network (CCN):


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.


Name: A name in an NDN is typically location independent and uniquely identifies a Content Object. A data-forwarding device can use the name or name prefix to forward an Interest 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 a non-hierarchical 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 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 NDN system can include a content-centric networking (CCN) architecture. However, the methods disclosed herein are also applicable to other NDN or other information-centric network (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.



FIG. 1 illustrates an exemplary computer system 100 that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy in accordance with an embodiment. Computing environment 100 can include a named-data network 102 (or any information-centric network now known or later developed), which can include a plurality of routing nodes or network nodes that can forward an Interest packet based on the name of the content being requested by the Interest packet, toward a content producer that can satisfy the Interest.


Computing environment 100 can also include a client device 104, which can include any computing device that can disseminate Interests and receive Content Objects via NDN 102. For example, client device 104 can include a smartphone 104.1, a tablet computer 104.2, and/or a personal computing device 104.m (e.g., a laptop). Specifically, client device 104 can disseminate an Interest that includes an encrypted suffix to protect the privacy of a local user 106.


In some embodiments, computing environment 100 can include a content producer 108 that can host data or services for one or more client devices. For example, content producer 108 can include s set of computing devices 110.1-110.n that each can receive and process Interests for one or more client devices. When a computing device 110 of content producer 108 receives an Interest from client device 104, computing device 110 can generate or retrieve a session key to decrypt the Interest's name. Once computing device 110 has processed the Interest to obtain or generate a Content Object to return to client device 104, computing device 110 uses the session key (or a key provided by client device 104) to encrypt the Content Object before returning the Content Object.



FIG. 2 illustrates exemplary communications 200 between a client device 202 and a content producer 204 in accordance with an embodiment. During operation, client device 202 can initiate a session with content producer 204 by disseminating an Interest with a serialized_encoded_setup message 212, which includes a temporary key. When content producer 204 receives the Interest, content producer 204 can generate a session key and a session identifier, and returns them to client device 202 in a Content Object that includes a serialized_server_setup message 214.


Content producer 204 can also include an authentication request in serialized_server_setup message 214. In response to receiving the authentication request, client device 202 generates a serialized_resume_setup message 216, which includes any information that content producer 204 can use to authenticate client device 202. After authenticating client device 202, content producer 204 can return a Content Object with a server_confirmation message 218 that informs client device 202 that the session has been established.


Once the session is established, client device 202 and content producer 204 have reached an agreement on the keys that each device can use to encrypt and decrypt the name suffix from each other's Interests, and/or to encrypt the payload in a Content Object. Client device 202 can then proceed to disseminate Interests to request data or services from content producer 204, such that the Interests include an encrypted name. Also, content producer 204 can satisfy an Interest by returning a Content Object whose payload is encrypted for client device 202.


Note that a Content Object can include a name for the payload's contents, a metadata block, a signature block, and a payload that includes a piece of data. In some embodiments, content producer 204 can return the information needed to establish or maintain a session within the metadata of a Content Object. For example, content producer 204 can create a Content Object so that the metadata indicates a digital certificate associated with the Content Object's payload. The Content Object's metadata can include the bytes of the digital certificate, or can include a key locator that can be used to retrieve the digital certificate from a trusted entity. This behavior is not possible using typical Internet protocol (IP) sessions, such as over a transport layer security (TLS) protocol or a secure socket layer (SSL) protocol that requires exchanging digital certificates as packet payload data over several iterations.


Initiating a Session



FIG. 3 presents a flow chart illustrating a method 300 for initiating a session with a content producer at a client device in accordance with an embodiment. During operation, the client device can generate an encoded_setup message that includes a temporary key (e.g., a symmetric key, or a public key) (operation 302), and generates an Interest that includes the encoded_setup message as an encrypted message. For example, the client device can first send an unencrypted request to the content producer, which requests for the producer's digital certificate. The producer responds to the request by sending its digital certificate to the client device, such as via a Content Object of type “Certificate.” If the client device accepts the certificate, the client device obtains the producer's public key from the certificate. The client device then generates the encoded_setup message that includes the temporary key, encrypts the encoded_setup message using the server's public key, and sends the encrypted encoded_setup message (e.g., the encrypted temporary key) to the producer.


In some embodiments, the client device can marshal the encoded_setup message to generate a character stream that includes the encoded_setup message, and appends the marshalled character stream to the Interest's name. The Interest's name can have the form:

/routable_prefix/setup/serialized_encoded_setup  (1)

In expression (1), the name component “/routable_prefix” can include a name prefix or domain associated with the content producer. The name component “setup” indicates a control value, which notifies the content producer that the client device is setting up a session with the content producer. In some embodiments, the encoded_setup message can also include a random number N1 (e.g., a nonce) to ensure the Interest has a unique name so that routing nodes of a named data network don't use a cached object to satisfy the Interest. This allows the Interest to reach the content producer to which the client device desires to initiate a session.


The client device then disseminates the Interest over a named-data network to send the encoded_setup message to the content producer (operation 304). After the content producer processes the Interest, the client device receives a Content Object from the content producer that includes a serialized_server_setup packet (operation 306). The client device can decrypt the serialized_server_setup packet using the temporary key (or a private key that complements a temporary public key), and obtains at least a session identifier and a session key (operation 308). In some embodiments, the serialized_server_setup packet can also include the random number N1, and another random number N2.


Also, in some embodiments, the serialized_server_setup packet can include a message that indicates the handshake is complete, or can include an authentication request for authenticating the client device. Hence, the client device determines whether the serialized_server_setup packet includes an authentication request (operation 310). If the serialized_server_setup packet includes the message stating that the handshake is complete, the session is established between the client device and the content producer, and the client device can proceed to disseminate encrypted Interests for the content producer.


Otherwise, the client device generates a serialized_resume_setup packet that includes the session identifier and a public key certificate for the client device (operation 312), and encrypts the serialized_resume_setup packet using the session key provided by the content producer. The client device generates an Interest that includes the encrypted serialized_resume_setup packet, for example, so that the Interest's name has the form:

/routable_prefix/session_id/serialized_resume_setup  (2)


In expression (2), the name component “setup” includes the session identifier as the control value that the content producer uses to determine how to process the Interest. The serialized_resume_setup packet can include the session identifier, signed with the client's private key. The serialized_resume_setup packet can also include other information that can be used to authenticate the client device, such as the client's public key certificate, and can also include the certificate change.


The client device then disseminates the Interest over a named-data network to send the serialized_resume_setup packet to the content producer (operation 314). The content producer uses the serialized_resume_setup packet to authenticate the client device, and returns a Content Object that specifies the outcome of the authentication. The client device receives the Content Object (operation 316), which either confirms that the session is established, or notifies that the client device could not be authenticated.



FIG. 4A presents a flow chart illustrating a method 400 for initiating a session with a client device at a content producer in accordance with an embodiment. During operation, the content producer receives an Interest that includes the encoded_setup message (operation 402), and obtains a temporary key from the encoded_setup message (operation 404). The content producer then generates a session identifier for a session with the client device, and generates a session key for the session (operation 406).


In some embodiments, the content producer can generate the session key based on the session identifier and a secret. For example, during the session, the client device may disseminate various Interests that request different data or different services from the content producer. However, these Interests may not all arrive at the same server of the content producer that initiated the session with the client device. Also, the content producer may have a plurality of sessions with various client devices, which makes it undesirable to store session keys for all active session. In some embodiments, the server that receives the Interest can generate the session key on-the-fly using the session identifier from the Interest's name, and using the secret that is common across all servers of the content producer.


The content producer then generates a serialized_server_setup packet that includes the session identifier and the session key, and is encrypted using the client device's temporary key (operation 408), and generates a Content Object that includes the encrypted serialized_server_setup packet. The content producer then returns the Content Object to satisfy the client device's Interest (operation 410).


In some embodiments, the content producer can either finish the session-initiating handshake, or can request additional information from the client device to authenticate the client device. For example, if the content producer does not need to authenticate the client device, the content producer can generate the serialized_server_setup packet to include a message that indicates the handshake is complete. On the other hand, if the content producer needs to authenticate the client device, the content producer generates the serialized_server_setup packet to include an authentication request for authenticating the client device. The client device responds to the authentication request by disseminating an Interest that includes a serialized_resume_setup packet for the content producer.



FIG. 4B presents a flow chart illustrating a method 450 for authenticating a client device in accordance with an embodiment. During operation, the content producer can receive, from the client device, an Interest that includes an encrypted serialized_resume_setup message (operation 452). The content producer then decrypts the serialized_resume_setup message using the session key (operation 454), and obtains a session identifier and/or a public key certificate for the client device (operation 456).


The content producer can authenticate the client device using the signed session identifier, or using the public key certificate (operation 458). For example, recall that the signed session identifier is signed using the client device's private key. The content producer can process the session identifier using the client device's public key to obtain the plaintext session identifier. Alternatively, the content producer can analyze the public key certificate and/or the certificate chain to authenticate the client device.


The content producer then determines whether client authentication was successful (operation 460). If so, the content producer proceeds to return a Content Object that confirms that the session is active (operation 462). Otherwise, if the content producer could not authenticate the client device, the content producer returns a Content Object that includes a message notifying that the authentication was not successful and/or that the session is not active (operation 464).


Using Producer-Generated Symmetric Session Keys



FIG. 5A presents a flow chart illustrating a method 500 for using a producer-generated symmetric session key to generate and disseminate an Interest that includes an encrypted name in accordance with an embodiment. During operation, the client device can obtain or determine a request to send to the content producer (operation 502). For example, an application running on the client device can generate a request to obtain data for the local user, such that the request includes a name for the data. The name can have the form:

/routable_prefix/session_id/plaintext_suffix  (3)

Alternatively, the application can provide the routable prefix and the plaintext suffix, which the client device can use this information to generate a secure name.


The client device then obtains the components that need to be combined into the Interest's name, which can include the routable prefix, the plaintext suffix, and a session identifier associated with the content producer (operation 504). The client device can determine the session identifier, for example, by performing a lookup operation in a table based on the routable prefix. If a matching entry does not exist, the client device can proceed to initiate or re-establish the session. To generate a secure Interest name, the client device determines a session key that corresponds to the session with the content producer (operation 506), and encrypts the plaintext suffix using the session key (operation 508). The client device can then generate the Interest so that the Interest's name includes the routable prefix and the encrypted name suffix (operation 510). For example, the Interest's name can have the form:

/routable_prefix/session_id/encrypted_suffix  (4)

The client device can disseminate the Interest over a named-data network to obtain the desired content from the content producer (operation 512).


Once the content producer receives the Interest, the content producer can use the session key to decrypt the Interest's encrypted suffix, and can return a Content Object that satisfies the Interest. Note that the Content Object's name also includes the name (4) with the encrypted suffix, and includes a payload encrypted using the session key. The client device can process the Content Object using the session key.



FIG. 5B presents a flow chart illustrating a method 550 for using the symmetric session key to process a Content Object that includes an encrypted name in accordance with an embodiment. Specifically, the client device can receive a Content Object that satisfies an Interest that was disseminated by the client device (operation 552). When the client device receives the Content Object, the client device can use the Content Object's encrypted name to determine which application generated the initial request for the Interest. The client device can also decrypt the Content Object's payload by obtaining a session identifier from the Content Object's name (operation 554), and using the session identifier to determine a session key that corresponds to the Content Object (operation 556). The client device decrypts the Content Object's payload using the session key (operation 558).


In some embodiments, the client device can also use the session key to regenerate the Content Object's plaintext name. For example, the client device can use the session key to decrypt the encrypted suffix, and replaces the encrypted suffix in the Content Object's name with the plaintext suffix. The Content Object's plaintext name has the form presented in expression (3).



FIG. 6A presents a flow chart illustrating a method 600 for using the symmetric session key at the content producer to process an Interest that includes an encrypted name in accordance with an embodiment. During operation, the content producer can receive an Interest that includes a name with an encrypted suffix (operation 602). The Interest's name can include a name having the form presented in expression (4), which includes a routable prefix, a session identifier, and an encrypted name suffix.


Recall that the content producer may maintain active sessions for a plurality of users, whose requests may arrive at any of the content producer's various server computers. This makes it inefficient to have each server computer store the set of possible session keys for all active user sessions. In some embodiments, the content producer's severs can generate the session key on-the-fly based on the Interest's session identifier. The content producer determines a session identifier from the Interest's name (operation 604), and generates a symmetric key based on the session identifier and a secret value (operation 606). For example, the content producer can use a function:

session_key=ƒ(session_id,secret)  (5)


In expression (5), function ƒ( ) can include any function that generates a cryptographic key, such as a hash function. The secret can include any number or character sequence that is common to one or more devices associated with the content producer. This way, any of the content producer's devices can obtain a session key for any active session without having to store a session key. The secret can be persistent over a period of time (e.g., a month, a year, etc.), and can be used across various sessions with a plurality of client devices.


The content producer then decrypts the encrypted suffix using the session key to obtain a plaintext suffix (operation 608), and can also generate a plaintext name for the Interest by replacing the encrypted suffix with the plaintext suffix (operation 610). The plaintext name can have the form of expression (3). The content producer can process the Interest using the plaintext suffix, or using the plaintext name (operation 612).


For example, the content producer can perform a lookup operation in a local FIB using the plaintext name to determine a local application that can retrieve or generate a Content Object that satisfies the Interest. Alternatively or additionally, the content producer or a local application can use the plaintext suffix to determine the data or service being requested by the client device. Once the content producer or a local application has retrieved or generated a piece of data requested by the Interest, the content producer can generate and return a Content Object to satisfy the Interest.



FIG. 6B presents a flow chart illustrating a method for using the symmetric session key to generate and return a Content Object that includes an encrypted name in accordance with an embodiment. During operation, the content producer can process the Interest using the Interest's plaintext name or plaintext prefix to obtain or generate a piece of data that corresponds to the Interest's name (operation 652). The content producer then encrypts the piece of data using the session key that corresponds to the user session (operation 654), and generates a Content Object that includes the Interest's name and includes the encrypted piece of data (operation 656).


Note that the Content Object's name includes the name from the Interest, which includes the encrypted suffix and has a form presented under expression (4). This allows routing nodes along a path traversed by the Interest to use the Content Object's name to find a matching entry in a local PIT, and to return the Content Object via an interface specified by the matching PIT entry. The content producer then returns the Content Object to satisfy the Interest (operation 658).


Using Runtime-Generated Client Keys



FIG. 7A presents a flow chart illustrating a method 700 performed by a content producer to use a producer-generated public key to generate and disseminate an Interest that includes an encrypted name in accordance with an embodiment. During operation, the client device can obtain or determine a request to send to the content producer (operation 702), and generates or determines a routable prefix, a session identifier, and a plaintext suffix for the request (operation 704). The client device also determines an encryption key to provide to the content producer (operation 706), which the content producer can use to encrypt a Content Object's payload before returning the Content Object to satisfy the client device's Interest. In some embodiments, the client device may store the encryption key for the session, and provides the encryption key to the content producer within each Interest.


In some other embodiments, the client device does not store keys for active sessions. Rather, the client device can generate the keys at runtime as necessary. For example, the client device can generate a session key using a function:

session_key=ƒsession(session_id,secret)  (6)

If the client device is configured to use a public/private key pair, the client device can generate the public key using a function:

public_key=ƒpublic(session_id,secret)  (7)

Once the client device receives a Content Object from the content producer, the client device can use another hash function to generate the corresponding private key to decrypt the Content Object's payload:

private_key=ƒprivate(session_id,secret)  (8)

The functions ƒsession, ƒpublic, and ƒprivate can include any function that generates a cryptographic key, such as a hash function.


To generate a secure Interest, the client device determines a public key that was received from the content producer (operation 708), and uses the content producer's public key to encrypt the plaintext suffix as well as the client device's encryption key (e.g., a symmetric session key or a public key) (operation 710). The client device can generate the Interest so that the Interest's name includes the routable prefix and the encrypted name suffix (operation 712). For example, the Interest's name can have the form:

/routable_prefix/session_id/encrypted_suffix  (9)

The client device can disseminate the Interest over a named-data network to obtain the desired content from the content producer (operation 714). Once the content producer receives the Interest, the content producer can use a local private key to decrypt the Interest's encrypted suffix, and uses the key it obtains from the Interest to encrypt a Content Object for the client device.



FIG. 7B presents a flow chart illustrating a method 750 for using a local private key to process a Content Object that includes an encrypted name in accordance with an embodiment. Specifically, the client device can receive a Content Object that satisfies an Interest that was disseminated by the client device (operation 752). The client device can use the Content Object's encrypted name to determine which application generated the initial request for the Interest. The client device can also decrypt the Content Object's payload by obtaining a session identifier from the Content Object's name (operation 754), and using the session identifier to determine a decryption key (e.g., a private key or a symmetric session key) that corresponds to the Content Object (operation 756). The client device decrypts the Content Object's payload using the session key (operation 758).


In some embodiments, during operation 756, the client device can obtain a stored decryption key that corresponds to the session identifier. Alternatively, the client device can use a hash function to generate the decryption key when necessary at runtime. For example, the client device can use a function ƒsession to generate a symmetric session key based on the session identifier, as presented under expression (6). If the client device is using a public/private key pair, the client device can use a function ƒprivate to generate the private key based on the session identifier and a secret as presented in expression (8). The secret value can be persistent over a period of time, and can be used across various sessions with one or more content producers. For example, the client device can generate a new secret value each time the computer is turned on. Alternatively, the client device can generate a secret value for each active interface, for example, as a part of a setup procedure that initializes or activates the interface.



FIG. 8 presents a flow chart illustrating a method 800 performed by a content producer to use a client-generated public key to generate a Content Object that satisfies an Interest with an encrypted name in accordance with an embodiment. During operation, the content producer can receive an Interest whose name includes an encrypted suffix (operation 802). To process the Interest, the content producer obtains a private key (operation 804), and decrypts the encrypted suffix using the local private key to obtain a plaintext name suffix as well as an encryption key from the client device (operation 806). This encryption key may include, for example, a symmetric session key, or an asymmetric public key.


In some embodiments, the content producer can generate a plaintext name by replacing the encrypted suffix with the plaintext suffix (operation 808), and processes the Interest using the plaintext name to obtain or generate a piece of data (operation 810). Alternatively, the content producer does not need to generate the plaintext name to process the Interest. For example, the content producer may obtain or generate the piece of data based on the plaintext suffix (without generating the full plaintext name).


The content producer then encrypts the piece of data using the encryption key that it obtained from the Interest's encrypted suffix (operation 812), and generates a Content Object that includes the Interest's name and includes the encrypted piece of data (operation 814). The Content Object's name includes the name from the Interest that includes the encrypted suffix, which allows routing nodes along a path traversed by the Interest to use the Content Object's name to find a matching entry in a local PIT. The content producer then returns the Content Object to satisfy the Interest (operation 816).



FIG. 9 illustrates an exemplary apparatus 900 that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy in accordance with an embodiment. Apparatus 900 can comprise a plurality of modules which may communicate with one another via a wired or wireless communication channel. Apparatus 900 may be realized using one or more integrated circuits, and may include fewer or more modules than those shown in FIG. 9. Further, apparatus 900 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 900 can comprise a communication mechanism 902, a session-managing mechanism 904, a request-processing mechanism 906, a cryptography mechanism 908, an Interest-processing mechanism 910, and a Content Object processing mechanism 912.


In some embodiments, communication mechanism 902 can send and/or receive Interests and Content Objects over a named-data network (NDN), such as a content centric network (CCN). Session-managing mechanism 904 can establish a session with a remote device over the NDN or CCN. Request-processing mechanism 906 can obtain a request for data from a local user or application, and determines whether the request can be satisfied locally, or needs to be disseminated across an NDN or CCN. Cryptography mechanism 908 can determine an encryption key that corresponds to a session with a remote computer system, and encrypts the name suffix associated with the request using the session encryption key.


Interest-processing mechanism 910 can generate or process an incoming Interest an Interest whose name includes a routable prefix to the remote computer system, and includes the encrypted suffix. Content Object processing mechanism 912 can generate a Content Object or process an incoming Content Object that includes an encrypted suffix, and includes an encrypted payload.



FIG. 10 illustrates an exemplary computer system 1002 that facilitates using Interest and Content Objects with encrypted names to protect a user's privacy in accordance with an embodiment. Computer system 1002 includes a processor 1004, a memory 1006, and a storage device 1008. Memory 1006 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 1002 can be coupled to a display device 1010, a keyboard 1012, and a pointing device 1014. Storage device 1008 can store operating system 1016, transport-security system 1018, and data 1032.


Transport-security system 1018 can include instructions, which when executed by computer system 1002, can cause computer system 1002 to perform methods and/or processes described in this disclosure. Specifically, transport-security system 1018 may include instructions for sending and/or receiving Interests and Content Objects over a named-data network (NDN), such as a content centric network (CCN) (communication mechanism 1020). Further, transport-security system 1018 can include instructions for establishing a session with a remote device over the NDN or CCN (session-managing mechanism 1022). Transport-security system 1018 can also include instructions for obtaining a request for data from a local user or application, and determining whether the request can be satisfied locally, or needs to be disseminated across an NDN or CCN (request-processing mechanism 1024).


Transport-security system 1018 may also include instructions for determining an encryption key that corresponds to a session with a remote computer system, and encrypting the name suffix associated with the request using the session encryption key (cryptography mechanism 1026). Further, transport-security system 1018 can include instructions for generating an Interest or processing an incoming Interest whose name includes a routable prefix to the remote computer system, and includes the encrypted suffix (Interest-processing mechanism 1028). Transport-security system 1018 can also include instructions for generating a Content Object or processing an incoming Content Object that includes an encrypted suffix, and includes an encrypted payload (Content Object processing mechanism 1030).


Data 1032 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 1032 can store at least session identifiers for one or more active sessions, cryptographic keys (e.g., a session key, or a public/private key pair) for one or more active sessions, and/or a secret value that facilitates generating cryptographic keys for one or more active sessions.


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 for sending an encrypted request to a remote computer system over a named-data network, the method comprising: determining, by a client computing device, a request for data or a service from the remote computer system comprising a plurality of distributed servers;determining at least a routable prefix for the remote computer system, and a name suffix associated with the request;as part of initiating a session with the remote computer device, at the client device, determining a session encryption key that corresponds to the session, the determining the session encryption key including: encrypting a temporary key of the client device with a public key, and sending to the remote computer system a session setup message including the encrypted temporary key;receiving from the remote computer system a server setup packet encrypted using the temporary key, the server setup packet including a session identifier for the session and the session encryption key; anddecrypting the server setup packet using the temporary key to recover the session identifier and the session encryption key;encrypting the name suffix using the session encryption key;generating an Interest comprising a first name that includes the routable prefix unencrypted, and also includes the Content Object name suffix which is encrypted using the session encryption key;disseminating the Interest, by the client computing device over a named-data network, to send the request to any distributed server of the remote computer system;in response to the Interest, receiving a Content Object that satisfies the Interest, wherein the Content Object comprises a second name that includes the routable prefix unencrypted and also includes the Content Object name suffix which is encrypted using the session encryption key, wherein a payload of the Content Object is encrypted using the session encryption key; anddecrypting the Content Object name suffix using the session encryption key.
  • 2. The method of claim 1, further comprising: sending, to the remote computer system, a request for a digital certificate from the remote computer system;receiving a response that includes the remote computer system's digital certificate with the public key;wherein the generating the session setup message includes generating the session setup message using the public key.
  • 3. The method of claim 1, further comprising providing a public key of the client device to the remote computer system, wherein providing the public key involves: sending, to the remote computer system, a digital certificate or encoded public key object.
  • 4. The method of claim 1, wherein determining the session encryption key involves obtaining a symmetric session key from the remote computer system.
  • 5. The method of claim 1, wherein determining the session encryption key involves generating the session encryption key using a key-generating function that takes as input one or more of: the session identifier; anda secret number that is secret to the remote computer system.
  • 6. The method of claim 1, wherein the server setup packet includes the remote computer system's certificate and is signed according to the remote computer system's certificate.
  • 7. The method of claim 6, wherein initiating the session further involves: signing the session identifier using the client device's private key;generating a resume-setup packet that includes the session identifier and a public key certificate of the client device;encrypting the resume-setup packet using the session encryption key;generating an Interest, for the remote computer system, that includes the encrypted resume-setup packet; anddisseminating the Interest to provide the client device authentication information to the remote computer system.
  • 8. The method of claim 1, further comprising: decrypting the Content Object using a temporary symmetric key from the client device.
  • 9. The method of claim 1, further comprising generating a private-key and public-key pair for the client device; wherein generating the Interest involves generating the Interest packet to include the client device public key.
  • 10. The method of claim 9, further comprising: decrypting the Content Object using the client device private key.
  • 11. The method of claim 1, wherein the determining the session encryption key further includes, at the client device: requesting, and then receiving, the public key from the remote computer system.
  • 12. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for sending an encrypted request to a remote computer system over a named-data network, the method comprising: determining a request for data or a service from the remote computer system comprising a plurality of distributed servers;determining at least a routable prefix for the remote computer system, and a name suffix associated with the request;as part of initiating a session with the remote computer device, at the client device, determining the session encryption key that corresponds to the session, the determining the session encryption key including: encrypting a temporary key of the client device with a public key, and sending to the remote computer system a session setup message including the encrypted temporary key;receiving from the remote computer system a server setup packet encrypted using the temporary key, the server setup packet including a session identifier for the session and the session encryption key; anddecrypting the server setup packet using the temporary key to recover the session identifier and the session encryption key;encrypting the name suffix using the session encryption key;generating an Interest comprising a first name that includes the routable prefix unencrypted and also includes the Content Object name suffix which is encrypted using the session encryption key; anddisseminating the Interest over a named-data network to send the request to any distributed server of the remote computer system;in response to the Interest, receiving a Content Object that satisfies the Interest, wherein the Content Object comprises a second name that includes the routable prefix unencrypted and also includes the Content Object name suffix which is encrypted using the session encryption key, wherein a payload of the Content Object is encrypted using the session encryption key; anddecrypting the Content Object name suffix using the session encryption key.
  • 13. The storage medium of claim 12, wherein the method further comprises: sending, to the remote computer system, a request for a digital certificate from the remote computer system;receiving a response that includes the remote computer system's digital certificate with the public key;wherein the generating the session setup message includes generating the session setup message using the public key.
  • 14. The storage medium of claim 12, wherein the method further comprises providing a public key of the client device to the remote computer system, wherein providing the public key involves: sending, to the remote computer system, a digital certificate or encoded public key object.
  • 15. The storage medium of claim 14, wherein the server setup packet includes the remote computer system's certificate and is signed according to the remote computer system's certificate.
  • 16. The storage medium of claim 15, wherein initiating the session further involves: signing the session identifier using the client device's public key;generating a resume-setup packet that includes the session identifier and a public key certificate of the client device;encrypting the resume-setup packet using the session encryption key;generating an Interest, for the remote computer system, that includes the encrypted resume-setup packet; anddisseminating the Interest to provide the client device authentication information to the remote computer system.
  • 17. The storage medium of claim 12, wherein determining the session encryption key involves generating the session encryption key using a key-generating function that takes as input one or more of: the session identifier; anda secret number that is secret to the remote computer system.
  • 18. The storage medium of claim 12, further comprising generating a private-key and public-key pair for the client device; wherein generating the Interest involves generating the Interest packet to include the client device public key.
  • 19. The storage medium of claim 18, wherein the method further comprises: decrypting the Content Object using the client device private key.
  • 20. An apparatus, comprising: a processor;a memory storing instructions that when executed by the processor cause the apparatus to implement:determining, by a client computing device, a request for data or a service from the remote computer system comprising a plurality of distributed servers;determining at least a routable prefix for the remote computer system, and a name suffix associated with the request;as part of initiating a session with the remote computer device, at the client device, determining a session encryption key that corresponds to the session, the determining the session encryption key including: encrypting a temporary key of the client device with a public key, and sending to the remote computer system a session setup message including the encrypted temporary key;receiving from the remote computer system a server setup packet encrypted using the temporary key, the server setup packet including a session identifier for the session and the session encryption key; anddecrypting the server setup packet using the temporary key to recover the session identifier and the session encryption key;encrypting the name suffix using the session encryption key;generating an Interest comprising a first name that includes the routable prefix unencrypted, and also includes the Content Object name suffix which is encrypted using the session encryption key;disseminating the Interest, by the client computing device over a named-data network, to send the request to any distributed server of the remote computer system;in response to the Interest, receiving a Content Object that satisfies the Interest, wherein the Content Object comprises a second name that includes the routable prefix unencrypted and also includes the Content Object name suffix which is encrypted using the session encryption key, wherein a payload of the Content Object is encrypted using the session encryption key; anddecrypting the Content Object name suffix using the session encryption key.
  • 21. The apparatus of claim 20, wherein the memory stores further instructions that when executed by the processor cause the apparatus to implement: sending, to the remote computer system, a request for a digital certificate from the remote computer system;receiving a response that includes the remote computer system's digital certificate with the public key;wherein the generating the session setup message includes generating the session setup message using the public key.
  • 22. The apparatus of claim 20, wherein: the server setup packet includes the remote computer system's certificate and is signed according to the remote computer system's certificate.
US Referenced Citations (584)
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
20080031459 Voltz Feb 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 Lovanna 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
20140237095 Petker 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
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
20160171184 Solis Jun 2016 A1
Foreign Referenced Citations (27)
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
2214356 May 2016 EP
03005288 Jan 2003 WO
03042254 May 2003 WO
03049369 Jun 2003 WO
03091297 Nov 2003 WO
2007113180 Oct 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 (165)
Entry
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.
“CCNx,” http://ccnx.org/. downloaded Mar. 11, 2015.
“Content Delivery Network”, Wikipedia, Dec. 10, 2011, http://en.wikipedia.org/w/index.php?title=Content_delivery_network&oldid=465077460.
“Digital Signature” archived on Aug. 31, 2009 at http://web.archive.org/web/20090831170721/http://en.wikipedia.org/wiki/Digital_signature.
“Introducing JSON,” http://www.json.org/. downloaded Mar. 11, 2015.
“Microsoft PlayReady,” http://www.microsoft.com/playready/.downloaded Mar. 11, 2015.
“Pursuing a pub/sub internet (PURSUIT),” http://www.fp7-pursuit.ew/PursuitWeb/. downloaded Mar. 11, 2015.
“The FP7 4WARD project,” http://www.4ward-project.eu/. downloaded Mar. 11, 2015.
A. Broder and A. Karlin, “Multilevel Adaptive Hashing”, Jan. 1990, pp. 43-53.
Detti, Andrea, et al. “CONET: a content centric inter-networking architecture.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
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.
Afanasyev, Alexander, et al. “Interest flooding attack and countermeasures in Named Data Networking.” IFIP Networking Conference, 2013. IEEE, 2013.
Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, and Fabian E. Bustamante. Drafting Behind Akamai: Inferring Network Conditions Based on CDN Redirections. IEEE/ACM Transactions on Networking {Feb. 2009).
B. Ahlgren et al., ‘A Survey of Information-centric Networking’ IEEE Commun. Magazine, Jul. 2012, pp. 26-36.
B. Lynn. The Pairing-Based Cryptography Library, http://crypto.stanford.edu/pbc/.
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.
Brambley, Michael, A novel, low-cost, reduced-sensor approach for providing smart remote monitoring and diagnostics for packaged air conditioners and heat pumps. Pacific Northwest National Laboratory, 2009.
C. Gentry and A. Silverberg. Hierarchical ID-Based Cryptography. Advances in Cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg (2002).
C.A. Wood and E. Uzun, “Flexible end-to-end content security in CCN,” in Proc. IEEE CCNC 2014, Las Vegas, CA, USA, Jan. 2014.
Carzaniga, Antonio, Matthew J. Rutherford, and Alexander L. Wolf. ‘A routing scheme for content-based networking.’ INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies. vol. 2. IEEE, 2004.
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.
Compagno, Alberto, et al. “Poseidon: Mitigating interest flooding DDoS attacks in named data networking.” Local Computer Networks (LCN), 2013 IEEE 38th Conference on. IEEE, 2013.
Conner, William, et al. “A trust management framework for service-oriented environments.” Proceedings of the 18th international conference on World wide web. ACM, 2009.
Content Centric Networking Project (CCN) [online], http://ccnx.org/releases/latest/doc/technical/, Downloaded Mar. 9, 2015.
Content Mediator Architecture for Content-aware Networks (COMET) Project [online], http://www.comet-project.org/, Downloaded Mar. 9, 2015.
D. Boneh, C. Gentry, and B. Waters, ‘Collusion resistant broadcast encryption with short ciphertexts and private keys,’ in Proc. CRYPTO 2005, Santa Barbara, CA, USA, Aug. 2005, pp. 1-19.
D. Boneh and M. Franklin. Identity-Based Encryption from the Weil Pairing. Advances in Cryptology—CRYPTO 2001, vol. 2139, Springer Berlin Heidelberg (2001).
D.K. Smetters, P. Golle, and J.D. Thornton, “CCNx access control specifications,” PARC, Tech. Rep., Jul. 2010.
Dabirmoghaddam, Ali, Maziar Mirzazad Barijough, and J. J. Garcia-Luna-Aceves. ‘Understanding optimal caching and opportunistic caching at the edge of information-centric networks.’ Proceedings of the 1st international conference on Information-centric networking. ACM, 2014.
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.
E. Rescorla and N. Modadugu, “Datagram transport layer security,” IETF RFC 4347, Apr. 2006.
E.W. Dijkstra, W. Feijen, and A.J.M. Van Gasteren, “Derivation of a Termination Detection Algorithm for Distributed Computations,” Information Processing Letter, vol. 16, No. 5, 1983.
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. Ateniese, K. Fu, M. Green, and S. Hohenberger. Improved Proxy Reencryption Schemes with Applications to Secure Distributed Storage. In the 12th Annual Network and Distributed System Security Symposium (2005).
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.
G. Xylomenos et al., “A Survey of Information-centric Networking Research,” IEEE Communication Surveys and Tutorials, Jul. 2013.
Garcia, Humberto E., Wen-Chiao Lin, and Semyon M. Meerkov. “A resilient condition assessment monitoring system.” Resilient Control Systems (ISRCS), 2012 5th International Symposium on. IEEE, 2012.
Garcia-Luna-Aceves, Jose J. 'A unified approach to loop-free routing using distance vectors or link states.' ACM SIGCOMM Computer Communication Review. vol. 19. No. 4. ACM, 1989.
Garcia-Luna-Aceves, Jose J. ‘Name-Based Content Routing in Information Centric Networks Using Distance Information’ Proc ACM ICN 2014, Sep. 2014.
Ghali, Cesar, GeneTsudik, and Ersin Uzun. “Needle in a Haystack: Mitigating Content Poisoning in Named-Data Networking.” Proceedings of NDSS Workshop on Security of Emerging Networking Technologies (SENT). 2014.
Ghodsi, Ali, et al. “Information-centric networking: seeing the forest for the trees.” Proceedings of the 10th ACM Workshop on Hot Topics in Networks. ACM, 2011.
Ghodsi, Ali, et al. “Naming in content-oriented architectures.” Proceedings of the ACM SIGCOMM workshop on Information-centric networking. ACM, 2011.
Gupta, Anjali, Barbara Liskov, and Rodrigo Rodrigues. “Efficient Routing for Peer-to-Peer Overlays.” NSDI. vol. 4. 2004.
H. Xiong, X. Zhang, W. Zhu, and D. Yao. CloudSeal: End-to-End Content Protection in Cloud-based Storage and Delivery Services. Security and Privacy in Communication Networks. Springer Berlin Heidelberg (2012).
Heckerman, David, John S. Breese, and Koos Rommelse. “Decision-Theoretic Troubleshooting.” Communications of the ACM. 1995.
Heinemeier, Kristin, et al. “Uncertainties in Achieving Energy Savings from HVAC Maintenance Measures in the Field.” ASHRAE Transactions 118.Part 2 {2012).
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.
https://code.google.com/p/ccnx-trace/.
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.
Intanagonwiwat, Chalermek, Ramesh Govindan, and Deborah Estrin. ‘Directed diffusion: a scalable and robust communication paradigm for sensor networks.’ Proceedings of the 6th annual international conference on Mobile computing and networking. ACM, 2000.
J. Aumasson and D. Bernstein, “SipHash: a fast short-input PRF”, Sep. 18, 2012.
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.
J. Shao and Z. Cao. CCA-Secure Proxy Re-Encryption without Pairings. Public Key Cryptography. Springer Lecture Notes in Computer ScienceVolume 5443 (2009).
V. Jacobson et al., ‘Networking Named Content,’ Proc. IEEE CoNEXT '09, Dec. 2009.
Jacobson, Van et al., “Content-Centric Networking, Whitepaper Describing Future Assurable Global Networks”, Palo Alto Research Center, Inc., Jan. 30, 2007, pp. 1-9.
Jacobson, Van et al. ‘VoCCN: Voice Over Content-Centric Networks.’ Dec. 1, 2009. ACM ReArch'09.
Jacobson et al., “Custodian-Based Information Sharing,” Jul. 2012, IEEE Communications Magazine: vol. 50 Issue 7 (p. 3843).
Ji, Kun, et al. “Prognostics enabled resilient control for model-based building automation systems.” Proceedings of the 12th Conference of International Building Performance Simulation Association. 2011.
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.
Koponen, Teemu et al., “A Data-Oriented (and Beyond) Network Architecture”, SIGCOMM '07, Aug. 27-31, 2007, Kyoto, Japan, XP-002579021, p. 181-192.
L. Wang et al., ‘OSPFN: An OSPF Based Routing Protocol for Named Data Networking,’ Technical Report NDN-0003, 2012.
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.
Li, Wenjia, Anupam Joshi, and Tim Finin. “Coping with node misbehaviors in ad hoc networks: A multi-dimensional trust management approach.” Mobile Data Management (MDM), 2010 Eleventh International Conference on. IEEE, 2010.
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. Nystrom, S. Parkinson, A. Rusch, and M. Scott, “PKCS#12: Personal information exchange syntax v. 1.1,” IETF RFC 7292, K. Moriarty, Ed., Jul. 2014.
M. Parsa and J.J. Garcia-Luna-Aceves, “A Protocol for Scalable Loop-free Multicast Routing.” IEEE JSAC, Apr. 1997.
M. Walfish, H. Balakrishnan, and S. Shenker, “Untangling the web from DNS,” in Proc. USENIX NSDI 2004, Oct. 2010, pp. 735-737.
Mahadevan, Priya, et al. “Orbis: rescaling degree correlations to generate annotated internet topologies.” ACM SIGCOMM Computer Communication Review. vol. 37. No. 4. ACM, 2007.
Mahadevan, Priya, et al. “Systematic topology analysis and generation using degree correlations.” ACM SIGCOMM Computer Communication Review. vol. 36. No. 4. ACM, 2006.
Matocha, Jeff, and Tracy Camp. ‘A taxonomy of distributed termination detection algorithms.’ Journal of Systems and Software 43.3 (1998): 207-221.
Matted Varvello et al., “Caesar: A Content Router for High Speed Forwarding”, ICN 2012, Second Edition on Information-Centric Networking, New York, Aug. 2012.
McWilliams, Jennifer A., and Iain S. Walker. “Home Energy Article: A Systems Approach to Retrofitting Residential HVAC Systems.” Lawrence Berkeley National Laboratory (2005).
Merindol et al., “An efficient algorithm to enable path diversity in link state routing networks”, Jan. 10, Computer Networks 55 (2011), pp. 1132-1140.
Mobility First Project [online], http://mobilityfirst.winlab.rutgers.edu/, Downloaded Mar. 9, 2015.
Narasimhan, Sriram, and Lee Brownston. “HyDE—A General Framework for Stochastic and Hybrid Modelbased Diagnosis.” Proc. DX 7 (2007): 162-169.
NDN Project [online], http://www.named-data.net/, Downloaded Mar. 09, 2015.
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.
R. H. Deng, J. Weng, S. Liu, and K. Chen. Chosen-Ciphertext Secure Proxy Re-Encryption without Pairings. CANS. Spring Lecture Notes in Computer Science vol. 5339 (2008).
Rosenberg, J. “Interactive Connectivity Establishment (ICE): A Protocol for Network Address Translator (NAT) Traversal for Offer/Answer Protocols”, Apr. 2010, pp. 1-117.
S. Chow, J. Weng, Y. Yang, and R. Deng. Efficient Unidirectional Proxy Re-Encryption. Progress in Cryptology—AFRICACRYPT 2010. Springer Berlin Heidelberg (2010).
S. Deering, “Multicast Routing in Internetworks and Extended LANs,” Proc. ACM SIGCOMM '88, Aug. 1988.
S. Deering et al., “The PIM architecture for wide-area multicast routing,” IEEE/ACM Trans, on Networking, vol. 4, No. 2, Apr. 1996.
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.
Sandvine, Global Internet Phenomena Report—Spring 2012. Located online at http://www.sandvine.com/downloads/ documents/Phenomenal H 2012/Sandvine Global Internet Phenomena Report 1H 2012.pdf.
Scalable and Adaptive Internet Solutions (SAIL) Project [online], http://sail-project.eu/ Downloaded Mar. 9, 2015.
Schein, Jeffrey, and Steven T. Bushby. A Simulation Study of a Hierarchical, Rule-Based Method for System-Level Fault Detection and Diagnostics in HVAC Systems. US Department of Commerce,[Technology Administration], National Institute of Standards and Technology, 2005.
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.
Sheppard, John W., and Stephyn GW Butcher. “A formal analysis of fault diagnosis with d-matrices.” Journal of Electronic Testing 23.4 (2007): 309-322.
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.
Solis, Ignacio, and J. J. Garcia-Luna-Aceves. ‘Robust content dissemination in disrupted environments.’ proceedings of the third ACM workshop on Challenged networks. ACM, 2008.
Sun, Ying, and Daniel S. Weld. “A framework for model-based repair.” AAAI. 1993.
T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT),” Proc. ACM SIGCOMM '88, Aug. 1988.
T. Dierts, “The transport layer security (TLS) protocol version 1.2,” IETF RFC 5246, 2008.
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.
The Despotify Project (2012). Available online at http://despotify.sourceforge.net/.
V. Goyal, 0. 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.
V. K. Adhikari, S. Jain, Y. Chen, and Z.-L. Zhang. Vivisecting Youtube:An Active Measurement Study. In INFOCOM12 Mini-conference (2012).
Verma, Vandi, Joquin Fernandez, and Reid Simmons. “Probabilistic models for monitoring and fault diagnosis.” The Second IARP and IEEE/RAS Joint Workshop on Technical Challenges for Dependable Robots in Human Environments. Ed. Raja Chatila. Oct. 2002.
Vijay Kumar Adhikari, Yang Guo, Fang Hao, Matteo Varvello, Volker Hilt, Moritz Steiner, and Zhi-Li Zhang. Unreeling Netflix: Understanding and Improving Multi-CDN Movie Delivery. In the Proceedings of IEEE INFOCOM 2012 (2012).
Vutukury, Srinivas, and J. J. Garcia-Luna-Aceves. A simple approximation to minimum-delay routing. vol. 29. No. 4. ACM, 1999.
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.
Waldvogel, Marcel “Fast Longest Prefix Matching: Algorithms, Analysis, and Applications”, A dissertation submitted to the Swiss Federal Institute of Technology Zurich, 2002.
Walker, Iain S. Best practices guide for residential HVAC Retrofits. No. LBNL-53592. Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US), 2003.
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, et al., “Named Data Networking (NDN) Project”, http://www.parc.com/publication/2709/named-data-networking-ndn-project.html, Oct. 2010, NDN-0001, PARC Tech Report.
Zhang, Lixia, et al. ‘Named data networking.’ ACM SIGCOMM Computer Communication Review 44.3 {2014): 66-73.
J. Lotspiech, S. Nusser, and F. Pestoni. Anonymous Trust: Digital Rights Management using Broadcast Encryption. Proceedings of the IEEE 92.6 (2004).
RTMP (2009). Available online at http://wwwimages.adobe.com/www.adobe.com/content/dam/Adobe/en/devnet/rtmp/ pdf/rtmp specification 1.0.pdf.
S. Kamara and K. Lauter. Cryptographic Cloud Storage. Financial Cryptography and Data Security. Springer Berlin Heidelberg (2010).
Soh et al., “Efficient Prefix Updates for IP Router Using Lexicographic Ordering and Updateable Address Set”, Jan. 2008, IEEE Transactions on Computers, vol. 57, No. 1.
Beben et al., “Content Aware Network based on Virtual Infrastructure”, 2012 13th ACIS International Conference on Software Engineering.
Biradar et al., “Review of multicast routing mechanisms in mobile ad hoc networks”, Aug. 16, Journal of Network$.
D. Trossen and G. Parisis, “Designing and realizing and information-centric Internet,” IEEE Communications Magazing, vol. 50, No. 7, pp. 60-67, Jul. 2012.
Garcia-Luna-Aceves et al., “Automatic Routing Using Multiple Prefix Labels”, 2012, IEEE, Ad Hoc and Sensor Networking Symposium.
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.
Ishiyama, “On the Effectiveness of Diffusive Content Caching in Content-Centric Networking”, Nov. 5, 2012, IEEE, Information and Telecommunication Technologies (APSITT), 2012 9th Asia-Pacific Symposium.
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.
Kaya et al., “A Low Power Lookup Technique for Multi-Hashing Network Applications”, 2006 IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures, Mar. 2006.
Hoque et al., “NLSR: Named-data Link State Routing Protocol”, Aug. 12, 2013, ICN'13.
Nadeem Javaid, “Analysis and design of quality link metrics for routing protocols in Wireless Networks”, PhD Thesis Defense, Dec. 15, 2010, Universete Paris-Est.
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 protype 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]* *figure 1*.
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
20150222424 A1 Aug 2015 US