← Back to Patent Explorer
US5920878A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for hiding a binary encoded message in an electronic document by modulating the case of the characters in a case-insensitive markup language

Assignee: Achates Reference Publishing Inc
•
Filing: 1996-11-14
•
Granted: 1999-07-06
•
Expires: 2016-11-14
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Embodiments of the present invention are capable of hiding a message, such as, for example, a copyright notice or other indicium of authorship, in an electronic document. An illustrative embodiment of the present invention comprises encoding an electronic document with a plurality of tags from a case insensitive markup language; and modulating the case of at least one tag character in at least one of said plurality of tags with a binary string, wherein the binary string represents a message to be hidden in the electronic document.

Inventors

  • 👤 Jason Paul DeMont

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 17:55
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/12; G06F40/123

Claims Analysis

Total Claims: 13
Claim 1
Independent Claim 55 words
A method comprising: encoding an electronic document with a plurality of tags from a case insensitive markup language; and modulating the case of at least one tag character in at least one of said plurality of tags with a binary string, wherein said binary string represents a message to be hidden in said electronic document.
Claim 2
Independent Claim 55 words
A method comprising: encoding an electronic document with a plurality of tags from a case insensitive markup language; and modulating the case of at least one tag character in at least one of said plurality of tags with a binary string, wherein said binary string represents a message to be hidden in said electronic document.
Claim 3
Dependent Claim 14 words
The method of claim 1 further comprising encoding said binary string with error correction.
Claim 4
Dependent Claim 10 words
The method of claim 1 wherein said message represents text.
Claim 5
Dependent Claim 12 words
The method of claim 1 wherein said message is a copyright notice.
Claim 6
Independent Claim 58 words
A method comprising: encoding an electronic document with a plurality of tags from a case insensitive markup language; reducing a message to be hidden in said electronic document to a binary string; selecting a nonempty subset of said plurality of tags; and modulating the case of said nonempty subset of said plurality of tags with said binary string.
Claim 7
Independent Claim 58 words
A method comprising: encoding an electronic document with a plurality of tags from a case insensitive markup language; reducing a message to be hidden in said electronic document to a binary string; selecting a nonempty subset of said plurality of tags; and modulating the case of said nonempty subset of said plurality of tags with said binary string.
Claim 8
Dependent Claim 14 words
The method of claim 5 further comprising encoding said binary string with error correction.
Claim 9
Dependent Claim 10 words
The method of claim 5 wherein said message represents text.
Claim 10
Dependent Claim 12 words
The method of claim 5 wherein said message is a copyright notice.
Claim 11
Independent Claim 60 words
A method of recovering a message hidden in an electronic document comprising: demodulating the case of at least one tag character in at least one of a plurality of tags in said electronic document to recover a binary string, wherein said plurality of tags are from a case insensitive markup language; and converting said binary string into said hidden message.
Claim 12
Independent Claim 60 words
A method of recovering a message hidden in an electronic document comprising: demodulating the case of at least one tag character in at least one of a plurality of tags in said electronic document to recover a binary string, wherein said plurality of tags are from a case insensitive markup language; and converting said binary string into said hidden message.
Claim 13
Dependent Claim 16 words
The method of claim 9 further comprising correcting said binary string with an error correction code.

References Cited (Backward Citations)

US5428529A Cited
US5532920A Cited
US5629770A Cited
US5818933A Cited
US5721827A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-07-05 2003-01-04 2003-07-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-07-05 2007-01-04 2007-07-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-07-05 2011-01-04 2011-07-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag