Patents by Inventor Raymond Krasinski
Raymond Krasinski has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20070033163Abstract: Recognizing that a variety of different fingerprints may correspond to the same dataset, the search of a database of fingerprints to find a match to a target fingerprint is performed with relaxed criteria for declaring a match between two fingerprints. By matching “similar”, but not “exact”, fingerprints, redundant fingerprints need not be stored for each dataset. When a new fingerprint is found, a first-in first-out (FIFO) strategy is used to allocate space in a limited memory-space to store the new entry.Type: ApplicationFiled: May 24, 2004Publication date: February 8, 2007Inventors: Michael Epstein, Raymond Krasinski
-
Publication number: 20060294382Abstract: A system and method are disclosed for detecting watermarked content that also inhibits the successful removal or corruption of the watermark. The method involves utilizing only a subset of candidate counter watermark detection techniques within any particular watermark detector to search for the watermark in an altered form. Since only a subset of counter watermark detection techniques is selected from a larger pool of techniques, a bootlegger will be unaware of the total number of transformations available to the watermark detectors and will therefore not know if the watermark has been successfully removed or corrupted. Thus, it will not be possible for a bootlegger to verify the removal or corruption of the watermark by simply playing out the content through a watermark detection device.Type: ApplicationFiled: August 13, 2005Publication date: December 28, 2006Applicant: Koninklijke Philips Electronics N.V.Inventor: Raymond Krasinski
-
Publication number: 20060288002Abstract: A method and system effects a search of a large database (190) based on a reordering (130) of the conventional byte-order of multi-byte identifiers that identify elements in a database. The reordering (130) is selected to provide a more uniform distribution of the identifiers in the database. The database is organized and/or sorted (140, 340) based on the reordered bytes forming the identifiers of the elements in the database. By effecting a reordered byte-order search (150, 350) of uniformly distributed identifiers, the likelihood of a mismatch being detected sooner can be expected to increase in most situations, thereby improving the speed of finding a match or exhaustively searching the database.Type: ApplicationFiled: December 5, 2003Publication date: December 21, 2006Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V.Inventors: Michael Epstein, Raymond Krasinski
-
Patent number: 7124356Abstract: A method of operating a system including a digital network interconnected intelligent digital devices (IDDS) generating and receiving eXtensible Markup Language (XML) documents containing data and respective Document Type Definitions (DTDs) describing the data content. Preferably, the method includes steps for transmitting a generated XML document from a first IDD to a second IDD, and, when the respective DTD for the generated XML document satisfies a predetermined criteria, operating on the data contained in the XML document at the second IDD. In a first exemplary case, the second IDD maintains a list of trusted DTDs, and the predetermined criteria is equality between the name of the respective DTD and the name of a trusted DTD. Alternatively, the predetermined criteria is satisfied by inclusion of the name of a program residing on the second IDD in the respective DTD.Type: GrantFiled: December 3, 1999Date of Patent: October 17, 2006Assignee: Koninklijke Philips Electronics N.V.Inventors: Yasser Alsafadi, Aninda Dasgupta, Raymond Krasinski
-
Publication number: 20060041642Abstract: A system and method determines the proximity of the target node to the source node from the time required to communicate messages within the node-verification protocol. The node-verification protocol includes a query-response sequence, wherein the source node communicates a query to the target node, and the target node communicates a corresponding response to the source node. The target node is configured to communicate two responses to the query: a first response that is transmitted immediately upon receipt of the query, and a second response based on the contents of the query. The communication time is determined based on the time duration between the transmission of the query and receipt of the first response at the source node and the second response is compared for correspondence to the query, to verify the authenticity of the target node.Type: ApplicationFiled: September 22, 2003Publication date: February 23, 2006Applicant: KONINKLIJKE PHILIPS ELECTRONICS, N.V.Inventors: Martin Rosner, Raymond Krasinski, Michael Epstein
-
Patent number: 6976173Abstract: Methods and apparatus for attacking a screening algorithm. The methods include the steps of marking content to be downloaded, inserting at least one section of legitimate content into the marked content, and subjecting the content to a screening algorithm. The screening algorithm may include the steps of determining a number of segments that are included within the content, selecting at least two segments within the content, screening the two segments to determine whether the two segments verify correctly through the screening algorithm, and downloading the content when it is determined that the two segments verify correctly through the screening algorithm. Once the content has been successfully downloaded, the integrity of the downloaded content may be restored by removing the legitimate content that was previously inserted into the downloaded content.Type: GrantFiled: September 28, 2001Date of Patent: December 13, 2005Assignee: Koninklijke Philips Electronics N.V.Inventors: Raymond Krasinski, Michael A. Epstein
-
Publication number: 20050166223Abstract: A device (10) for receiving content includes a memory (12) which stores a descriptor; and a processor (18) which reads the descriptor and an origin code embedded in the content. The processor (18) compares the descriptor with the origin code, and allows content access, such as display of the content onto a screen (20), when the descriptor is substantially identical to the origin code. The descriptor indicates the region where the device may be useable, while the origin code indicates the origin of broadcast of the content (14). Alternatively or in addition, the descriptor may indicate the time zone where the device is useable and the origin code indicates the time zone of origin of the broadcast content (14). The device (10) prevents content access such as display when the content code included in the content (14) does not match the descriptor stored in the memory (12) of the device (10).Type: ApplicationFiled: April 15, 2003Publication date: July 28, 2005Inventor: Raymond Krasinski
-
Publication number: 20050165689Abstract: A device (10) for recording content onto a medium (14) includes a processor (22) which is configured to read a first code (16) embedded in the medium (14), a second code embedded in a memory (12) of the recording device (10), and a third code embedded in the content (18). The processor (22) compares the three codes and allows recordation of the content (18) onto the medium (14) when the three codes are identical. The three codes are region codes indicative of the region of broadcast of the content (18), the broadcast time or the time zone of the region of broadcast. The recording device (10) prevents recordation when a content code included in the content (18) does not match the other two codes or their difference is greater than a predetermined amount.Type: ApplicationFiled: April 15, 2003Publication date: July 28, 2005Inventors: Raymond Krasinski, Michael Epstein
-
Patent number: 6850948Abstract: A method and apparatus are disclosed for compressing textual documents encoded using a tag-based markup language, such as XML or SGML documents, in a manner that allows a compressed document to be processed without decompression. A document is compressed using a standard compression algorithm that is applied only to the data elements of the document. The tag elements of the XML document that impose the hierarchical structure on the data elements are not compressed. The hierarchical relationship of the data elements can be ascertained from the compressed document. A user can thereafter selectively decompress desired portions of the document, without decompressing the entire document. An identification of the employed compression technique can be inserted into a root node tag element of the XML document or into an additional tag element pair that is inserted into the XML document.Type: GrantFiled: October 30, 2000Date of Patent: February 1, 2005Assignee: Koninklijke Philips Electronics N.V.Inventor: Raymond Krasinski
-
Publication number: 20030084332Abstract: A copy protection program for securely holding digital audio and/or video content is bound to a particular device via a key derived in part from unique or distinctive hardware, software and/or firmware identifiers within the device and in part from a random or pseudo-random number. The key is checked or rebuilt whenever the copy protection program is employed to access protected digital content, either authorizing/prohibiting such access to the content or enabling/precluding proper decoding of the content. Therefore the digital content need not be directly bound to the device while circumvention of the copy protection is frustrated.Type: ApplicationFiled: October 26, 2001Publication date: May 1, 2003Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V.Inventors: Raymond Krasinski, Martin C. Rosner
-
Publication number: 20020144130Abstract: Apparatus and methods for detecting illicit content that has been imported into a secure domain, thereby preventing an attack on a screening algorithm. A method of preventing an attack on a screening algorithm includes the steps of determining whether content submitted to a screening algorithm contains indicia indicating that the content is protected, admitting the content into a segregated location of a secure domain if it is determined that the content does not contain indicia indicating that the content is protected, and monitoring the content within the segregated location to detect whether any editing activity is performed on the content. The content is admitted into the segregated location only when it is determined that the content does not contain indicia indicating that the content is protected. The method also includes the step of determining whether the edited content contains indicia indicating that the content is protected, after editing activity is detected.Type: ApplicationFiled: December 6, 2001Publication date: October 3, 2002Applicant: Koninklijke Philips Electronics N.V.Inventors: Martin Rosner, Raymond Krasinski, Michael A. Epstein, Antonius A.M. Staring
-
Publication number: 20020144133Abstract: Methods and apparatus for attacking a screening algorithm. The methods include the steps of marking content to be downloaded, inserting at least one section of legitimate content into the marked content, and subjecting the content to a screening algorithm. The screening algorithm may include the steps of determining a number of segments that are included within the content, selecting at least two segments within the content, screening the two segments to determine whether the two segments verify correctly through the screening algorithm, and downloading the content when it is determined that the two segments verify correctly through the screening algorithm. Once the content has been successfully downloaded, the integrity of the downloaded content may be restored by removing the legitimate content that was previously inserted into the downloaded content.Type: ApplicationFiled: September 28, 2001Publication date: October 3, 2002Applicant: KONINKLIJKE PHILIPS ELECTRONICS N.V..Inventors: Raymond Krasinski, Michael A. Epstein