WO2007135145A2 - Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé - Google Patents

Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé Download PDF

Info

Publication number
WO2007135145A2
WO2007135145A2 PCT/EP2007/054934 EP2007054934W WO2007135145A2 WO 2007135145 A2 WO2007135145 A2 WO 2007135145A2 EP 2007054934 W EP2007054934 W EP 2007054934W WO 2007135145 A2 WO2007135145 A2 WO 2007135145A2
Authority
WO
WIPO (PCT)
Prior art keywords
list
transmitter
subscriber
address information
specific
Prior art date
Application number
PCT/EP2007/054934
Other languages
German (de)
English (en)
Other versions
WO2007135145A3 (fr
Inventor
Jens-Uwe Busser
Adam Kiss
Original Assignee
Nokia Siemens Networks Gmbh & Co. Kg
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nokia Siemens Networks Gmbh & Co. Kg filed Critical Nokia Siemens Networks Gmbh & Co. Kg
Priority to EP07729373A priority Critical patent/EP2027690A2/fr
Publication of WO2007135145A2 publication Critical patent/WO2007135145A2/fr
Publication of WO2007135145A3 publication Critical patent/WO2007135145A3/fr

Links

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/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
    • 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/21—Monitoring or handling of messages
    • H04L51/212—Monitoring or handling of messages using filtering or selective blocking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/1066—Session management
    • H04L65/1076—Screening of IP real time communications, e.g. spam over Internet telephony [SPIT]
    • H04L65/1079—Screening of IP real time communications, e.g. spam over Internet telephony [SPIT] of unsolicited session attempts, e.g. SPIT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M3/00—Automatic or semi-automatic exchanges
    • H04M3/42—Systems providing special services or facilities to subscribers
    • H04M3/436—Arrangements for screening incoming calls, i.e. evaluating the characteristics of a call before deciding whether to answer it
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04M—TELEPHONIC COMMUNICATION
    • H04M7/00—Arrangements for interconnection between switching centres
    • H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
    • 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/48—Message addressing, e.g. address format or anonymous messages, aliases
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/16—Communication-related supplementary services, e.g. call-transfer or call-hold

Definitions

  • the invention relates to a method for creating a subscriber-specific transmitter exclusion list and to a method for forwarding a message in a decentralized communication system.
  • the invention further relates to a computer program product which is suitable for carrying out the method.
  • a network arrangement is designated with at least two user equipment in which participants can exchange messages via the user equipment.
  • messages are both text-based messages, for example SMS (short messenger service), IM (instant messages) or e-mail as well as telephone conversations.
  • circuit-switching networks such as the traditional telephone network
  • packet-switching networks are used to set up communication systems.
  • One example is the Internet, which not only allows text messages to be transmitted unidirectionally, but also allows bi-directional voice transmission with Voice over IP (VoIP).
  • VoIP Voice over IP
  • networks with a central architecture also known as client server architecture
  • a decentralized structure can be distinguished.
  • Networks with decentralized structure such as the so-called peer-to-peer networks, have no central, the network kontrol ⁇ -regulating unit.
  • Decentralized networks are characterized by great flexibility, especially as regards accepts new subscriber devices in the network or the outsourcing of subscriber equipment.
  • communication systems with a decentralized network structure will be referred to briefly as decentralized communication systems.
  • a sender exclusion list also called Black List
  • This subscriber-specific transmitter exclusion list can for example be stored in the subscriber device of the corresponding subscriber.
  • a disadvantage of filtering incoming messages in the subscriber device is that even unwanted messages must first be transmitted to the subscriber device. In this way, unwanted and ultimately suppressed messages unnecessarily prove network transmission bandwidth .
  • the user-specific transmitter exclusion lists in the or one of the central units which are provided for the switching and routing messages to store and evaluate for mediating messages already at this point according to the teilêtspe ⁇ -specific transmitter exclusion lists. unwanted Messages need then not be redirected to the subscriber device. Since the central switching units of such a communication system can typically be regarded as worthy of trust ver ⁇ , the Provision of the individual subscriber-specific transmitter exclusion lists classified under privacy technical aspect as safe. In communication systems with decentralized network structure such an approach is not possible due to the lack of central office.
  • the invention is characterized by a method for creating a subscriber-specific transmitter exclusion list for a decentralized communication system, which comprises the following steps: At least one transmitter to be excluded is specified by specifying at least one address information assigned to the transmitter. Subsequently, an irreversibly unique representation is created for each of the predetermined address information. All irreversibly unambiguous representations are stored in a first list, which is then stored as a subscriber-specific transmitter exclusion list in the decentralized communication system. Because address information is contained only in its irreversibly unique representation from which a reconstruction of the address information in plain text is not possible, it is possible in a simple manner to fulfill the requirements with regard to data protection. The subscriber-specific transmitter exclusion list nevertheless contains sufficient information to identify undesired transmitters and to sing out messages of such transmitters in advance, for example when forwarding a message.
  • a hashing method in particular SHA-I (Secure Hash Algorithm) or MD5 (Messenger Dial), is used to create the irreversibly unique representations of the address information. This is cryptographically secure and easy to implement.
  • the following additional steps are carried out before the subscriber-specific transmitter exclusion list is stored in the decentralized communication system: All predetermined address information is stored in a second list, which is then encrypted. After that, the encrypted second list is added to the subscriber-specific sender end list. A participant who has a ent ⁇ speaking key for decrypting the second list is set in this manner in a position that Ad ⁇ ressm the negative station from the exclusion list to be extracted again as a clear text. This subscriber is thus enabled to supplement or modify the transmitter exclusion list.
  • the second list either by a symmetric encryption method. or by an asymmetric encryption method, using as key a public key of the subscriber for whom the channel list is specific.
  • a hybrid encryption method can advantageously be used.
  • the subscriber-specific transmitter exclusion list with egg ⁇ ner digital signature of the subscriber for which the transmitter exclusion list is specific provided before it is stored in the decentralized communication system.
  • the digital signature is created particularly advantageously as a function of a private key of the subscriber for whom the transmitter exclusion list is specific.
  • At least one range of address information is specified, the range comprising addresses which are assigned to senders to be excluded.
  • the at least one predetermined area is stored in the first list.
  • the range of address information is determined by an address information that includes placeholders. Address ranges are thus routed in clear text in the transmitter exclusion list in order to enable an evaluation of wildcards. Since individual address ranges encompassed by the range are indeterminate in the case of address ranges specified in this way, this method is not critical in terms of data protection.
  • the object is achieved by a method for forwarding a message in a decentralized Communication system solved.
  • the method according to the second aspect comprises the following steps: A ⁇ After directing a transmitter with a transmitter assigned address ⁇ information received for forwarding to a recipient in the decentralized communication system. Thereupon, a transmitter exclusion list specific to the addressee is read in from the decentralized communication system. An irreversibly unambiguous representation is created for the address information of the transmitter and compared with the entries of the subscriber-specific transmitter exclusion list read in. If the irreversibly unambiguous representation of the address information of the transmitter does not correspond to any of the entries of the subscriber-specific transmitter exclusion list, the message is forwarded to the addressee.
  • This method specifies how a according to the first aspect of the invention, subscriber-specific created Send Lucas ⁇ inclusion list evaluated when forwarding a message.
  • the resulting advantages of this second aspect of the invention are the same as those of the first aspect.
  • the following additional steps are carried out: It is checked whether the subscriber-specific transmitter exclusion list is provided with a digital signature. If it is provided with a digital signature is the digital signature on ⁇ hand the authenticity of the transmission ⁇ checked rauSCHliste. If the digital signature does not identify the addressee, the message will be forwarded in any case.
  • the object is achieved by a computer program product with program code for execution on a subscriber device that is capable of operating in a decentralized Communication system is suitable.
  • the Computerprogrammpro ⁇ domestic product is characterized in that one of the methods given is carried out in the execution of the program code.
  • FIG. 1 shows a communication system with four subscriber devices in a schematic representation
  • FIG. 2 shows a flowchart of a method for creating a subscriber-specific transmitter exclusion list
  • Figure 3 is a schematic diagram of a transmitter-specific teil philosophicalspe ⁇ exclusion list
  • FIG. 4 shows a flow diagram of a method for forwarding a message in a decentralized communication system.
  • FIG. 1 schematically shows a decentralized communication system.
  • the distributed communication system comprises four user equipments: a transmitter 1, a recipient 2 and two additional sites 3 and 4. Create ⁇ from subscriber specific addressee 2 th transmitter exclusion list L is stored in the further subscriber. 4 From the transmitter 1, a message 5 with address information A 3 of the transmitter 1 and Ad ⁇ ressinformation A A of the addressee 2 is sent to the other party 3 for forwarding to the addressee 2.
  • participant and user equipment are used in the context of the application partially synonymous, if the distinction for the considered context is irrelevant or results from the context.
  • the schematic decentralized communication system shown in FIG. 1 is based, for example, on a network with a peer-to-peer architecture. In the figure, this is indicated by dashed lines through which each of the subscribers is connected to each other subscriber of the communication system.
  • the individual connections are to be understood as logical connections insofar as a network in
  • Peer-to-peer structure can also be built on the basis of a physically different structured network.
  • peer-to-peer networks can be implemented as subnets on the Internet. It is important that there is a possibility there is of each of the participants to each other subscriber information without the interposition of a dedicated central entity of the network to send and the possibility to send search queries to all participants of the Net ⁇ zes, for example in the form of so-called multi cast queries or using methods based on distributed (hash) tables.
  • search queries are shown as short arrows emanating from a subscriber in each direction.
  • the exchanged data are each symbolized along the arrows.
  • Figure 1 outlines the decentralized communication system in a situation in which the user-specific transmitter design ⁇ inclusion list L is evaluated 2 of the addressee in the forwarding of an addressed from the transmitter 1 to the addressee 2 message by the other participant.
  • the Vorge ⁇ hen in this regard is the overview to the first roughly sketched. Detailed embodiments are described below in connection with FIGS. 2 and 4.
  • a possible embodiment of the subscriber-specific transmitter exclusion list L is given in connection with FIG.
  • the addressee 2 creates a connection list for him specific transmission versions ⁇ L and stores them locally in Kirunikationssys ⁇ tem from.
  • Procedures by means of which data can be stored locally in a peer-to-peer network are known from the prior art. For example, for this purpose, a query regarding the storage can be sent to the other subscribers of the network. The sub ⁇ participants then negotiate among themselves which one or more of the participants are suitable for storing the data and loading riding. The subscriber placing the memory request then sends the data to the subscriber or subscribers. For safety reasons, data is often stored redundantly with several users. In the example illustrated in FIG. 1, the further subscriber 4 has replied to the memory request of the subscriber 2 regarding a decentralized storage of the transmitter exclusion list L specific for him, so that the transmitter exclusion list L is transmitted to him for storage.
  • the distributed communication system is basically designed so that messages can be sent from each participant to each participant, but the exact path the data takes is not predetermined. Furthermore, the decentralized communication systems can fall into several subnets, within which the respective subscribers can communicate directly with each other, but the individual subnets are only connected via one or more subscribers. In such a case, the participants act from the intersection two or more subnets as relay stations for switching and forwarding messages.
  • a message 5 directed by the sender 1 to the advisory 2 is routed via the further subscriber 3.
  • the further subscriber 3 Prior to forwarding the message to the addressee 2 of the other participants 3 requests the teil obviouslyspe ⁇ -specific transmitter exclusion list L of the addressee 2 from the de ⁇ central communications network. This happens again through a search query.
  • the further subscriber 3 shall be the ⁇ said subscriber-specific transmitter exclusion list L ⁇ it out of the further subscriber 4 transmits.
  • the further subscriber 3 checks whether messages of the transmitter 1 from the addressee 2 are desired or not and accordingly forwards or suppresses the message.
  • FIG. 2 shows an example of a method for creating a subscriber-specific transmitter exclusion list in a flowchart in more detail.
  • the method is indicated for the situation shown in FIG. 1, that is to say with the transmitter 1, the addressee 2 and the further users 3 and 4.
  • a sender from which a subscriber does not wish to receive messages is specified. This can be done, for example, by the subscriber specifying at least one address information A n assigned to the transmitter to be excluded.
  • addresses can be specified in a variety of formats, eg in the form of numbers, names, or as e-mail addresses or as a SIP URI (Session Initiation Protocol - Uniform Resource Identifier). Any format that can also be used to specify the address when sending a message is also suitable in this method step for specifying the Deanschlie ⁇ chenden sender.
  • a step S2 an irreversibly unambiguous representation of the predetermined address information A n is created.
  • Such a representation is characteristic and unique for the given address information A n , but does not allow the reconstruction of the address information A n .
  • Examples of known transformations with this property, also referred to as Hanging methods, are SHA-I or MD5.
  • the created unique representation is then added to a first list Li.
  • the address information A is n addition, in plain text, so mation without transfor ⁇ , a second list L2 added.
  • step S4 it is determined whether other stations for For ⁇ are close or if an already excluded channel is to be additionally recorded with its identifier in a different format. If appropriate, the steps S1 to S3 are then repeated. After in this way functions the first and second list of the unique representations or the plaintext of the predetermined address Informa ⁇ A n are created, the method continues in a step S5.
  • step S5 the second list L2, the formations, the addressin ⁇ is contains in plain text as a whole to ver ever knowl ⁇ th second list L 2 * encrypted.
  • a symmetric encryption method or an asymmetric encryption method with a key pair consisting of a public and a private key
  • the key should only while the participant who prescribes the ⁇ for For closing subscriber information and is specific to the transmitter to be created exclusion list, to be known. Is an asymmetric or hybrid cryptographic ⁇ used procedure, the public keys of the key pair should be used.
  • a step S6 the first list Li and the encrypted second list L 2 * are combined to form the subscriber-specific transmission exclusion list L.
  • the generated transmission exclusion list L is provided with a digital signature.
  • the digital signature the authenticity of Sendeaus ⁇ can be checked sion list later. It can be any means known in the prior art method can be used to create ler digita ⁇ signatures. It is possible to make a digital signature with the help of the private key of the already used when encrypting the second list key pair of the subscriber, but preferably ⁇ but uses the encryption and digital signature two different key pairs.
  • the thus created and signed subscriber ⁇ specific transmitter exclusion list is then locally stored in a step S8 in the communication system.
  • suitable procedures in networks with decentralized architecture are known for this purpose.
  • a this method created in accordance with user-specific transmitter exclusion list L is prepared in figure 3 schematically Darge ⁇ . It includes the first list Li with entries L x a to Lid having the irreversibly unique representations of the respective given address information A n . In the second list L 2 , these predetermined address information A n are contained in plain text as entries L 2 a to L 2 d.
  • the subscriber-specific transmitter exclusion list L includes these two ⁇ te list L 2 as encrypted second list L 2 * and is provided with a digital signature. 6
  • the first list L 1 can be used by each subscriber of the communication system to check whether a sender of a message is listed in the subscriber-specific sender exclusion list L.
  • the entries L 2 ad of the second list L 2 can be used to supplement or modify the sender list L.
  • this presupposes a corresponding key for decrypting the encrypted second list L 2 * , since the second list L 2 is contained only in its encrypted version in the transmitter end list L.
  • the addressee 2 who has created the transmitter exclusion list L and for whom it is specific, will have this key.
  • the participant needs the second list L 2 with the entries L2 ad in plain language not local to be ⁇ nem user terminal hold, but it can always be extracted from the transmitter exclusion list L again. This also allows the subscriber to supplement or modify the channel exclusion list L from different devices. A synchronization problem by locally stored on different user equipment second lists is thus bypassed, without neglecting data protection aspects.
  • the further subscriber device 3 receives the message 5 from the transmitter 1.
  • the message contains or prefaces additional information.
  • the address information A s of the transmitter 1 and the address information A A of the addressee 2 are particularly important here.
  • step S12 the addressee 2 is its user-specific transmission output ⁇ inclusion list L from the remote communication system is read with reference to the address information A A. Subsequently, in a step S13, an irreversibly unambiguous representation of the address information A 3 of the transmitter 1 is created.
  • this unique irreversible repre ⁇ is presentation for items in the first list of participating Li merspezifischen transmitter exclusion list L compared. If none of the entries Lia to Lid of the first list Li equality with the irreversible unambiguous representation of the address information A 3 of the transmitter 1 is detected, the method branches to a step S16 in which the message 5 is forwarded to the addressee 2. The procedure ends afterwards.
  • step S14 If, however, a match is found in an entry in step S14, this means that messages of the sender 1 are not wanted by the addressee 2 in accordance with the subscriber-specific sender exclusion list L.
  • the authenticity of the subscriber-specific information is first of all determined in a step S15. See transmitter exclusion list L on the basis of the digital sub ⁇ font 6 checked. If the digital signature 6 was created using a private key, the corresponding public key is required for this purpose. It can be provided that the individual subscribers of the communication system have lists of the public keys of the other subscribers, in particular if applications which use an encrypted data exchange are frequently used within the decentralized communication system. Alternatively, it may be provided that a public
  • mög ⁇ Lich is to store the public keys of subscribers, for example in the form of digital certificates decentralized onssystem in communication. Preferably those digital certificates are then added to the user-specific transmitter exclusion list L and len to check the digita ⁇ signature are always available.
  • step S15 If it is determined in step S15 that the received user-specific transmitter exclusion list L created not clearly from the recipient 2, read list identi ⁇ can be fied, the decision taken in step S14 hard ⁇ is position not taken into account and the method comparable also branches to step S16 to forward the report After ⁇ . 5
  • step S15 the transmitter exclusion list, however, then classified schematically as au ⁇ , then the message is discarded by 6 WEI direct subscriber unit 3 and not forwarded. At this point, an additional notification of the sender 1 on the rejection of the message 5 can take place.
  • Wei ⁇ thermore attention must conceivable that the addressee 2 via the input of the unwanted message 5 informs. Optional can the message will also be stored by the other subscriber device 3 in order to be retrieved later by the addressee 2 if necessary.
  • steps S14 and S15 may also be changed in further embodiments of the method in that the verification of the authenticity of the subscriber-specific transmitter exclusion list L (step S15) compares the irreversibly unique representation of the address information A 3 of the transmitter 1 with the entries of subscriber-specific transmitter exclusion list L (step S14) is prefixed. Because checking digital signatures is generally computationally expensive, the order shown is preferred for performance reasons. A check of the digital signature 6 is not mandatory in the case shown, but takes place only if it was not branched from step S14 for forwarding the message 5 to step S16.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • General Business, Economics & Management (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Selon le procédé pour établir une liste d'exclusion d'expéditeur(s) (L) spécifique à un abonné dans un système de communication décentralisé, au moins un expéditeur à exclure est indiqué par spécification d'au moins une information d'adresse associée à cet expéditeur. Une représentation unique irréversible est créée pour chacune des informations d'adresse spécifiées, laquelle représentation est enregistrée dans une première liste (L1). Cette liste est mémorisée en tant que liste d'exclusion d'expéditeur(s) (L) spécifique à un abonné dans le système de communication décentralisé. Selon le procédé de transmission de messages, un message (5) d'un expéditeur (1) contenant l'information d'adresse associée (AS) est reçu pour être transmis à un destinataire (2). La liste d'exclusion d'expéditeur(s) spécifique au destinataire (2) est extraite du système de communication décentralisé. Une représentation unique irréversible est créée pour l'information d'adresse de l'expéditeur et cette représentation est comparée aux entrées de la liste d'exclusion d'expéditeur(s) spécifique à l'abonné extraite. Si la représentation unique irréversible de l'information d'adresse de l'expéditeur ne correspond à aucune des entrées de la liste d'exclusion d'expéditeur(s) spécifique à l'abonné, le message est transmis au destinataire.
PCT/EP2007/054934 2006-05-22 2007-05-22 Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé WO2007135145A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP07729373A EP2027690A2 (fr) 2006-05-22 2007-05-22 Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE102006024008.1 2006-05-22
DE102006024008A DE102006024008A1 (de) 2006-05-22 2006-05-22 Verfahren zum Erstellen einer teilnehmerspezifischen Senderausschlussliste und Verfahren zum Weiterleiten von Nachrichten in einem dezentralen Kommunikationssystem

Publications (2)

Publication Number Publication Date
WO2007135145A2 true WO2007135145A2 (fr) 2007-11-29
WO2007135145A3 WO2007135145A3 (fr) 2008-02-14

Family

ID=38622076

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2007/054934 WO2007135145A2 (fr) 2006-05-22 2007-05-22 Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé

Country Status (3)

Country Link
EP (1) EP2027690A2 (fr)
DE (1) DE102006024008A1 (fr)
WO (1) WO2007135145A2 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070291936A1 (en) * 2006-02-10 2007-12-20 Milana Joseph P Consumer-driven secure sockets layer modulator
WO2013124291A1 (fr) * 2012-02-23 2013-08-29 Markport Limited Prévention contre les inondations de messages dans des réseaux de messagerie
CN103731263A (zh) * 2012-10-10 2014-04-16 盐城睿泰数字科技有限公司 一种解决在线数据安全性的方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040148506A1 (en) * 2003-01-23 2004-07-29 Prince Matthew B. Method and apparatus for a non-revealing do-not-contact list system
US20050005164A1 (en) * 2003-06-20 2005-01-06 Bronwyn Syiek Apparatus and method for precluding e-mail distribution
US20050076240A1 (en) * 2003-04-02 2005-04-07 Barry Appleman Degrees of separation for handling communications

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7603356B2 (en) * 2001-01-26 2009-10-13 Ascentive Llc System and method for network administration and local administration of privacy protection criteria
US7870218B2 (en) * 2003-04-09 2011-01-11 Nec Laboratories America, Inc. Peer-to-peer system and method with improved utilization
US7921300B2 (en) * 2003-10-10 2011-04-05 Via Technologies, Inc. Apparatus and method for secure hash algorithm
US7936682B2 (en) * 2004-11-09 2011-05-03 Cisco Technology, Inc. Detecting malicious attacks using network behavior and header analysis

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040148506A1 (en) * 2003-01-23 2004-07-29 Prince Matthew B. Method and apparatus for a non-revealing do-not-contact list system
US20050076240A1 (en) * 2003-04-02 2005-04-07 Barry Appleman Degrees of separation for handling communications
US20050005164A1 (en) * 2003-06-20 2005-01-06 Bronwyn Syiek Apparatus and method for precluding e-mail distribution

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
SPAM FILTER PROJECT: "Spam Filter From Meta" INTERNET CITATION, [Online] 8. März 2006 (2006-03-08), Seiten 1-12, XP002459654 Gefunden im Internet: URL:http://web.archive.org/web/20060308170343/http://meta.wikimedia.org/wiki/Spam_Filter> [gefunden am 2007-11-21] *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070291936A1 (en) * 2006-02-10 2007-12-20 Milana Joseph P Consumer-driven secure sockets layer modulator
US9438570B2 (en) * 2006-02-10 2016-09-06 Fair Isaac Corporation Consumer-driven secure sockets layer modulator
WO2013124291A1 (fr) * 2012-02-23 2013-08-29 Markport Limited Prévention contre les inondations de messages dans des réseaux de messagerie
US9338179B2 (en) 2012-02-23 2016-05-10 Markport Limited Message flooding prevention in messaging networks
US9491195B2 (en) 2012-02-23 2016-11-08 Markport Limited Message flooding prevention in messaging networks
CN103731263A (zh) * 2012-10-10 2014-04-16 盐城睿泰数字科技有限公司 一种解决在线数据安全性的方法

Also Published As

Publication number Publication date
WO2007135145A3 (fr) 2008-02-14
DE102006024008A1 (de) 2007-11-29
EP2027690A2 (fr) 2009-02-25

Similar Documents

Publication Publication Date Title
DE69930420T2 (de) System und Verfahren zum Verschieben von Information von einem Hostsystem an eine mobile Datenkommunikationsvorrichtung
DE112011103172T5 (de) Unterstützung des transaktionsorientierten Nachrichtenaustauschs in verbundenen Nachrichtenaustauschnetzwerken
EP3949309B1 (fr) Certificat digital et méthode sécure pour fournier une clé publique
WO2007135145A2 (fr) Procédé pour établir une liste d'exclusion d'expéditeur(s) spécifique à un abonné et procédé de transmission de messages dans un système de communication décentralisé
DE102005004612A1 (de) Verfahren zur Aufschaltung auf verschlüsselte Kommunikationsverbindungen in einem paketorientierten Netzwerk
EP3376419B1 (fr) Système et méthode de signature électronique d'un document
EP2932677B1 (fr) Procede de transmission securisee d'un message electronique
EP1709764A1 (fr) Ensemble circuit et procede pour securiser la communication au sein de reseaux de communication
DE102006026637A1 (de) Verfahren und System zur Filterung elektronischer Nachrichten
EP2685682A2 (fr) Procédé et système de messagerie sécurisée
EP2506177A1 (fr) Procédé et dispositif destinés à la comparaison de données d'identification
EP1584156B1 (fr) Horodatage assisté par réseau de télécommunication
DE102015205664A1 (de) System und Verfahren zur Bearbeitung elektronischer Nachrichten
EP2036281B1 (fr) Procédé d'enregistrement automatisé d'adresses dans une liste d'émetteurs acceptés dans un système de communication
EP1944928A2 (fr) Procédé et système destinés à l'échange sécurisé d'une information par courrier électronique
WO2007012483A1 (fr) Procede et systeme pour transmettre un message et generateur de cles approprie a cet effet
EP1183847B1 (fr) Procede de transmission securisee de donnees protegees
DE102009022764A1 (de) System und Verfahren zur Bearbeitung elektronischer Nachrichten
DE102015119687A1 (de) Verfahren zum Generieren und/oder Übertragen einer verschlüsselten Nachricht
EP2410702A1 (fr) Procédé de transmission d'une information électronique à travers un système de communication et système de communication correspondant
DE10220737B4 (de) Inhaltsbezogene Verschlüsslung
DE102013016466A1 (de) Verfahren zur Umsetzung von Suchanforderungen für digitale Zertifikate
EP1906616A1 (fr) Procédé pour l'intégration d'au moins un élément de réseau dans un réseau poste à poste
DE102012000235A1 (de) System und Verfahren zur Sicherung elektronischer Nachrichten
EP1626551A1 (fr) Méthode pour assurer authenticité et confidentialité dans un réseau p2p

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 2007729373

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE