EP2795477B1 - Système de confidentialité des données - Google Patents
Système de confidentialité des données Download PDFInfo
- Publication number
- EP2795477B1 EP2795477B1 EP12859586.5A EP12859586A EP2795477B1 EP 2795477 B1 EP2795477 B1 EP 2795477B1 EP 12859586 A EP12859586 A EP 12859586A EP 2795477 B1 EP2795477 B1 EP 2795477B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- message
- user
- users
- ciphertext
- computer system
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 claims description 39
- 230000001131 transforming effect Effects 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 description 15
- 230000009466 transformation Effects 0.000 description 14
- 238000004891 communication Methods 0.000 description 11
- 230000006870 function Effects 0.000 description 7
- 238000012545 processing Methods 0.000 description 5
- 238000010295 mobile communication Methods 0.000 description 4
- 230000006855 networking Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000001627 detrimental effect Effects 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000037361 pathway Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000003556 assay Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000006837 decompression Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/03—Protecting confidentiality, e.g. by encryption
- H04W12/033—Protecting confidentiality, e.g. by encryption of the user plane, e.g. user's traffic
Definitions
- the disclosure relates generally to mobile device applications, and more particularly, to a privacy system for a mobile device application.
- SMS short message service
- US publication US 2007/0266095 to Billsus discloses a method that provides employees and/or associates the opportunity to share corporate knowledge via the storage of email with user awareness and consent features. All employees who are allowed to access the share content according to the sharing privileges can subsequently find or discover content via full-text searches or other means. Awareness and consent over email sharing is provided via automated message modification and message generation whenever needed.
- US publication US 2011/0271093 to McKenna relates to techniques that involve encryption approaches for data from multiple parties, and enable those parties to discover information that is held in common by the parties without disclosing to any party information that is not held in common by the parties.
- aspects of the invention provide computer implemented methods. a computer program and computer systems as described in the appended independent and dependent claims.
- the illustrative aspects of the invention are designed to solve one or more of the problems herein described and/or one or more other problems not discussed.
- aspects of the invention provide a method of sending and receiving encrypted messages between users within an associated group of users.
- set means one or more (i.e., at least one) and the phrase “any solution” means any now known or later developed solution.
- SMS short message service
- a method includes: receiving a first message from a first user within the group of users, wherein the first message includes proprietary information; encrypting the first message into ciphertext; transforming the ciphertext into a second message, wherein the second message includes quotidian information; and sending the second message to a second user within the group of users.
- FIG. 1 shows an illustrative environment 10 for sending and receiving encrypted messages according to embodiments of the invention.
- environment 10 includes a computer system 20 that can perform a process described herein in order to send and receive encrypted messages.
- computer system 20 is shown including an encryption/decryption program 30, which makes computer system 20 operable to send and receive encrypted messages by performing a process described herein.
- Computer system 20 is shown including a processing component 22 (e.g., one or more processors), a storage component 24 (e.g., a storage hierarchy), an input/output (I/O) component 26 (e.g., one or more I/O interfaces and/or devices), and a communications pathway 28.
- processing component 22 executes program code, such as encryption/decryption program 30, which is at least partially fixed in storage component 24. While executing program code, processing component 22 can process data, which can result in reading and/or writing transformed data from/to storage component 24 and/or I/O component 26 for further processing.
- Pathway 28 provides a communications link between each of the components in computer system 20.
- I/O component 26 can comprise one or more human I/O devices, which enable a plurality of users 1A, 1B to interact with computer system 20 and/or one or more communications devices to enable a system user 1A, 1B to communicate with computer system 20 using any type of communications link.
- encryption/decryption program 30 can manage a set of interfaces (e.g., graphical user interface(s), application program interface, and/or the like) that enable human and/or system users 1A, 1B to interact with encryption/decryption program 30. Further, encryption/decryption program 30 can manage (e.g., store, retrieve, create, manipulate, organize, present, etc.) the data, such as data in database 40, using any solution.
- computer system 20 can comprise one or more general purpose computing articles of manufacture (e.g., computing devices) capable of executing program code, such as encryption/decryption program 30, installed thereon.
- program code means any collection of instructions, in any language, code or notation, that cause a computing device having an information processing capability to perform a particular action either directly or after any combination of the following: (a) conversion to another language, code or notation; (b) reproduction in a different material form; and/or (c) decompression.
- encryption/decryption program 30 can be embodied as any combination of system software and/or application software.
- encryption/decryption program 30 can be implemented using a set of modules 32.
- a module 32 can enable computer system 20 to perform a set of tasks used by encryption/decryption program 30, and can be separately developed and/or implemented apart from other portions of encryption/decryption program 30.
- the term "component” means any configuration of hardware, with or without software, which implements the functionality described in conjunction therewith using any solution, while the term “module” means program code that enables a computer system 20 to implement the actions described in conjunction therewith using any solution.
- a module is a substantial portion of a component that implements the actions. Regardless, it is understood that two or more components, modules, and/or systems may share some/all of their respective hardware and/or software. Further, it is understood that some of the functionality discussed herein may not be implemented or additional functionality may be included as part of computer system 20.
- each computing device can have only a portion of encryption/decryption program 30 fixed thereon (e.g., one or more modules 32).
- encryption/decryption program 30 are only representative of various possible equivalent computer systems that may perform a process described herein.
- the functionality provided by computer system 20 and encryption/decryption program 30 can be at least partially implemented by one or more computing devices that include any combination of general and/or specific purpose hardware with or without program code.
- the hardware and program code, if included, can be created using standard engineering and programming techniques, respectively.
- computer system 20 when computer system 20 includes multiple computing devices, the computing devices can communicate over any type of communications link. Further, while performing a process described herein, computer system 20 can communicate with one or more other computer systems using any type of communications link.
- the communications link can comprise any combination of various types of optical fiber, wired, and/or wireless links; comprise any combination of one or more types of networks; and/or utilize any combination of various types of transmission techniques and protocols.
- encryption/decryption program 30 enables computer system 20 to send and receive encrypted messages between users in an associated group of users.
- FIG. 1 It is understood that although only two users 1A, 1B are shown in FIG. 1 , there may be any number of users in environment 10. As will be described herein, users 1A, 1B are associated together as a group of users. Further, although a message 4 ( FIG. 2 ) is shown as being sent from user 1A to user 1B, it is understood that this is for exemplary purposes only and that message 4 may be sent from any user within an associated group of users.
- Message 4 includes proprietary and sensitive information and may include either "plaintext” or “multimedia” information.
- "Plaintext” may include an ordinary text (i.e., from user 1A) and may be clear text that is typed, or Universal Character Set (UCS) Transformation Format (UTF) - 8 bit characters that represent any content that is deemed proprietary or sensitive.
- "multimedia” information may include data from assorted multi-media files, including, but not limited to: jpeg, tif mp3, mp4, mov, and wav formats.
- Message 4 that includes multimedia content is specially encrypted, so that the multimedia data in message 4 is treated the same as "plaintext”.
- a user may create an account, via client device 2A, with encryption/decryption program 30.
- Client devices 2A, 2B may include any networked device, such as, but not limited to a mobile device (smartphone), tablet, computing device, etc.
- An account may be generated by supplying information associated with user 1A, such as an e-mail address, a mobile phone number, an address, and billing information.
- user 1A may create a group of associated users (e.g., user 1B).
- a passphrase an known in the art, is associated with this group of associated users.
- User 1A may create a unique passphrase, or encryption/decryption program 30 may randomly generate a passphrase. Additionally, user 1A may select to prepend or append a keyphrase to a quotidian message 8 (after encryption of message 4) to aid in user 1B being able to readily assay that a quotidian message 8 ( FIG. 2 ) is an encryption of an unknown message (message 4). For example, user 1A may choose to prepend "HEY! to the beginning of every quotidian message 8.
- user 1A may select the method of transformation for encrypting messages (e.g., message 4 of FIG. 2 ), which includes proprietary information, into a quotidian (i.e., mundane, ordinary) message 8.
- a quotidian i.e., mundane, ordinary
- user 1A may select a canonic transformation of a message 4 or a non-canonic transformation of a message 4. If a canonic transformation of message 4 is selected, the quotidian message 8 is based on several factors, such as a sentence type, a clause count, and/or a sentence mode. If a non-canonic transformation of message 4 is selected, the quotidian message 8 is based on a user-defined database of phrases (such as themes and/or phrases used in social networking sources).
- user 1A may decide to send users within the associated group of users (user 1B) a message, i.e., message 4, that includes proprietary or secret information.
- User 1A sends message 4 (via client device 1A, FIG. 1 ) to encryption/decryption program 30. That is, user 1A may send message 4 via a mobile application on a mobile device, or via a website hosted on computing device, or any other method.
- Encryption program 50 receives this message 4, and encrypts message 4 into ciphertext message 6.
- encryption program 50 may employ a Rijndael algorithm, as known in the art.
- any other now known or later developed algorithm for encrypting message 4 into a ciphertext message 6 may be used.
- the passphrase associated with the group of users 1A, 1B is used in the algorithm.
- the message 4 that is sent from user 1A is not stored, however, the ciphertext message 6 is stored in database 40.
- the ciphertext message may be stored or associated with the generated quotidian message 8 in the database, e.g., as a "linked pair". Other information may likewise be stored with the linked pair, e.g., user information, etc.
- Transformation program 52 receives the ciphertext message 6 and transforms the ciphertext message 6 into a quotidian message 8. That is, quotidian message 8 is a mundane, normal, non-proprietary message. There is no 1:1 or symmetric relationship between the encrypted ciphertext message 6 and the quotidian message 8. That is, there is no way to recover the encrypted ciphertext message 6 directly from the quotidian message 8. Further, the content of the quotidian message 8 is utterly different from the original proprietary message 4, e.g., containing nothing more than casual "chit-chat.” The resulting quotidian message 8 appears as an innocuous, even trivial communication that is unrelated in meaning and relevance to the original proprietary message.
- the quotidian message 8 may contain the semantic coherency of the sort of ubiquitous casual conversations found on mobile devices. So much so, the quotidian message 8 can be publically posted to such social networking sites such as Facebook and Twitter.
- an original proprietary message may state: "Bob - I have this great idea for an invention - let's meet at the usual coffee house tomorrow at 3PM ok?" The resulting quotidian message may then appear as: "Hi - I haven't heard from you in a while. My new car is great - hope things are well at home - Alice"
- the original message 4 and quotidian message 8 are unrelated in meaning and relevance.
- the quotidian message 8 is stored or associated with the ciphertext message 6 in database 40, and is then sent to the users within the associated group of users (e.g., user 1B). Members in the associated group who receive the message 8 will be able to discern whether a message is not a normal message, e.g., based on knowledge that the sender is a member of the group, the lack of context of the message, pre-agreed terms or phrases, etc.
- transformation program 52 may employ a canonic transformation that uses canonic factors of message 4 for the transformation. For example, a sentence type, a clause count, and/or a sentence mode of message 4 may be used. The following describes an algorithm in transforming ciphertext message 6 into quotidian message 8.
- Ciphertext message 6 is first converted and stored as an amplified Base-64 radix array of ASCII text.
- the array may be denoted as ⁇ b[...i...] ⁇ where i assumes the index values of the array from 0 ... length (b).
- Transformation program 52 assumes A[x] be an associative array mapping byte values (represented in amplified Base-64) to positional array indices (integers): A ' A ' ⁇ 0 , ' B ' ⁇ 1 , ' C ' ⁇ 2 ... Thus, A 0 ⁇ ' A ' a n d A ' A ' ⁇ 0 .
- F(i) ⁇ j is defined, which gets a byte value of b[] at position i and returns a positional value j.
- the return values for these specific values In Table 1 below, the return values for specific values provide the canonic factors.
- transformation program 52 defines the following: i)
- the "canonic character" K of ciphertext 6 (for example, represented as array b[]) is the set of construction rules defined by the index triple ⁇ 0,1,m ⁇ .
- K(b[0,1,m]) determines the nature of an English language sentence according to the rules determined by the outcomes of the table above.
- the return of K(b[0,1,m]) is a Canonic Triple.
- S(K(b[0,1,m])) ⁇ U takes a Canonic Triple and creates the quotidian message 8 -- i.e. a sentence in English constrained to 160 characters.
- the function S() is called the Transform Function.
- RDB(i,C_DB) retrieves UTM strings from a database of clauses. Namely, index i is the ith clause of a specific table within database 40.
- the table variants the specific table are customizable as to their "Mode” (i.e. "Negative,” “Zero,” “Positive”), and their sentence type (Declarative, Interrogative, and Exclamatory).
- the specific ciphertext 6 depends on the passphrase generated for the associated group of users or created by user 1A.
- the canonic character is defined as: 'TDP'.
- a triplet such as "TDP” may yield: "I haven't heard from you. Things are okay with me these days. Hope to hear from you”.
- TDP triplet
- the sentences are declarative, and the sentence is positive in inflection or mode.
- a user 1A may select a non-canonic transformation of message 4 into quotidian message 8.
- transformation of message 4 would be based on a user-defined database of phrases. That is, a user 1A may select a theme, such as, but not limited to, news, sports, economic markets, geographic and/or meteorological subjects, entertainment and media, and/or technology and science.
- Database 40 would include a plurality of tables that include phrases within these themes or topics.
- user 1A may select a database of automated messages from a social networking source that user 1A listed in creating the associated group of users.
- quotidian message 8 may include a hyperlink that points user 1B to a website that stores the ciphertext 6 associated with quotidian message 8.
- user 1B may receive quotidian message 8 in the form of a SMS message, which would be limited to 160 characters.
- user 1A may post quotidian message 8 to a social networking website, where user 1B (and any other user associated with the group of users) are able to view postings.
- user 1A may post quotidian message 8 to a Twitter® account, which is limited to 140 characters.
- user 1B may send the quotidian message 8 to decryption program 54. That is, user 1B may log into a mobile application on a mobile device (i.e., client device 2B) or a website. It is noted that user 1B will know, by assaying the quotidian message 8, that quotidian message 8 is not a "true" message. That is, based on prior knowledge of user 1A creating an associated group of users for sharing proprietary information, and knowledge of user 1A in general, user 1B will be able to ascertain that quotidian message 8 must be decrypted.
- Decryption program 54 is able to receive and process the quotidian message 8 to obtain message 4.
- the receiving user can resubmit the quotidian message 8 back to the decryption program 54 (e.g., using a client program on a smartphone) which will then search the database 40 and retrieve the associated encrypted ciphertext message 6.
- the encrypted ciphertext message 6 will then be decrypted by decryption program 54 to generate the original message 4.
- message 4 is only displayed for user 1B (via client device 2B) and is not sent to user 1B. Once the message 4 is viewed, the message 4 is deleted. In this way, proprietary messages may be sent from user 1A to user 1B, both privately and efficiently.
- encryption/decryption program 30 may be set to automatically delete the message 4 after user 1B has read message 4, or encryption/decryption program 30 may be set to allow user 1B to manually delete message 4 after he/she has read the message 4. Further, in initializing an account and/or an associated group of users, user 1A may be allowed to specify that encryption/decryption program 30 will automatically delete message 4 after user1B has read message 4.
- the invention provides a computer program fixed in at least one computer-readable medium, which when executed, enables a computer system to send and receive encrypted messages.
- the computer-readable medium includes program code, such as encryption/decryption program 30 ( FIG. 1 ), which implements some or all of a process described herein.
- the term "computer-readable medium” comprises one or more of any type of tangible medium of expression, now known or later developed, from which a copy of the program code can be perceived, reproduced, or otherwise communicated by a computing device.
- the computer-readable medium can comprise: one or more portable storage articles of manufacture; one or more memory/storage components of a computing device; paper; and/or the like.
- the invention provides a method of providing a copy of program code, such as encryption/decryption program 30 ( FIG. 1 ), which implements some or all of a process described herein.
- a computer system can process a copy of program code that implements some or all of a process described herein to generate and transmit, for reception at a second, distinct location, a set of data signals that has one or more of its characteristics set and/or changed in such a manner as to encode a copy of the program code in the set of data signals.
- an embodiment of the invention provides a method of acquiring a copy of program code that implements some or all of a process described herein, which includes a computer system receiving the set of data signals described herein, and translating the set of data signals into a copy of the computer program fixed in at least one computer-readable medium.
- the set of data signals can be transmitted/received using any type of communications link.
- the invention provides a method of generating a system for sending and receiving encrypted messages.
- a computer system such as computer system 20 ( FIG. 1 ) can be obtained (e.g., created, maintained, made available, etc.) and one or more components for performing a process described herein can be obtained (e.g., created, purchased, used, modified, etc.) and deployed to the computer system.
- the deployment can comprise one or more of: (1) installing program code on a computing device; (2) adding one or more computing and/or I/O devices to the computer system; (3) incorporating and/or modifying the computer system to enable it to perform a process described herein; and/or the like.
- aspects of the invention can be implemented as part of a business method that performs a process described herein on a subscription, advertising, and/or fee basis. That is, a service provider could offer to send and receive encrypted messages as described herein.
- the service provider can manage (e.g., create, maintain, support, etc.) a computer system, such as computer system 20 ( FIG. 1 ), that performs a process described herein for one or more customers.
- the service provider can receive payment from the customer(s) under a subscription and/or fee agreement, receive payment from the sale of advertising to one or more third parties, and/or the like.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Telephonic Communication Services (AREA)
- Storage Device Security (AREA)
- Information Transfer Between Computers (AREA)
Claims (15)
- Procédé mis en oeuvre par ordinateur d'échange de messages privés entre des utilisateurs dans un groupe associé d'utilisateurs, le procédé comprenant :la réception d'un premier message (4) depuis un premier utilisateur (1A) dans le groupe d'utilisateurs, dans lequel le premier message comporte des informations privées ;le cryptage (50) du premier message en texte chiffré (6) ;la transformation du texte chiffré en un second message (8), dans lequel le second message comporte un message quotidien comprenant un contenu anodin non associé en signification oupertinence au premier message ; etla production en sortie du second message pour un second utilisateur (1B) dans le groupe d'utilisateurs.
- Procédé mis en oeuvre par ordinateur selon la revendication 1, dans lequel la transformation du texte chiffré en le second message comporte l'évaluation d'une pluralité de facteurs canoniques du texte chiffré.
- Procédé mis en oeuvre par ordinateur selon la revendication 2, dans lequel la pluralité de facteurs canoniques comporte un type de phrase, un compte de clauses et un mode de phrase.
- Procédé mis en oeuvre par ordinateur selon la revendication 1, dans lequel la transformation du texte chiffré en le second message comporte l'utilisation d'une base de données de phrases du second message définie par l'utilisateur.
- Procédé mis en oeuvre par ordinateur selon la revendication 4, dans lequel la base de données définie par l'utilisateur comporte l'une : d'une base de données de catégories thématiques ou d'une base de données comportant des messages automatisés provenant d'une source de réseau social.
- Procédé mis en oeuvre par ordinateur selon la revendication 1, dans lequel le second message comporte un hyperlien.
- Procédé mis en oeuvre par ordinateur selon la revendication 1, comprenant en outre :en réponse à l'évaluation par le second utilisateur que le second message est un message quotidien,la réception du second message ;le décryptage du second message en le premier message ; etl'affichage du premier message au second utilisateur.
- Programme informatique comprenant un code de programme mis en oeuvre dans au moins un support lisible par ordinateur, lequel, à son exécution, permet à un système informatique de mettre en oeuvre le procédé d'échange de messages privés entre des utilisateurs dans un groupe associé d'utilisateurs selon l'une quelconque des revendications 1 à 7.
- Système informatique (10, 20) comportant un processeur et une mémoire pour échanger des messages privés entre des utilisateurs dans un groupe associé d'utilisateurs, le système informatique étant exploitable pour :recevoir un premier message (4) depuis un premier utilisateur (1A ; 1B) dans le groupe d'utilisateurs, dans lequel le premier message comporte des informations privées ;crypter (30 ; 50) le premier message en texte chiffré (6) ;transformer le texte chiffré en un second message (8), dans lequel le second message comporte un message quotidien sans relation pertinente avec le premier message ;stocker le second message et le texte chiffré en tant que paire liée ; etproduire en sortie le second message pour un second utilisateur (1B ; 1A) dans le groupe d'utilisateurs.
- Système informatique selon la revendication 9, dans lequel la transformation du texte chiffré en le second message comporte l'évaluation d'une pluralité de facteurs canoniques du texte chiffré.
- Système informatique selon la revendication 10, dans lequel la pluralité de facteurs canoniques comporte un type de phrase, un compte de clauses et un mode de phrase.
- Système informatique selon la revendication 9, dans lequel la transformation du texte chiffré en le second message comporte l'utilisation d'une base de données de phrases du second message définie par l'utilisateur.
- Système informatique selon la revendication 12, dans lequel la base de données définie par l'utilisateur comporte l'une : d'une base de données de catégories thématiques ou d'une base de données comportant des messages automatisés provenant d'une source de réseau social.
- Système informatique selon la revendication 9, dans lequel le second message comporte un hyperlien.
- Système informatique selon la revendication 9, le système informatique étant exploitable en outre pour :recevoir le second message ;décrypter le second message en le premier message ; etafficher le premier message au second utilisateur.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201161577323P | 2011-12-19 | 2011-12-19 | |
PCT/US2012/070311 WO2013096292A1 (fr) | 2011-12-19 | 2012-12-18 | Système de confidentialité des données |
Publications (3)
Publication Number | Publication Date |
---|---|
EP2795477A1 EP2795477A1 (fr) | 2014-10-29 |
EP2795477A4 EP2795477A4 (fr) | 2015-10-07 |
EP2795477B1 true EP2795477B1 (fr) | 2018-07-25 |
Family
ID=48669409
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP12859586.5A Active EP2795477B1 (fr) | 2011-12-19 | 2012-12-18 | Système de confidentialité des données |
Country Status (4)
Country | Link |
---|---|
US (3) | US8935531B2 (fr) |
EP (1) | EP2795477B1 (fr) |
DK (1) | DK2795477T3 (fr) |
WO (1) | WO2013096292A1 (fr) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP3247081A1 (fr) * | 2016-05-19 | 2017-11-22 | MyBlix Software GmbH | Procédé et système pour fournir une communication codée entre des utilisateurs d'un réseau |
Family Cites Families (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE69218961T2 (de) | 1991-11-05 | 1997-07-24 | Thomson Multimedia Sa | Verfahren, sende- und empfangseinrichtung zum modulobetrieb |
US5349642A (en) | 1992-11-03 | 1994-09-20 | Novell, Inc. | Method and apparatus for authentication of client server communication |
US6912658B1 (en) * | 1997-08-22 | 2005-06-28 | Purdue Research Foundation | Hiding of encrypted data |
US6038549A (en) * | 1997-12-22 | 2000-03-14 | Motorola Inc | Portable 1-way wireless financial messaging unit |
DE19910621C2 (de) | 1999-03-10 | 2001-01-25 | Thomas Poetter | Vorrichtung und Verfahren zum Verbergen von Informationen und Vorrichtung und Verfahren zum Extrahieren von Informationen |
US20040205457A1 (en) * | 2001-10-31 | 2004-10-14 | International Business Machines Corporation | Automatically summarising topics in a collection of electronic documents |
US20040260921A1 (en) | 2002-07-18 | 2004-12-23 | Treadwell William S. | Cryptographic method, system and engine for enciphered message transmission |
US7356463B1 (en) | 2003-12-18 | 2008-04-08 | Xerox Corporation | System and method for detecting and decoding semantically encoded natural language messages |
US7610627B1 (en) * | 2004-01-23 | 2009-10-27 | Acxiom Corporation | Secure data exchange technique |
US7826611B2 (en) | 2005-10-17 | 2010-11-02 | Palo Alto Research Center Incorporated | System and method for exchanging a transformed message with enhanced privacy |
US20080189292A1 (en) * | 2007-02-02 | 2008-08-07 | Jed Stremel | System and method for automatic population of a contact file with contact content and expression content |
US20070266095A1 (en) | 2006-05-12 | 2007-11-15 | Fuji Xerox Co., Ltd. | Seamless electronic mail capture with user awareness and consent |
US7646868B2 (en) | 2006-08-29 | 2010-01-12 | Intel Corporation | Method for steganographic cryptography |
US20090046848A1 (en) | 2007-08-15 | 2009-02-19 | Lockheed Martin Corporation | Encryption management system |
US8738683B2 (en) * | 2008-09-15 | 2014-05-27 | Vaultive Ltd. | System, apparatus and method for encryption and decryption of data transmitted over a network |
-
2012
- 2012-12-18 WO PCT/US2012/070311 patent/WO2013096292A1/fr active Application Filing
- 2012-12-18 EP EP12859586.5A patent/EP2795477B1/fr active Active
- 2012-12-18 US US13/995,815 patent/US8935531B2/en active Active
- 2012-12-18 DK DK12859586.5T patent/DK2795477T3/en active
-
2014
- 2014-12-09 US US14/564,702 patent/US9325674B2/en not_active Expired - Fee Related
-
2015
- 2015-04-22 US US14/693,262 patent/US9276915B2/en active Active
Also Published As
Publication number | Publication date |
---|---|
US9276915B2 (en) | 2016-03-01 |
US20150229615A1 (en) | 2015-08-13 |
US20150095647A1 (en) | 2015-04-02 |
US9325674B2 (en) | 2016-04-26 |
DK2795477T3 (en) | 2018-10-08 |
EP2795477A1 (fr) | 2014-10-29 |
WO2013096292A1 (fr) | 2013-06-27 |
US8935531B2 (en) | 2015-01-13 |
EP2795477A4 (fr) | 2015-10-07 |
US20140298015A1 (en) | 2014-10-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9825925B2 (en) | Method and apparatus for securing sensitive data in a cloud storage system | |
US9426126B2 (en) | Method and system for automatic generation of context-aware cover message | |
US10044654B2 (en) | Operating a match cooperative without handling personally identifiable information | |
CN112800472B (zh) | 一种基于微服务架构工业互联网标识数据保护系统 | |
US10587585B2 (en) | System and method of presenting dynamically-rendered content in structured documents | |
US8769260B1 (en) | Messaging system with user-friendly encryption and decryption | |
US10114900B2 (en) | Methods and systems for generating probabilistically searchable messages | |
US20130179684A1 (en) | Encrypted database system, client terminal, encrypted database server, natural joining method, and program | |
CN108520183A (zh) | 一种数据存储方法及装置 | |
US8769302B2 (en) | Encrypting data and characterization data that describes valid contents of a column | |
RU2724293C2 (ru) | Персональный поисковый индекс с повышенной конфиденциальностью | |
CN104243149A (zh) | 加、解密方法,装置和服务器 | |
JP5140026B2 (ja) | データベース処理方法、データベース処理プログラム、および、暗号化装置 | |
US10476661B2 (en) | Polynomial-based homomorphic encryption | |
CN103646068B (zh) | 加密方法、解密方法、群发信息的方法及其对应装置 | |
EP2795477B1 (fr) | Système de confidentialité des données | |
CN110493212A (zh) | 一种通用邮件端到端加密方法 | |
CN110709870A (zh) | 智能成员管理 | |
CN112232639A (zh) | 统计方法、装置和电子设备 | |
CN110032688A (zh) | 一种法律文书电子送达的方法 | |
TWI743457B (zh) | 產生數值資料的安全替代表示碼的方法及計算機程式產品 | |
CN115208630B (zh) | 基于区块链的数据获取方法、系统及区块链系统 | |
CN112839132B (zh) | 一种具有信息加密功能的手机输入法的实现方法及系统 | |
JP2009151391A (ja) | 電子メール表題隠蔽方法、データベース、通信装置及びプログラム | |
Yu et al. | A Fast Recovery of Encrypted Message Database of WeChat On GPU |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20140620 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RA4 | Supplementary search report drawn up and despatched (corrected) |
Effective date: 20150907 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06F 15/16 20060101AFI20150901BHEP Ipc: H04L 12/58 20060101ALI20150901BHEP Ipc: H04L 29/06 20060101ALI20150901BHEP Ipc: H04W 12/02 20090101ALI20150901BHEP |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
INTG | Intention to grant announced |
Effective date: 20180223 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 1022503 Country of ref document: AT Kind code of ref document: T Effective date: 20180815 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602012049003 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: NV Representative=s name: ANDRE ROLAND S.A., CH |
|
REG | Reference to a national code |
Ref country code: DK Ref legal event code: T3 Effective date: 20181001 |
|
REG | Reference to a national code |
Ref country code: SE Ref legal event code: TRGR |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20180725 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1022503 Country of ref document: AT Kind code of ref document: T Effective date: 20180725 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20181025 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20181026 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20181025 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20181125 Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602012049003 Country of ref document: DE |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20190426 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181218 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20181231 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181218 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181231 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20181218 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20121218 Ref country code: MK Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20180725 Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20180725 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20231227 Year of fee payment: 12 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: SE Payment date: 20231227 Year of fee payment: 12 Ref country code: FR Payment date: 20231227 Year of fee payment: 12 Ref country code: FI Payment date: 20231227 Year of fee payment: 12 Ref country code: DK Payment date: 20231229 Year of fee payment: 12 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20231229 Year of fee payment: 12 Ref country code: CH Payment date: 20240101 Year of fee payment: 12 |