SYSTEMS AND METHODS FOR SECURE DISTRIBUTION OF CODES

• US 20150310218A1
• Filed: 04/27/2015
• Published: 10/29/2015
• Est. Priority Date: 04/28/2014
• Status: Abandoned Application

• Current Assignee: The Meyers Printing Companies, Inc., Verify Brand, Inc.
• Original Assignee: Verify Brand, Inc.
• Inventors: GEYEN, Jason
• Application Number:
  US14/696,840
• Publication Number:
  US 20150310218A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 21/10 Protecting distributed programs or content, e.g. vending or licensing of copyrighted material protection in video systems or pay television H04N7/16 ; Digital rights management [DRM]
• CPC Class Codes: G06F 21/60 Protecting data
• CPC Class Codes: H04L 51/08 Annexed information, e.g. attachments
• CPC Class Codes: H04L 51/23 Reliability checks, e.g. acknowledgments or fault reporting
• CPC Class Codes: H04L 51/48 Message addressing, e.g. address format or anonymous messages, aliases

Abstract

Systems and methods for secure distribution of codes involve providing messages to end-users that include links. When one of the messages is accessed by an end-user, one of the links is accessed and a code is rendered in the message based on the accessed link. The end-user can then redeem the code for something of value.

Claims

1. A method, comprising:

generating, by a processor, a plurality of unique hash values;

generating, by the processor, a unique address for each of the plurality of unique hash values;

distributing, by the processor, each of the plurality of unique addresses;

receiving, by the processor from a requestor, a request directed to one of the plurality of unique addresses;

identifying, by the processor, one of a plurality of unique codes corresponding to the one of the plurality of unique addresses to which the request is directed; and

providing, by the processor, the identified unique code to the requestor.

2. The method of claim 1, wherein each of the plurality of unique hash values are generated by applying a secret identifier and a unique known value to a hash algorithm and the identification of the one of the plurality of unique codes involves

parsing the one of the plurality of unique addresses to which the request is directed to obtain a hash value and the unique known value;

validating the obtained hash value and the unique known value against a stored hash value and unique known value for the one of the plurality of unique addresses to which the request is directed;

allocating the one of the plurality of unique codes; and

generating an image containing the one of the plurality of unique codes.

3. The method of claim 1, wherein the network address generated for each of the plurality of unique hash values includes the corresponding hash value.

4. The method of claim 3, wherein the network address generated for each of the plurality of unique hash values further includes an electronic mail address of a recipient of one of the plurality of unique codes.

5. The method of claim 1, wherein the network address is a uniform resource locator (URL).

6. The method of claim 1, wherein the processor distributes each of the plurality of unique addresses to an electronic mail service provider and the electronic mail service provider distributes each of the plurality of unique addresses in separate electronic mail messages to a plurality of electronic mail addresses.

7. The method of claim 6, wherein the plurality of unique addresses are included in the plurality of electronic mail messages as a hyperlink to one of the plurality of unique addresses and the unique code is provided to the requestor as an image file.

8. The method of claim 7, wherein opening of one of the plurality of electronic messages automatically sends the request to the processor.

9. The method of claim 1, wherein the request received by the processor includes an electronic mail address of the requestor.

10. The method of claim 1, wherein the processor that generates the codes is a different processor from the processor that generates the plurality of hash values and the plurality of unique addresses.

11. The method of claim 1, wherein the processor distributes each of the plurality of unique addresses to a Multimedia Messaging Service (MMS) service provider and the MMS service provider distributes each of the plurality of unique addresses in separate MMS messages to a plurality of electronic mail addresses or telephone numbers.

12. The method of claim 1, wherein the one of the plurality of unique codes has an associated redemption value.

13. The method of claim 12, wherein the associated value is selected based on a variable factor.

14. The method of claim 13, wherein the variable factor is an amount of time between when one of the plurality of unique addresses is provided to the requestor and when the requestor sends the request directed to the one of the plurality of unique addresses.

15. The method of claim 13, wherein the variable factor is a location from which the request is transmitted to the processor.