Method and apparatus for providing an adaptable security level in an electronic communication

Information

  • Patent Grant
  • 11870787
  • Patent Number
    11,870,787
  • Date Filed
    Friday, December 23, 2022
    a year ago
  • Date Issued
    Tuesday, January 9, 2024
    3 months ago
Abstract
A method of communicating in a secure communication system, comprises the steps of assembling a message at a sender, then determining a security level, and including an indication of the security level in a header of the message. The message is then sent to a recipient.
Description
BACKGROUND OF THE INVENTION
Field of the Invention

The present invention relates to a method and apparatus for providing an adaptable security level in an electronic communication.


Description of the Prior Art

In electronic communications, it is often necessary to prevent an eavesdropper from intercepting message. It is also desirable to have an indication of the authenticity of a message, that is a verifiable identification of the sender. These goals are usually achieved through the use of cryptography. Private key cryptography requires sharing a secret key prior to initiating communications. Public key cryptography is generally preferred as it does not require such a shared secret key. Instead, each correspondent has a key pair including a private key and a public key. The public key may be provided by any convenient means, and does not need to be kept secret.


There are many variations in cryptographic algorithms, and various parameters that determine the precise implementation. In standards for wireless communications, it has been customary to set these parameters in advance for each frame type. However, this approach limits the flexibility of the parameters.


When one device is communicating with several other devices, it will often need to establish separate parameters for each communication.


It is an object of the present invention to obviate or mitigate the above disadvantages.


SUMMARY OF THE INVENTION

In accordance with one aspect of the present invention, there is provided a method of communicating in a secure communication system, comprising the steps of assembling as message at a sender, then determining a security level, and including an indication of the security level in a header of the message. The message is then sent to a recipient.





BRIEF DESCRIPTION OF THE DRAWINGS

These and other features of the preferred embodiments of the invention will become more apparent in the following detailed description in which reference is made to the appended drawings wherein:



FIG. 1 is a schematic representation of a communication system;



FIG. 2 is a schematic representation of an information frame exchanged in the communication system of FIG. 1;



FIG. 3 is a schematic representation of a frame control portion of the frame of FIG. 2;



FIG. 4 is a schematic representation of a method performed by a sender in FIG. 1;



FIG. 5 is a schematic representation of a method performed by a recipient in FIG. 1.





DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to FIG. 1, a communication system 10 includes a pair of correspondents 12, 14 connected by a communication link 16. Each correspondent 12, 14 includes a respective cryptographic unit 18, 20.


Each correspondent 12, 14 can include a processor 22, 24. Each processor may be coupled to a display and to user input devices, such as a keyboard, mouse, or other suitable devices. If the display is touch sensitive, then the display itself can be employed as the user input device. A computer readable storage medium is coupled to each processor 22, 24 for providing instructions to the processor 22, 24 to instruct and/or configure processor 22, 24 to perform steps or algorithms related to the operation of each correspondent 12, 14, as further explained below. The computer readable medium can include hardware and/or software such as, by way of example only, magnetic disks, magnetic tape, optically readable medium such as CD ROM's, and semi-conductor memory such as PCMCIA cards. In each case, the medium may take the form of a portable item such as a small disk, floppy diskette, cassette, or it may take the form of a relatively large or immobile item such as hard disk drive, solid state memory card, or RAM provided in a support system. It should be noted that the above listed example mediums can be used either alone or in combination.


In order to transfer data between the correspondents 12, 14, a packet stream 30 is assembled at one of the correspondents in accordance with a defined protocol. The packet stream 30 is shown schematically in FIG. 2 and is composed of one or more frames 31, each of which has a header 32 and data 34. In some protocols, the packet may itself be organised as a frame with a header 32a and the data 34a consisting of a collection of individual frames. The header 32 is made up of a string of bits and contains control information at specified locations within the bit stream.


Included in each of the headers 34 are security control bits 33, that included a security mode bit 35 and integrity level bits 36, 37.


In this embodiment, security bit mode 35 is used to indicate whether encryption is on or off Security bits 36 and 37 together are used to indicate which of four integrity levels, such as 0, 32, 64, or 128 bit key size is utilised. The security mode bit may be used to indicate alternative modes of operation, such as, authentication and the number of bits may be increased to accommodate different combinations. It will be recognized that providing security bits in each frame 31 of the stream 30 allows the security level to be on a frame-by-frame basis rather than on the basis of a pair of correspondents, therefore providing greater flexibility in organizing communications.


In order to provide security, certain minimum security levels may be used. These levels should be decided upon among all of the correspondents through an agreed-upon rule. This rule may be either static or dynamic.


In operation, the correspondent 12 performs the steps shown in FIG. 4 by the numeral 100 to send information to the correspondent 14. First, the correspondent 12 prepares data and a header at step 102. Then it selects the security level at step 104. The security level is determined by considering the minimum security level required by the recipient, the nature of the recipient, and the kind of data being transmitted. If the security level includes encryption, then the correspondent 12 encrypts the data at step 106. If the security level includes authentication, then the correspondent 12 signs the data at step 108. Then the correspondent 12 includes bits indicating the security mode and security level in the frame control at step 110. The correspondent 12 then sends the frame to the correspondent 14.


Upon receiving the frame, the correspondent 14 performs the steps shown in FIG. 5 by the numeral 120. The correspondent 14 first receives the frame at step 122. It then extracts the security bits at step 124. If the mode security bits 34 indicate encryption, then the correspondent 14 decrypts the data at step 126. If the security bits indicate authentication, then the correspondent 14 verifies the signature at step 126. Finally, the correspondent 14 checks the security level to ensure it meets predetermined minimum requirements. If either the encryption 4 or authentication fails, or if the security level does not meet the minimum requirements, then the correspondent 14 rejects the message.


It will be recognized that providing security bits and an adjustable security level provides flexibility in protecting each frame of the communication. It is therefore possible for the sender to decide which frames should be encrypted but not authenticated. Since authentication typically increases the length of a message, this provides a savings in constrained environments when bandwidth is at a premium.


In a further embodiment, the correspondent 12 wishes to send the same message to multiple recipients 14 with varying minimum security requirements. In this case, the correspondent 12 chooses a security level high enough to meet all of the requirements. The correspondent 12 then proceeds as in FIG. 4 to assemble and send a message with the security level. The message will be accepted by each recipient since it meets each of their minimum requirements. It will be recognized that this embodiment provides greater efficiency than separately dealing with each recipient's requirements.


In another embodiment, a different number of security bits are used. The actual number of bits is not limited to any one value, but rather may be predetermined for any given application. The security bits should indicate the algorithm parameters. They may be used to determine the length of a key as 40 bits or 128 bits, the version of a key to be used, or any other parameters of the encryption system.


Although the invention has been described with reference to certain specific embodiments, various modifications thereof will be apparent to those skilled in the art without departing from the spirit and scope of the invention as outlined in the claims appended hereto.

Claims
  • 1. A method for providing security in an electronic communication system, comprising: receiving a plurality of frames, wherein each individual frame in the plurality of frames has a header and associated data, the header of each individual frame including security control bits that indicate for the individual frame whether encryption has been provided for the individual frame and whether integrity has been provided for the individual frame, wherein the security control bits include one or more security mode bits and integrity level bits, wherein the one or more security mode bits indicate whether encryption is on or off, and wherein the integrity level bits indicate which of at least three integrity levels is utilized, the integrity levels corresponding to signing operations of different strength; andfor each individual frame: identifying a security level for the individual frame based on the security control bits in the header of the individual frame;checking said security level against predetermined security requirements; andrejecting the individual frame in response to said security level not meeting said predetermined security requirements.
  • 2. The method of claim 1, wherein said security level is selected based on said predetermined security requirements.
  • 3. The method of claim 2, wherein said predetermined security requirements are determined based on an agreed-upon rule.
  • 4. The method of claim 1, wherein said security control bits include an indication of a cryptographic algorithm parameter.
  • 5. The method of claim 1, further comprising decrypting each individual frame according to said security level for the individual frame.
  • 6. The method of claim 1, further comprising verifying the integrity of each individual frame according to said security level for the individual frame.
  • 7. The method of claim 1, wherein a number of integrity levels is three, and the three integrity levels correspond to key lengths of 32, 64, and 128 bits.
  • 8. The method of claim 1, wherein one of the integrity levels uses a key length of 128 bits.
  • 9. A communication device, comprising: at least one hardware processor;a non-transitory computer-readable storage medium coupled to the at least one hardware processor and storing programming instructions for execution by the at least one hardware processor, wherein the programming instructions instruct the at least one hardware processor to:receive a plurality of frames, wherein each individual frame from the plurality of frames has a header and associated data, the header of each individual frame including security control bits that indicate for the individual frame whether encryption has been provided for the individual frame and whether integrity has been provided for the individual frame, wherein the security control bits include one or more security mode bits and integrity level bits, wherein the one or more security mode bits indicate whether encryption is on or off, and wherein the integrity level bits indicate which of at least three integrity levels is utilized, the integrity levels corresponding to signing operations of different strength; andfor each individual frame: identify a security level for the individual frame based on the security control bits in the header of the individual frame;check said security level against predetermined security requirements for said communication device; andreject the individual frame in response to said security level not meeting said predetermined security requirements.
  • 10. The communication device of claim 9, wherein said security level is selected based on said predetermined security requirements for said communication device.
  • 11. The communication device of claim 9, wherein said predetermined security requirements are determined based on an agreed-upon rule.
  • 12. The communication device of claim 9, wherein said security control bits include an indication of a cryptographic algorithm parameter.
  • 13. The communication device of claim 9, wherein the programming instructions further instruct the at least one hardware processor to decrypt each individual frame according to said security level for the individual frame.
  • 14. The communication device of claim 9, wherein the programming instructions further instruct the at least one hardware processor to verify the integrity of each individual frame according to said security level for the individual frame.
  • 15. The communication device of claim 9, wherein a number of integrity levels is three, and the three integrity levels correspond to key lengths of 32, 64, and 128 bits.
  • 16. The communication device of claim 9, wherein one of the integrity levels uses a key length of 128 bits.
  • 17. A non-transitory computer-readable medium storing instructions which, when executed, cause a communication device to perform operations comprising: receiving a plurality of frames, wherein each individual frame in the plurality of frames has a header and associated data, the header of each individual frame including security control bits that indicate for the individual frame whether encryption has been provided for the individual frame and whether integrity has been provided for the individual frame, wherein the security control bits include one or more security mode bits and integrity level bits, wherein the one or more security mode bits indicate whether encryption is on or off, and wherein the integrity level bits indicate which of at least three integrity levels is utilized, the integrity levels corresponding to signing operations of different strength; andfor each individual frame: identifying a security level for the individual frame based on the security control bits in the header of the individual frame;checking said security level against predetermined security requirements; andrejecting the individual frame in response to said security level not meeting said predetermined security requirements.
  • 18. The non-transitory computer-readable medium of claim 17, wherein said security level is selected based on said predetermined security requirements.
  • 19. The non-transitory computer-readable medium of claim 18, wherein said predetermined security requirements are determined based on an agreed-upon rule.
  • 20. The non-transitory computer-readable medium of claim 17, wherein said security control bits include an indication of a cryptographic algorithm parameter.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of and claims priority to U.S. application Ser. No. 17/156,314, filed on Jan. 22, 2021, which is a continuation of and claims priority to is to U.S. application Ser. No. 16/459,269, filed on Jul. 1, 2019, now U.S. Pat. No. 11,063,958, which is a continuation of and claims priority to U.S. application Ser. No. 15/811,194 filed on Nov. 13, 2017, now U.S. Pat. No. 10,341,356, which is a continuation of and claims priority to U.S. application Ser. No. 15/215,187 filed on Jul. 20, 2016, now U.S. Pat. No. 9,819,686, which is a continuation of and claims priority to U.S. application Ser. No. 14/877,072, filed on Oct. 7, 2015, now U.S. Pat. No. 9,419,983, which is a continuation of and claims priority to U.S. application Ser. No. 14/477,637, filed on Sep. 4, 2014, now U.S. Pat. No. 9,191,395, which is a continuation of and claims priority to U.S. application Ser. No. 10/885,115, filed on Jul. 7, 2004, now U.S. Pat. No. 8,862,866, which claims priority from U.S. Provisional Patent Application No. 60/484,656 filed on Jul. 7, 2003, the entire contents of which is hereby incorporated by reference for all purposes.

US Referenced Citations (156)
Number Name Date Kind
5099517 Gupta et al. Mar 1992 A
5301287 Herrell et al. Apr 1994 A
5450493 Maher Sep 1995 A
5553083 Miller et al. Sep 1996 A
5559883 Williams Sep 1996 A
5602916 Grube et al. Feb 1997 A
5615261 Grube et al. Mar 1997 A
5638448 Nguyen Jun 1997 A
5689566 Nguyen Nov 1997 A
5727002 Miller et al. Mar 1998 A
5832228 Holden et al. Nov 1998 A
6044062 Brownrigg et al. Mar 2000 A
6101543 Alden et al. Aug 2000 A
6108583 Schneck et al. Aug 2000 A
6118775 Kari et al. Sep 2000 A
6249820 Dobbins et al. Jun 2001 B1
6272632 Carman et al. Aug 2001 B1
6292900 Ngo Sep 2001 B1
6493824 Novoa et al. Dec 2002 B1
6510349 Schneck et al. Jan 2003 B1
6516416 Gregg et al. Feb 2003 B2
6567914 Just et al. May 2003 B1
6654346 Mahalingaiah et al. Nov 2003 B1
6697857 Dixon et al. Feb 2004 B1
6728243 Jason, Jr. et al. Apr 2004 B1
6732279 Hoffman May 2004 B2
6754214 Mahalingaiah Jun 2004 B1
6760768 Holden et al. Jul 2004 B2
6782473 Park Aug 2004 B1
6792111 Italia et al. Sep 2004 B1
6865426 Schneck et al. Mar 2005 B1
6918034 Sengodan et al. Jul 2005 B1
6928544 Chu Aug 2005 B2
7010681 Fletcher et al. Mar 2006 B1
7016948 Yildiz Mar 2006 B1
7023863 Naudus et al. Apr 2006 B1
7024609 Wolfgang et al. Apr 2006 B2
7031309 Sautter et al. Apr 2006 B1
7036015 Vanstone et al. Apr 2006 B2
7068791 Larsen Jun 2006 B1
7107335 Arcieri et al. Sep 2006 B1
7143137 Maufer et al. Nov 2006 B2
7233948 Shamoon et al. Jun 2007 B1
7290288 Gregg Oct 2007 B2
7302564 Berlin Nov 2007 B2
7412726 Viswanath Aug 2008 B1
7437548 Alfieri Oct 2008 B1
7447313 Van Rijnsoever Nov 2008 B2
7467406 Cox et al. Dec 2008 B2
7526807 Chao et al. Apr 2009 B2
7600038 Struik Oct 2009 B2
7657531 Bisbee et al. Feb 2010 B2
7660986 Qiu et al. Feb 2010 B1
7721324 Jackson May 2010 B1
7870240 Horvitz Jan 2011 B1
7965843 Maino et al. Jun 2011 B1
8069483 Matlock Nov 2011 B1
8245279 Struik Aug 2012 B2
8438629 Lee et al. May 2013 B2
8561127 Agrawal et al. Oct 2013 B1
8688978 Struik Apr 2014 B2
9172629 McRae et al. Oct 2015 B1
9667634 Struik May 2017 B2
9774609 Struik Sep 2017 B2
9811680 Balasubramania et al. Nov 2017 B2
9819686 Struik Nov 2017 B2
10097559 Struik Oct 2018 B2
10341356 Struik Jul 2019 B2
10637869 Struik Apr 2020 B2
11063958 Struik Jul 2021 B2
11563747 Struik Jan 2023 B2
20010043577 Barany et al. Nov 2001 A1
20020035635 Holden et al. Mar 2002 A1
20020076049 Boykin et al. Jun 2002 A1
20020078227 Kronenberg Jun 2002 A1
20020090086 Van Rijnsoever Jul 2002 A1
20020094087 Dellmo et al. Jul 2002 A1
20020174352 Dahl Nov 2002 A1
20020176433 Zhu et al. Nov 2002 A1
20020181493 Hsu et al. Dec 2002 A1
20030012163 Cafarelli et al. Jan 2003 A1
20030026255 Poeluev et al. Feb 2003 A1
20030035542 Kim Feb 2003 A1
20030073406 Benjamin et al. Apr 2003 A1
20030117486 Ferren et al. Jun 2003 A1
20030119484 Adachi et al. Jun 2003 A1
20030126299 Shah-Heydari Jul 2003 A1
20030147369 Singh et al. Aug 2003 A1
20030156586 Lee et al. Aug 2003 A1
20030159036 Walmsley et al. Aug 2003 A1
20030188151 Sato et al. Oct 2003 A1
20030226011 Kuwano et al. Dec 2003 A1
20040010691 Nelson Jan 2004 A1
20040015720 Dubuque Jan 2004 A1
20040028409 Kim et al. Feb 2004 A1
20040047324 Diener Mar 2004 A1
20040062224 Brownrigg et al. Apr 2004 A1
20040083362 Park et al. Apr 2004 A1
20040136513 Chiu et al. Jul 2004 A1
20040136527 Struick Jul 2004 A1
20040139312 Medvinsky Jul 2004 A1
20040160903 Gai et al. Aug 2004 A1
20040202323 Fellerer Oct 2004 A1
20040218683 Batra et al. Nov 2004 A1
20040223615 Dhawan et al. Nov 2004 A1
20040255001 Oh et al. Dec 2004 A1
20050015583 Sarkkinen et al. Jan 2005 A1
20050076197 Struik Apr 2005 A1
20050081032 Struik Apr 2005 A1
20050086481 Winget Apr 2005 A1
20050086501 Woo et al. Apr 2005 A1
20050097357 Smith May 2005 A1
20050108527 Ginzburg et al. May 2005 A1
20050108746 Futagami et al. May 2005 A1
20050132193 Ishidoshiro et al. Jun 2005 A1
20050160292 Batthish et al. Jul 2005 A1
20050180367 Dooley et al. Aug 2005 A1
20050182765 Liddy Aug 2005 A1
20050193080 Gold et al. Sep 2005 A1
20050238172 Tamura Oct 2005 A1
20050268342 Shay Dec 2005 A1
20060050708 Shapiro et al. Mar 2006 A1
20060064736 Ahuja et al. Mar 2006 A1
20060075480 Noehring et al. Apr 2006 A1
20060077997 Yamaguchi et al. Apr 2006 A1
20060112431 Finn et al. May 2006 A1
20060136715 Han et al. Jun 2006 A1
20060140400 Brown et al. Jun 2006 A1
20060168255 Katz et al. Jul 2006 A1
20060191002 Lee et al. Aug 2006 A1
20060210071 Chandran et al. Sep 2006 A1
20060236365 Pham Oct 2006 A1
20060288204 Sood et al. Dec 2006 A1
20070058633 Chen et al. Mar 2007 A1
20070086397 Taylor Apr 2007 A1
20070116291 Silverman et al. May 2007 A1
20070160059 Poeluev et al. Jul 2007 A1
20070192596 Otsuka Aug 2007 A1
20070195788 Vasamsetti et al. Aug 2007 A1
20070206796 Lino et al. Sep 2007 A1
20070255954 Struik Nov 2007 A1
20080177997 Morais et al. Jul 2008 A1
20080307524 Singh et al. Dec 2008 A1
20090007226 Fujii Jan 2009 A1
20090290635 Kim et al. Nov 2009 A1
20090319775 Buer et al. Dec 2009 A1
20110106956 Luo et al. May 2011 A1
20110209196 Kennedy Aug 2011 A1
20110264915 Cam-Winget et al. Oct 2011 A1
20120284800 Struik et al. Nov 2012 A1
20150063202 Mazzarella et al. Mar 2015 A1
20190052646 Struik Feb 2019 A1
20190394207 Struik Dec 2019 A1
20200244669 Struik Jul 2020 A1
20210058377 Khan Feb 2021 A1
20210314327 Struik Oct 2021 A1
Foreign Referenced Citations (12)
Number Date Country
2478274 Feb 2005 CA
1320010 Jun 2003 EP
1324541 Jul 2003 EP
1326157 Jul 2003 EP
2004-064652 Feb 2004 JP
2005-354504 Dec 2005 JP
WO 2000010304 Feb 2000 WO
WO 2003036857 May 2003 WO
WO 2005046178 May 2005 WO
WO 2005081032 Sep 2005 WO
WO 2005083970 Sep 2005 WO
WO 2006006321 Jan 2006 WO
Non-Patent Literature Citations (81)
Entry
Thomas S. Messerges, et al. 2003. A security design for a general purpose, self-organizing, multihop ad hoc wireless network. In Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks (SASN '03). Association for Computing Machinery, New York, NY, USA, 1-11. (Year: 2003).
Cam-Winget et al., “Security Flaws in 802.11 Data Link Protocols” Communications of the ACM 46.5, May 2003, 35-39.
Dierks, T et al., “The TLS Protocol”; RFC 2246; IETF; Jan. 1999; 23, 28-30.
Hura et al., “Data and Computer Communications: Networking and Internetworking”; CRC Press, 2001, 337, 450, 453, 467, 471, 483, 484, 485, 489, 491, 526, 599, 609, 617, 618, 621, 937, 1086, 1117, 1118, 1132.
IEEE Standard 802.11; Standard for Telecommunications and Information Exchange between Systems—Local and Metropolitan Networks—Specific Requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications; IEEE Press; 1999, 34-41, 50-58.
Kent et al., “IP Authentication Header”; RFC 2402; IETF; Nov. 1998, 21 pages.
Kent et al., “Security Architecture for the Internet Protocol”; RFC 2401; IETF; Nov. 1998; 62 pages.
Oppliger, “Security at the Internet Layer” Computer 31.9, 1998, 43-47.
Specification of the Bluetooth System; Specification vol. 1—Core, Version 1.0B; Dec. 1, 1999, 160.
Sung et al., “Design and Evaluation of Adaptive Secure Protocol for E-Commerce”; Proceedings of the 10th International Conference on Computer Communications and Networks; Oct. 15-17, 2001, 32-39.
“Transmission Control Protocol”; RFC 0793; Darpa Internet Program; Information Sciences Institute; University of Southern California; Sep. 1981, 85 pages.
Kent, “Internet privacy enhanced mail,” Communications of the ACM 36.8, 1993, 48-60.
Li et al., “Security issues with TCP/IP,” ACM SIGAPP Applied Computing Review 3.1, 1995, 6-13.
LeMay et al., “Comprehensive message control and assurance with the secure email transport protocol,” Electro/Information Technology Conference, 2004. EIT2004. IEEE. IEEE, 2004, 272-280.
SunScreen 3.2 Administrator's Overview, Sep. 2001, 356 pages.
Kim et al., “Internet Multicast Provisioning Issues for Hierarchical Architecture,” Oct. 2001, Proceedings of the Ninth IEEE International Conference on Networks, 401-404.
Scheikl et al., Multi-level Secure Multicast: The Rethinking of Secure Locks, Aug. 2002, International Conference on Parallel Processing Workshop, 17-24.
Messerges, Thomas S., et al. “A security design for a general purpose, self-organizing, multihop ad hoc wireless network,” Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks. ACM, 2003, 11 pages.
A. Wool, “A note on the fragility of the “Michael” message integrity code,” in IEEE Transactions on Wireless Communications, vol. 3, Sep. 2004, 1459-1462, 5, pages.
“Internet Protocol,” Request for Comments (RFC) 791, Darpa Internet Program, Protocol Specification, Sep. 1981, 45 pages.
“IP Encapsulating Security Payload (ESP),” Request for Comments (RFC) 2406, Network Working Group, Nov. 1998, 19 pages.
“Internet Protocol, Version 6 (IPv6),” Request for Comments (RFC) 2460, Network Working Group, Nov. 1998, 34 pages.
Cisco Press, “Internetworking Technology Overview,” Jun. 1999, 448 pages.
Katsavos et al., “Security protocol for Frame Relay,” ACM SIGCOMM Computer Communication Review, vol. 23, No. 5, Oct. 1993, 17-35, 19 pages.
Lee et al., “Principle and technique for encapsulation of user control and data information in separate frames” Proceedings of LCN—21st Annual Conference on Local Computer Networks, IEEE, Oct. 2013, 384-393, 10 pages.
Salli et al., “Security design for a new wireless local area network TUTWLAN,” Ninth IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (Cat. No. 98TH8361), Sep. 8, 1998, 1540-1544.
Non-Final Office Action issued in U.S. Appl. No. 15/595,542 dated Nov. 22, 2017, 22 pages.
Final Office Action issued in U.S. Appl. No. 15/595,542 dated Feb. 23, 2018, 14 pages.
Non-Final Office Action issued in U.S. Appl. No. 15/811,194 dated Mar. 8, 2018, 28 pages.
Advisory Action issued in U.S. Appl. No. 15/595,542, dated Apr. 30, 2018, 3 pages.
Notice of Allowance issued in U.S. Appl. No. 15/595,542 dated May 25, 2018, 9 pages.
Final Office Action issued in U.S. Appl. No. 15/811,194 dated Sep. 7, 2018, 34 pages.
Interview Summary issued in U.S. Appl. No. 15/811,194 dated Oct. 12, 2018, 3 pages.
Advisory Action issued in U.S. Appl. No. 15/811,194 dated Nov. 28, 2018, 4 pages.
Interview Summary issued in U.S. Appl. No. 15/811,194 dated Nov. 20, 2018, 1 page.
Interview Summary issued in U.S. Appl. No. 15/811,194 dated Feb. 14, 2019, 1 page.
Notice of Allowance issued in U.S. Appl. No. 15/811,194 dated Feb. 14, 2019, 14 pages.
Non-final office action issued in U.S. Appl. No. 16/153,676 dated Sep. 16, 2019, 17 pages.
Notice of allowance issued in U.S. Appl. No. 16/153,676 dated Dec. 18, 2019, 7 pages.
Non-final office action issued in U.S. Appl. No. 16/459,269 dated Jun. 26, 2020. 32 pages.
Notice of allowance issued in U.S. Appl. No. 16/459,269 dated Oct. 16, 2020, 15 pages.
Interview Summary issued in U.S. Appl. No. 16/459,269 dated Oct. 16, 2020, 2 pages.
Non-Final Office Action issued in U.S. Appl. No. 16/852,179 dated Jan. 15, 2021, 19 pages.
Notice of allowance issued in U.S. Appl. No. 16/459,269 dated Feb. 11, 2021, 14 pages.
Final Office Action issued in U.S. Appl. No. 16/852,179 dated Apr. 19, 2021, 12 pages.
Notice of allowance issued in U.S. Appl. No. 16/459,269 dated May 5, 2021, 14 pages.
Advisory Action issued in U.S. Appl. No. 16/852,179 dated Jun. 25, 2021, 3 pages.
Non-Final Office Action issued in U.S. Appl. No. 16/852,179 dated Jul. 23, 2021, 12 pages.
Final Office Action issued in U.S. Appl. No. 16/852,179 dated Nov. 29, 2021, 10 pages.
Advisory Action issued in U.S. Appl. No. 16/852,179 dated Jan. 28, 2022, 3 pages.
Non-Final Office Action issued in U.S. Appl. No. 16/852,179 dated Mar. 4, 2022, 9 pages.
Non-Final Office Action issued in U.S. Appl. No. 17/156,314 dated Jul. 8, 2022, 36 pages.
Final Office Action issued in U.S. Appl. No. 16/852,179 dated Jul. 13, 2022, 9 pages.
Notice of Allowance issued in U.S. Appl. No. 17/156,314 dated Sep. 9, 2022, 11 pages.
Advisory Action issued in U.S. Appl. No. 16/852,179 dated Sep. 16, 2022, 3 pages.
Non-Final Office Action issued in U.S. Appl. No. 16/852,179, dated Nov. 4, 2022, 11 pages.
Notice of Allowance issued in U.S. Appl. No. 17/156,314, dated Nov. 23, 2022, 12 pages.
Final Office Action issued in U.S. Appl. No. 16/852,179, dated Feb. 23, 2023, 10 pages.
CA Office Action in Canadian Application No. 2,434,992 dated Sep. 14, 2011, 3 pages.
CA Office Action in Canadian Application No. 2,434,992 dated Dec. 5, 2012, 2 pages.
CA Notice of Allowance in Canadian Application No. 2,434,992 dated Dec. 9, 2013, 1 page.
CA Office Action in Canadian Application No. 2,478,274 dated Feb. 3, 2012, 2 pages.
CA Office Action in Canadian Application No. 2,478,274 dated Mar. 14, 2013, 3 pages.
CA Office Action in Canadian Application No. 2,478,274 dated Jan. 7, 2014, 2 pages.
CA Office Action in Canadian Application No. 2,644,015 dated May 23, 2012, 3 pages.
CA Office Action in Canadian Application No. 2,644,015 dated Nov. 4, 2013, 4 pages.
CA Office Action in Canadian Application No. 2,644,015 dated Jan. 22, 2015, 5 pages.
CA Office Action issued in Canadian Application No. 2941216 dated May 30, 2017, 4 pages.
CA Notice of Allowance in Canadian Application No. 2941216 dated Apr. 30, 2018, 5 pages.
CN Office Action issued in Chinese Application No. 201310067350.5 dated May 4, 2016, 7 pages.
Extended European Search Report in European Application No. 07719535.2 dated May 13, 2011, 6 pages.
EP Communication Pursuant to Article 94(4) EPC in European Application No. 07719535.2 dated Feb. 17, 2012, 5 pages.
EP Communication Pursuant to Article 94(4) EPC in European Application No. 07719535.2 dated Mar. 8, 2013, 5 pages.
EP Communication Pursuant to Article 94(4) EPC in European Application No. 07719535.2 dated Feb. 7, 2014, 7 pages.
EP Communication under Rule 71(3) EPC issued in European Application No. 07719535.2 dated Apr. 23, 2015, 44 pages.
EP Summons to Attend Oral Proceedings Pursuant to Rule 115(1) EPC issued in European Application No. 07719535.2 on Jun. 7, 2017, 2 pages.
PCT International Search Report and Written Opinion in International Application No. PCT/CA2007/000608, dated Aug. 28, 2007, 4 pages.
Advisory Action in U.S. Appl. No. 16/852,179, dated Apr. 3, 2023, 3 pages.
Non-Final Office Action in U.S. Appl. No. 16/852,179, dated Apr. 13, 2023, 11 pages.
Final Office Action in U.S. Appl. No. 16/852,179, dated Jun. 28, 2023, 9 pages.
Non-Final Office Action in U.S. Appl. No. 16/852,179, dated Sep. 20, 2023, 10 pages.
Related Publications (1)
Number Date Country
20230140477 A1 May 2023 US
Provisional Applications (1)
Number Date Country
60484656 Jul 2003 US
Continuations (7)
Number Date Country
Parent 17156314 Jan 2021 US
Child 18088508 US
Parent 16459269 Jul 2019 US
Child 17156314 US
Parent 15811194 Nov 2017 US
Child 16459269 US
Parent 15215187 Jul 2016 US
Child 15811194 US
Parent 14877072 Oct 2015 US
Child 15215187 US
Parent 14477637 Sep 2014 US
Child 14877072 US
Parent 10885115 Jul 2004 US
Child 14477637 US