KR102362842B1 - Method and system for serving hidden message imoticon - Google Patents

Abstract

A hidden message emoticon service method and system are disclosed. The hidden message emoticon service system according to an embodiment of the present disclosure includes a first user terminal that transmits an emoticon image, a hidden message, and a secret code set in the hidden message, an emoticon image, a hidden message, and a secret code from the first user terminal A server that receives and transmits a hidden message emoticon including an emoticon image and a hidden message, but transmits the hidden message in a locked state. and a second user terminal that receives the hidden message emoticon from the server and transmits a secret code for unlocking the hidden message to the server.

Description

Hidden message emoticon service method and system

An embodiment of the present invention relates to an emoticon service technology.

Recently, emoticons have been used as an important means of quickly and effectively conveying one's emotions or feelings in conversations through instant messengers or social network services (SNSs). An emoticon is an expression method for expressing emotions or intentions by combining letters, symbols, and numbers on a keyboard, and is a compound word of emotion and icon. Since these emoticons are developing as a means of conversation between users beyond a simple image, it is necessary to apply an interactive emoticon accordingly.

Korean Patent Publication No. 10-2019-0123093 (2019.10.31)

An embodiment of the present invention is to provide an emoticon service technique to which a hidden message is applied.

A hidden message emoticon service system according to an embodiment of the present disclosure includes: a first user terminal for transmitting an emoticon image, a hidden message, and a secret code set to the hidden message; a server receiving the emoticon image, the hidden message, and the secret code from the first user terminal, and transmitting a hidden message emoticon including the emoticon image and the hidden message, wherein the hidden message is locked; and a second user terminal that receives the hidden message emoticon from the server and transmits a secret code for unlocking the hidden message to the server.

The server checks whether the secret code received from the second user terminal matches the secret code received from the first user terminal, and if the secret codes match, unlocks the hidden message to unlock the second user terminal 2 It can be displayed on the user terminal.

When the server transmits the hidden message emoticon to a plurality of second user terminals, each of the secret codes is received from the plurality of second user terminals, and each received secret code and the secret received from the first user terminal You can count the number of times the code matches.

When the number of times the secret code matches exceeds a preset reference number, the server may not release the lock state of the hidden message even when the secret code matches.

The server may delete the hidden message of the hidden message emoticon when the number of times the secret code matches exceeds a preset reference number.

The server may provide the number of times the secret code matches to the first user terminal.

A hidden message emoticon service method according to an embodiment disclosed herein is a method performed in a computing device having one or more processors, and a memory for storing one or more programs executed by the one or more processors, wherein the first user Receiving an emoticon image, a hidden message, and a secret code set in the hidden message from the terminal; transmitting a hidden message emoticon including the emoticon image and the hidden message to a second user terminal, wherein the hidden message is locked; and receiving a secret code for unlocking the locked state of the hidden message from the second user terminal.

after receiving the secret code, checking whether the secret code received from the second user terminal matches the secret code received from the first user terminal; and when the secret codes match, releasing the locked state of the hidden message so that it is displayed in the second user terminal.

receiving a secret code from each of the plurality of second user terminals when the hidden message emoticon is transmitted to a plurality of second user terminals; and counting the number of times that each received secret code matches the secret code received from the first user terminal.

After the counting, when the number of times the secret code matches exceeds a preset reference number, the method may further include not releasing the locked state of the hidden message even though the secret code matches.

After the counting, when the number of times the secret code matches exceeds a preset reference number, the method may further include deleting a hidden message of the hidden message emoticon.

After the counting, the method may further include providing the number of times the secret code matches to the first user terminal.

According to the disclosed embodiment, by sending an emoticon together with the hidden message and entering the secret code set by the sender to view the hidden message, the hidden message is prevented from being exposed to others, thereby increasing security and strengthening the privacy protection function. be able to

In addition, since a separate hidden message is sent in addition to the emoticon, the emoticon can be used as a means of information delivery, thereby increasing the utility of the emoticon.

In addition, according to the disclosed embodiment, when a hidden message emoticon is used in a Facebook bulletin board or a group chat room of a messenger, the hidden message emoticon may be exposed to many users, but the secret code can be accurately entered among those users. Only the user who has the hidden message will be able to see the hidden message included in the hidden message emoticon. For example, when the hidden message emoticon is displayed on Facebook, the hidden message emoticon may be exposed to all users who can access the posted post, such as friends, family, and the general public. In addition, when the hidden message emoticon is displayed in the group chat room, all users in the corresponding chat room can see the hidden message emoticon. However, among many users who can see the hidden message emoticons exposed in the group chat room, only users who know and enter the secret code accurately can see the hidden message, so a special message can be selectively sent only to a specific user or a specific user group. can transmit Accordingly, in delivering the hidden message through the hidden message emoticon, differentiation by user grade, differentiation by user group, and the like may be possible. In addition, through the hidden message emoticon service, different content can be provided according to the user to be shared, so that more subdivided and detailed communication can be made according to the relationship between individuals.

1 is a diagram showing the configuration of a hidden message emoticon service system according to an embodiment of the present invention;
2 is a diagram illustrating a state in which a hidden message emoticon is transmitted from a first user terminal to a second user terminal according to an embodiment of the present invention;
3 is a diagram illustrating a state in which a hidden message emoticon is checked in a second user terminal according to an embodiment of the present invention;
4 is a block diagram showing the configuration of a server according to an embodiment of the present invention;
5 is a view showing each chat window screen after sending a hidden message emoticon from the first user terminal to the second user terminal according to an embodiment of the present invention;
6 is a flowchart illustrating a hidden message emoticon service method according to an embodiment of the present invention;
7 is a block diagram illustrating and describing a computing environment including a computing device suitable for use in example embodiments;

Hereinafter, specific embodiments of the present invention will be described with reference to the drawings. The following detailed description is provided to provide a comprehensive understanding of the methods, devices, and/or systems described herein. However, this is merely an example, and the present invention is not limited thereto.

In describing the embodiments of the present invention, if it is determined that the detailed description of the known technology related to the present invention may unnecessarily obscure the gist of the present invention, the detailed description thereof will be omitted. And, the terms to be described later are terms defined in consideration of functions in the present invention, which may vary according to intentions or customs of users and operators. Therefore, the definition should be made based on the content throughout this specification. The terminology used in the detailed description is for the purpose of describing embodiments of the present invention only, and should in no way be limiting. Unless explicitly used otherwise, expressions in the singular include the meaning of the plural. In this description, expressions such as “comprising” or “comprising” are intended to indicate certain features, numbers, steps, acts, elements, some or a combination thereof, one or more other than those described. It should not be construed to exclude the presence or possibility of other features, numbers, steps, acts, elements, or any part or combination thereof.

In the following description, the terms "transmission", "communication", "transmission", "reception" and other similar meanings of a signal or information are not only directly transmitted from one component to another component, but also a signal or information This includes passing through other components. In particular, to “transmit” or “transmit” a signal or information to a component indicates the final destination of the signal or information and does not imply a direct destination. The same is true for "reception" of signals or information. In addition, in this specification, when two or more data or information are "related", it means that when one data (or information) is acquired, at least a part of other data (or information) can be acquired based thereon.

Also, terms such as first and second may be used to describe various components, but the components should not be limited by the terms. The above terms may be used for the purpose of distinguishing one component from another component. For example, without departing from the scope of the present invention, a first component may be referred to as a second component, and similarly, a second component may also be referred to as a first component.

In addition, the term emoji is used as a concept similar to emoticons, and the technical ideas related to emoticons described in this specification can be applied in the same principle to means to which expressions for quickly and effectively conveying emotions or feelings, such as emojis, are applied. have.

1 is a diagram showing the configuration of a hidden message emoticon service system according to an embodiment of the present invention.

