IP Library Patent Application 13106657
Patent Application
App. No. 13/106,657

METHOD AND APPARATUS FOR SECURE SIGNING AND UTILIZATION OF DISTRIBUTED COMPUTATIONS

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
13/106,657
Abstract

An approach is provided for providing secure signing and utilization of distributed computations. A distributed computation authentication platform causes, at least in part, a signing of one or more computation closures of at least one functional flow. The distributed computation authentication platform also processes and/or facilitates a processing of the one or more signed computation closures to cause, at least in part, a transfer of the one or more signed computation closures among one or more levels, one or more nodes, or a combination thereof, wherein an execution of the one or more signed computation closures at the one or more levels, the one or more nodes, or a combination thereof is based, at least in part, on an authentication of the signed one or more computation closure.

Claims (49)

1 . A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following:

a signing of one or more computation closures of at least one functional flow; and

a processing of the one or more signed computation closures to cause, at least in part, a transfer of the one or more signed computation closures among one or more levels, one or more nodes, or a combination thereof,

wherein an execution of the one or more signed computation closures at the one or more levels, the one or more nodes, or a combination thereof is based, at least in part, on an authentication of the signed one or more computation closure.

2 . A method of claim 1 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

one or more communications means for the transfer,

wherein the signing of the one or more computation closures is based, at least in part, on the one or more communication means.

3 . A method of claim 1 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

one or more cost functions associated with the one or more computation closures, the functional flow, the one or more levels, the one or more nodes, the transfer, or a combination thereof,

a processing of the one or more cost functions to determine whether to initiate the transfer, the execution, the authentication, or a combination thereof of the one or more signed computation closures.

4 . A method of claim 3 , wherein the one or more cost functions relate, at least in part, to one or more security costs, one or more energy costs, one or more privacy capability parameters, or a combination thereof.

5 . A method of claim 3 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

a processing of the one or more signed computation closures, one or more capabilities of the one or more signed computation closures, or a combination thereof based, at least in part, on the one or more cost functions to determine whether to bypass or pass through at least one of the one or more signed computation closures.

6 . A method of claim 3 , wherein the signing of the one or more computation closures includes, at least in part, a generation of one or more signatures, and wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

a processing of the one or more signed computation closures, one or more capabilities of the one or more signed computation closures, or a combination thereof to determine whether to cause, at least in part, an elimination of at least one of the one or more signatures.

7 . A method of claim 1 , wherein the signing is based, at least in part, on one or more polynomials constructed based, at least in part, on one or more keys, one or more parameters, or a combination thereof.

8 . A method of claim 7 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one determination of the one or more keys based, at least in part, on (a) run time information; (b) an execution context of the at least one functional flow, the one or more computation closures, or a combination thereof; or (c) a combination thereof.

9 . A method of claim 1 , wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one lattice of signatures, wherein the at least one lattice includes one or more root elements; and

a processing of the at least one lattice of signatures and the one or more signed computation closures to generate a comparison,

wherein the authentication of the one or more signed computation closures is based, at least in part, on the comparison.

10 . A method of claim 9 , wherein the one or more root elements are part of a superset of the one or more root elements stored at the one or more levels, the one or more nodes, or a combination thereof.

11 . An apparatus comprising:

at least one processor; and

at least one memory including computer program code for one or more programs,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,

cause, at least in part, a signing of one or more computation closures of at least one functional flow; and

process and/or facilitate a processing of the one or more signed computation closures to cause, at least in part, a transfer of the one or more signed computation closures among one or more levels, one or more nodes, or a combination thereof,

wherein an execution of the one or more signed computation closures at the one or more levels, the one or more nodes, or a combination thereof is based, at least in part, on an authentication of the signed one or more computation closure.

12 . An apparatus of claim 11 , wherein the apparatus is further caused to:

determine one or more communications means for the transfer, wherein the signing of the one or more computation closures is based, at least in part, on the one or more communication means.

13 . An apparatus of claim 11 , wherein the apparatus is further caused to:

determine one or more cost functions associated with the one or more computation closures, the functional flow, the one or more levels, the one or more nodes, the transfer, or a combination thereof,

process and/or facilitate a processing of the one or more cost functions to determine whether to initiate the transfer, the execution, the authentication, or a combination thereof of the one or more signed computation closures.

14 . An apparatus of claim 13 , wherein the one or more cost functions relate, at least in part, to one or more security costs, one or more energy costs, one or more privacy capability parameters, or a combination thereof.

15 . An apparatus of claim 13 , wherein the apparatus is further caused to:

process and/or facilitate a processing of the one or more signed computation closures, one or more capabilities of the one or more signed computation closures, or a combination thereof based, at least in part, on the one or more cost functions to determine whether to bypass or pass through at least one of the one or more signed computation closures.

16 . An apparatus of claim 13 , wherein the signing of the one or more computation closures includes, at least in part, a generation of one or more signatures, and the apparatus is further caused to:

process and/or facilitate a processing of the one or more signed computation closures, one or more capabilities of the one or more signed computation closures, or a combination thereof to determine whether to cause, at least in part, an elimination of at least one of the one or more signatures.

17 . An apparatus of claim 11 , wherein the signing is based, at least in part, on one or more polynomials constructed based, at least in part, on one or more keys, one or more parameters, or a combination thereof.

18 . An apparatus of claim 17 , wherein the apparatus is further caused to:

determine the one or more keys based, at least in part, on (a) run time information; (b) an execution context of the at least one functional flow, the one or more computation closures, or a combination thereof; or (c) a combination thereof.

19 . An apparatus of claim 11 , wherein the apparatus is further caused to:

determine at least one lattice of signatures, wherein the at least one lattice includes one or more root elements; and

process and/or facilitate a processing of the at least one lattice of signatures and the one or more signed computation closures to generate a comparison,

wherein the authentication of the one or more signed computation closures is based, at least in part, on the comparison.

20 . An apparatus of claim 19 , wherein the one or more root elements are part of a superset of the one or more root elements stored at the one or more levels, the one or more nodes, or a combination thereof.

21 - 48 . (canceled)

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 16, 2015
From: NOKIA CORPORATION
To: NOKIA TECHNOLOGIES OY
Reel/Frame 035425/0206 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 4, 2011
From: BOLDYREV, SERGEY; KAAJA, HARALD; LAINE, HANNU; HONKOLA, JUKKA; LUKKALA, VESA; OLIVER, IAN
To: NOKIA CORPORATION
Reel/Frame 027010/0124 →