Communication across domains

• US 20070300064A1
• Filed: 05/22/2007
• Published: 12/27/2007
• Est. Priority Date: 06/23/2006
• Status: Active Grant

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Isaacs, Scott, Moore, George, Zissimopoulos, Vasileios, Thorpe, Danny
• Granted Patent: US 8,185,737 B2
• Time in Patent Office: Days
• US Class Current: 713/168
• CPC Class Codes: G06F 16/957 Browsing optimisation, e.g. caching or content distillation

Abstract

Communication across domains is described. In at least one implementation, a determination is made that an amount of data to be communicated via an Iframe exceeds a threshold amount. The data is divided into a plurality of portions that do not exceed the threshold amount. A plurality of messages is formed to communicate the divided data across domains.

Claims

1. A method comprising:

determining that an amount of data to be communicated via an Iframe exceeds a threshold amount;

dividing the data into a plurality of portions that do not exceed the threshold amount; and

forming a plurality of messages to communicate the divided data across domains.

2. A method as described in claim 1, wherein the Iframe is incorporated within a webpage.

3. A method as described in claim 1, wherein the threshold amount is 2,083 bytes.

4. A method as described in claim 1, wherein the communicating is performed between Iframes.

5. A method as described in claim 1, wherein the communicating is performed using asynchronous communication.

6. A method as described in claim 5, wherein the asynchronous communication includes:

assigning a unique identifier for each of the plurality of messages; and

when an acknowledgement has not been received indicating that a particular said message has not been received having a respective said unique identifier, resending the particular said message.

7. A method as described in claim 6, wherein the unique identifier is assigned through use of a counter.

8. A method as described in claim 1, wherein the communicating is performed using a queuing mechanism.

9. A method as described in claim 1, wherein the communicating is performed by manipulating a uniform resource locator (URL).

10. A method as described in claim 9, wherein the manipulating includes appending each said portion of the data to the URL after a hash appearing in the URL.

11. A method as described in claim 10, wherein the manipulating is performed such that a change in the manipulated URL is detectable by the Iframe that is to receive the communicated messages and that the manipulated URL is parsable to access a respective said portion of the data.

12. A method comprising:

determining that data to be communicated via an Iframe is to be confirmed by a user before communication; and

outputting in a user interface a portion that is selectable by the user to confirm that communication of the data is permitted.

13. A method as described in claim 12, wherein the determining includes ascertaining that the data contains personally identifiable information.

14. A method as described in claim 12, wherein the determining includes ascertaining that an intended recipient of the data is a third-party site.

15. A method as described in claim 12, wherein the determining includes ascertaining that an intended recipient is untrusted.

16. A method as described in claim 12, wherein the outputting is performed via a web browser.

17. A method comprising:

sharing one or more secrets across domains; and

forming a secure communication channel across the domains via at least one Iframe using the one or more secrets.

18. A method as described in claim 17, wherein the sharing includes:

providing a said first secret configured as a cryptographic number from a sender to a recipient;

receiving a result of a function applied to the first said secret and a second said secret configured as a cryptographic number from the recipient; and

using the result to communicate messages.

19. A method as described in claim 18, wherein the cryptographic numbers are random numbers.

20. A method as described in claim 18, wherein the result is included in messages communicated via the secure communication channel.