Referring to FIG. 1 , the hidden message emoticon service system 100 may include a first user terminal 102 , a second user terminal 104 , and a server 106 . The first user terminal 102 and the second user terminal 104 are communicatively connected to the server 106 via the communication network 150 .

In some embodiments, communication network 150 is the Internet, one or more local area networks, wide area networks, cellular networks, mobile networks, other types of networks, or such networks. may include combinations of these.

The first user terminal 102 and the second user terminal 104 are user terminals using the hidden message emoticon service. As the first user terminal 102 and the second user terminal 104 , various electronic devices capable of communicating with the server 106 such as a smart phone, a tablet PC, a notebook computer, and a desktop PC may be used.

Both the first user terminal 102 and the second user terminal 104 may transmit and receive hidden message emoticons, respectively, but hereinafter, for convenience of description, the first user terminal 102 transmits the hidden message emoticon, and the second A case in which the user terminal 104 receives the hidden message emoticon will be described as an example.

Here, the hidden message emoticon includes a hidden message in the emoticon, and when the sender sets a secret code after inputting the hidden message into the emoticon and transmits it, the hidden message is displayed on the screen only when the receiver enters the corresponding secret code.

That is, the sender can send the hidden message while sending the emoticon. At this time, the hidden message can be sent in the locked state (the message is locked and the contents cannot be checked) by inputting the secret code. Then, the receiver can view the hidden message only when the lock is released by entering the corresponding secret code.

A messenger application for implementing a hidden message emoticon service may be installed in each of the first user terminal 102 and the second user terminal 104 . The messenger application may be stored in computer-readable storage media of the first user terminal 102 and the second user terminal 104 . The messenger application includes a predetermined set of instructions executable by the processors of the first user terminal 102 and the second user terminal 104 . The instruction may cause the processors of the first user terminal 102 and the second user terminal 104 to perform an operation according to an exemplary embodiment. The computer-readable storage medium of the first user terminal 102 and the second user terminal 104 is an operating system for executing a set of instructions, such as a messenger application, on the first user terminal 102 and the second user terminal 104 . contains the components of For example, the operating system may be Apple's iOS or Google's Android.

The server 106 may manage the transmission and reception of hidden message emoticons between users who use the hidden message emoticon service. The server 106 may communicate with each of the messenger applications installed in the first user terminal 102 and the second user terminal 104 .

The server 106 may match and store the secret code with the hidden message of the hidden message emoticon input from the first user terminal 102 . The server 106 releases the lock state of the hidden message or sends a mismatch guide message according to whether the secret code input by the second user terminal 104 matches the secret code set by the first user terminal 102 . may be transmitted to the user terminal 104 .

2 is a diagram illustrating a state in which a hidden message emoticon is transmitted from a first user terminal to a second user terminal according to an embodiment of the present invention.

Referring to FIG. 2 , the first user terminal 102 may create a first chatting window 10 for chatting with the second user terminal 104 through a messenger application. Here, the user of the first user terminal 102 and the user of the second user terminal 104 have been illustrated as having a 1:1 chat, but the present invention is not limited thereto. Of course you can chat. In this case, the first user terminal 102 may transmit the hidden message emoticon 30 to a plurality of users.

The first chatting window 10 may include an emoticon selection window 12 through which the user can select an emoticon. The emoticon selection window 12 may include one or more emoticon groups 14 . In addition, each emoticon group 14 may include one or more emoticon images.

The user of the first user terminal 102 may select the emoticon group 14 and select an emoticon image from the selected emoticon group 14 to create a hidden message emoticon. An emoticon image A used as a hidden message emoticon in the emoticon group 14 may be displayed to be distinguished from a general emoticon image. For example, in the emoticon image (A) used as the hidden message emoticon, a red box may be displayed on the border and the character "hidden" may be displayed. However, the present invention is not limited thereto, and an emoticon image used as a hidden message emoticon may be displayed to be distinguished from other emoticon images through a separate mini icon or background.

When the user of the first user terminal 102 selects the emoticon image (A) used as the hidden message emoticon, the messenger application may display the first input window 16 to input the hidden message and the secret code. have. The first input window 16 may include an additional information input area 16a for attaching files such as photos and documents or inputting location information in addition to hidden messages.

The user of the first user terminal 102 enters the hidden message and the secret code in the first input window 16 , and then clicks the confirmation button 16b to transmit the hidden message emoticon to the second user terminal 104 . can Then, the hidden message emoticon 30 may be displayed in the second chatting window 20 of the second user terminal 104 .

Here, the server 106 may receive the emoticon image (A) used as the hidden message emoticon, the hidden message, and the secret code from the first user terminal 102 . The server 106 may transmit the emoticon image A received from the first user terminal 102 and the hidden message emoticon 30 including the hidden message to the second user terminal 104 . In this case, the server 106 may transmit the hidden message in the hidden message emoticon 30 to the second user terminal 104 in a locked state.

3 is a diagram illustrating a state in which a hidden message emoticon is checked in a second user terminal according to an embodiment of the present invention.

Referring to FIG. 3 , when the hidden message emoticon 30 is displayed in the second chatting window 20 of the second user terminal 104 , the user of the second user terminal 104 selects the hidden message emoticon 30 . When touched, the messenger application may display the second input window 22 for inputting a secret code.

Here, when the secret code input by the user (ie, the receiver) of the second user terminal 104 matches the secret code set by the user (ie, the sender) of the first user terminal 102, the hidden message emoticon ( 30), the locked state of the hidden message is released and displayed in the second chatting window 20 . On the other hand, when the secret code input by the user (ie, the receiver) of the second user terminal 104 does not match the secret code set by the user (ie, the sender) of the first user terminal 102, "correct code" Please input a discrepancy guidance message such as "is displayed in the second chat window 20.

In an exemplary embodiment, the server 106 may receive the secret code input to the second input window 22 from the second user terminal 104 . When the secret code received from the second user terminal 104 and the secret code received from the first user terminal 102 match, the server 106 unlocks the hidden message of the hidden message emoticon 30 and It can be displayed in the second chat window (20). When the secret code received from the second user terminal 104 and the secret code received from the first user terminal 102 do not match, the server 106 displays a mismatch guide message in the second chatting window 20 . can In this case, the user of the second user terminal 104 may re-enter the secret code.

Meanwhile, the user of the second user terminal 104 may know the secret code through another communication route (eg, e-mail, etc.) in relation to the user of the first user terminal 102 . That is, the sender and the receiver of the hidden message emoticon may mutually share a secret code.

4 is a block diagram showing the configuration of the server 106 according to an embodiment of the present invention.

Referring to FIG. 4 , the server 106 may include a communication module 111 , a hidden message management module 113 , and a storage module 115 .

The communication module 111 may communicate with the first user terminal 102 . Specifically, the communication module 111 may receive an emoticon image A used as a hidden message emoticon, a hidden message, and a secret code from the first user terminal 102 .

The communication module 111 may communicate with the second user terminal 104 . Specifically, the communication module 111 may transmit the hidden message emoticon 30 including the emoticon image A received from the first user terminal 102 and the hidden message to the second user terminal 104 . In this case, the hidden message may be transmitted in a locked state. The communication module 111 may receive a secret code for unlocking the locked state of the hidden message from the second user terminal 104 .

The hidden message management module 113 may check whether the secret code received from the first user terminal 102 matches the secret code received from the second user terminal 104 . When the secret code received from the first user terminal 102 and the secret code received from the second user terminal 104 match, the hidden message management module 113 unlocks the hidden message to unlock the second user terminal It can be displayed in the second chat window 20 of (104). When the secret code received from the first user terminal 102 and the secret code received from the second user terminal 104 do not match, the hidden message management module 113 sends a mismatch guide message to the second user terminal 104 . It can be displayed in the second chat window 20 of

The hidden message management module 113 may count the number of times the secret codes match when the first user terminal 102 transmits the hidden message emoticon 30 to a plurality of users. That is, the hidden message management module 113 receives each secret code from the plurality of second user terminals 104 , and counts the number of times that each received secret code matches the secret code received from the first user terminal 102 . can be counted

The hidden message management module 113 may not release the locked state of the hidden message even though the secret codes match when the number of times the secret codes match exceeds a preset reference number. That is, the hidden message management module 113 releases the locked state of the hidden message only when the number of times the secret code matches is less than or equal to the preset reference number, and when the number of times the secret code matches exceeds the preset reference number, The lock state of the hidden message may not be released. In this case, the hidden message management module 113 may transmit a guide message indicating that the reading of the hidden message is impossible to the second user terminal 104 .

In addition, the hidden message management module 113 may delete the hidden message connected to the hidden message emoticon 30 when the number of times the secret code matches exceeds a preset reference number. Also, the hidden message management module 113 may delete the hidden message of the corresponding hidden message emoticon 30 according to the request to delete the hidden message received from the first user terminal 102 . When the hidden message is deleted, when the hidden message emoticon 30 is touched on the second user terminal 104 , a message indicating that the hidden message has been deleted may be displayed in the second chatting window 20 .

The hidden message management module 113 may provide the number of times the secret code is matched to the first user terminal 102 . In an exemplary embodiment, the hidden message management module 113 counts the number of times the secret code matches through the first chatting window 10 (that is, the number of users who input the correct secret code) to the first user terminal 102 . can be provided as

The storage module 115 may match and store the emoticon image A, the hidden message, and the secret code received from the first user terminal 102, respectively. The storage module 115 may store the secret code received from the second user terminal 104 .

In this specification, a module may mean a functional and structural combination of hardware for carrying out the technical idea of the present invention and software for driving the hardware. For example, the "module" may mean a logical unit of a predetermined code and a hardware resource for executing the predetermined code, and does not necessarily mean physically connected code or a single type of hardware.

5 is a view showing each chat window screen after sending a hidden message emoticon from the first user terminal to the second user terminal according to an embodiment of the present invention.

5, after transmitting the hidden message emoticon 30 from the first user terminal 102 to the second user terminal 104, touch the hidden message emoticon 30 in the first chatting window 10 ( or click), the number of times the secret code is matched (that is, the number of users who entered the correct secret code) may be displayed in the information window 18 .

Also, the user of the first user terminal 102 may delete the hidden message by clicking the delete button 18a in the first chatting window 10 . When the user of the first user terminal 102 clicks the delete button 18a , the first user terminal 102 transmits a request to delete the hidden message to the server 106 . The server 106 may delete the hidden message of the corresponding hidden message emoticon 30 according to the request to delete the hidden message.

At this time, when the user touches the hidden message emoticon 30 in the second chat window 20 of the second user terminal 104, a message indicating that the hidden message has been deleted (for example, "there is no message content", etc.) may be displayed in the second chatting window 20 .

When hidden message emoticons are used on Facebook's bulletin boards or in group chat rooms of messengers, hidden message emoticons can be exposed to many users, but only users who can enter the secret code correctly among those users are included in the hidden message emoticons. You can see hidden messages.

According to an embodiment of the present invention, when a hidden message emoticon is used in a Facebook bulletin board or a group chat room of a messenger, the hidden message emoticon may be exposed to many users, but the secret code can be accurately entered among those users. Only the user who has the hidden message will be able to see the hidden message included in the hidden message emoticon. For example, when content containing hidden message emoticons including smiley faces and food photos is posted on social media such as Facebook, Instagram, and Twitter, general users who can read this post can read the food photos and smiley faces. Users who only see the face emoticons, but know the secret code of the hidden message emoticons, can see more content other than food photos by touching or clicking the smiley face emoticon and then entering the secret code. In addition, when the hidden message emoticon is displayed in the group chat room, all users in the corresponding chat room can see the hidden message emoticon. However, among many users who can see the hidden message emoticons exposed in the group chat room, only users who know and enter the secret code accurately can see the hidden message, so a special message can be selectively sent only to a specific user or a specific user group. can transmit Accordingly, in the hidden message emoticon service system according to an embodiment of the present invention, differentiation by user grade, differentiation by user group, etc. may be possible in delivering a message. In addition, through an embodiment of the present invention, since the content provided according to the sharing target user can be varied, more subdivided and detailed communication can be made according to the relationship between individuals.

6 is a flowchart illustrating a hidden message emoticon service method according to an embodiment of the present invention. In the illustrated flowchart, the method is described by dividing the method into a plurality of steps, but at least some of the steps are performed in a different order, are performed in combination with other steps, are omitted, are performed in separate steps, or are not shown. One or more steps may be added and performed.

Referring to FIG. 6 , the server 106 receives an emoticon image, a hidden message, and a secret code set in the hidden message from the first user terminal 102 ( S 102 ). The server 106 may match and store the received emoticon image, the hidden message, and the secret code set in the hidden message.

Next, the server 106 transmits the hidden message emoticon including the emoticon image and the hidden message to the second user terminal 104, but transmits the hidden message in a locked state (S 104).

The server 106 may identify the second user terminal 104 as the recipient of the hidden message emoticon through the chatting counterpart of the first chatting window 10 executed in the first user terminal 102 . When there are a plurality of chatting counterparts in the first chatting window 10 , the server 106 may transmit a hidden message emoticon to the plurality of second user terminals 104 .

Next, the server 106 checks whether the secret code received from the second user terminal 104 matches the secret code received from the first user terminal 102 ( S106 ).

As a result of checking in step S106, if the secret codes match, the server 106 counts the number of times the secret codes match (S108). On the other hand, if the secret codes do not match, the server 106 transmits a mismatch guide message to the second user terminal 104 (S 110).

Next, the server 106 checks whether the number of times the secret code matches exceeds a preset reference number (S 112).

As a result of checking in step S 112 , if the number of times the secret code matches does not exceed the preset reference number, the server 106 releases the lock state of the hidden message so that it is displayed on the second user terminal 104 (S) 114).

As a result of checking in step S 112 , when the number of matching secret codes exceeds a preset reference number, the server 106 prevents the locked state of the hidden message from being released ( S 116 ).

7 is a block diagram illustrating and describing a computing environment 10 including a computing device suitable for use in example embodiments. In the illustrated embodiment, each component may have different functions and capabilities other than those described below, and may include additional components in addition to those described below.

The illustrated computing environment 10 includes a computing device 12 . In one embodiment, computing device 12 may be first user terminal 102 . Also, the computing device 12 may be the second user terminal 104 . Computing device 12 may also be server 106 .

Computing device 12 includes at least one processor 14 , computer readable storage medium 16 , and communication bus 18 . The processor 14 may cause the computing device 12 to operate in accordance with the exemplary embodiments discussed above. For example, the processor 14 may execute one or more programs stored in the computer-readable storage medium 16 . The one or more programs may include one or more computer-executable instructions that, when executed by the processor 14, configure the computing device 12 to perform operations in accordance with the exemplary embodiment. can be

Computer-readable storage medium 16 is configured to store computer-executable instructions or program code, program data, and/or other suitable form of information. The program 20 stored in the computer-readable storage medium 16 includes a set of instructions executable by the processor 14 . In one embodiment, computer-readable storage medium 16 includes memory (volatile memory, such as random access memory, non-volatile memory, or a suitable combination thereof), one or more magnetic disk storage devices, optical disk storage devices, flash It may be memory devices, other forms of storage medium accessed by computing device 12 and capable of storing desired information, or a suitable combination thereof.

Communication bus 18 interconnects various other components of computing device 12 , including processor 14 and computer readable storage medium 16 .

Computing device 12 may also include one or more input/output interfaces 22 and one or more network communication interfaces 26 that provide interfaces for one or more input/output devices 24 . The input/output interface 22 and the network communication interface 26 are coupled to the communication bus 18 . Input/output device 24 may be coupled to other components of computing device 12 via input/output interface 22 . Exemplary input/output device 24 may include a pointing device (such as a mouse or trackpad), a keyboard, a touch input device (such as a touchpad or touchscreen), a voice or sound input device, various types of sensor devices, and/or imaging devices. input devices and/or output devices such as display devices, printers, speakers and/or network cards. The exemplary input/output device 24 may be included in the computing device 12 as a component constituting the computing device 12 , and may be connected to the computing device 12 as a separate device distinct from the computing device 12 . may be

Although representative embodiments of the present invention have been described in detail above, those of ordinary skill in the art to which the present invention pertains will understand that various modifications are possible without departing from the scope of the present invention with respect to the above-described embodiments. . Therefore, the scope of the present invention should not be limited to the described embodiments, but should be defined by the claims described below as well as the claims and equivalents.

100: Hidden message emoticon service system
102: first user terminal
104: second user terminal
106: server
111: communication module
113: hidden message management module
115: storage module

Claims (12)

a first user terminal for transmitting an emoticon image, a hidden message, and a secret code set in the hidden message;
a server receiving the emoticon image, the hidden message, and the secret code from the first user terminal, and transmitting a hidden message emoticon including the emoticon image and the hidden message, wherein the hidden message is locked; and
and a second user terminal that receives the hidden message emoticon from the server and transmits a secret code for unlocking the hidden message to the server,
The server is
It is checked whether the secret code received from the second user terminal matches the secret code received from the first user terminal. A hidden message emoticon service system that makes it appear.
delete The method according to claim 1,
The server is
When the hidden message emoticon is transmitted to a plurality of second user terminals, each secret code is received from the plurality of second user terminals, and each received secret code matches the secret code received from the first user terminal. A hidden message emoticon service system that counts the number of times.
4. The method according to claim 3,
The server is
When the number of times the secret code matches exceeds a preset reference number, the hidden message emoticon service system does not unlock the hidden message even though the secret code matches.
4. The method according to claim 3,
The server is
When the number of times the secret code matches exceeds a preset reference number, the hidden message emoticon service system for deleting the hidden message of the hidden message emoticon.
4. The method according to claim 3,
The server is
A hidden message emoticon service system that provides the number of times the secret code matches to the first user terminal.
one or more processors, and
A method performed in a computing device having a memory storing one or more programs to be executed by the one or more processors, the method comprising:
Receiving an emoticon image, a hidden message, and a secret code set in the hidden message from the first user terminal;
transmitting a hidden message emoticon including the emoticon image and the hidden message to a second user terminal, wherein the hidden message is locked; and
receiving a secret code for unlocking the locked state of the hidden message from the second user terminal;
checking whether the secret code received from the second user terminal matches the secret code received from the first user terminal; and
When the secret codes match, unlocking the locked state of the hidden message and displaying the hidden message in the second user terminal, the hidden message emoticon service method.
delete 8. The method of claim 7,
receiving a secret code from each of the plurality of second user terminals when the hidden message emoticon is transmitted to a plurality of second user terminals; and
The method further comprising the step of counting the number of times that each received secret code and the secret code received from the first user terminal match.
10. The method of claim 9,
After the counting step,
When the number of times the secret code matches exceeds a preset reference number, the method further comprising the step of not releasing the lock state of the hidden message even though the secret code matches.
10. The method of claim 9,
After the counting step,
When the number of times the secret code matches exceeds a preset reference number, the method further comprising the step of deleting a hidden message of the hidden message emoticon.
10. The method of claim 9,
After the counting step,
The hidden message emoticon service method further comprising the step of providing the number of times the secret code matches to the first user terminal.

Images