MX2020008784A - Metodo para validar un nodo. - Google Patents

Metodo para validar un nodo.

Info

Publication number
MX2020008784A
MX2020008784A MX2020008784A MX2020008784A MX2020008784A MX 2020008784 A MX2020008784 A MX 2020008784A MX 2020008784 A MX2020008784 A MX 2020008784A MX 2020008784 A MX2020008784 A MX 2020008784A MX 2020008784 A MX2020008784 A MX 2020008784A
Authority
MX
Mexico
Prior art keywords
node
database
peer
trust
computer
Prior art date
Application number
MX2020008784A
Other languages
English (en)
Inventor
Val Santos Jorge Del
Original Assignee
Banco Bilbao Vizcaya Argentaria Sa
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 Banco Bilbao Vizcaya Argentaria Sa filed Critical Banco Bilbao Vizcaya Argentaria Sa
Publication of MX2020008784A publication Critical patent/MX2020008784A/es

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/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23—Updating
    • G06F16/2379—Updates performed during online database operations; commit processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1053—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers
    • H04L67/1057—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers involving pre-assessment of levels of reputation of peers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1068—Discovery involving direct consultation or announcement among potential requesting and potential source peers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3066—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
    • H04L9/3073—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/60—Context-dependent security
    • H04W12/67—Risk-dependent, e.g. selecting a security level depending on risk profiles
    • 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/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
    • H04L63/061—Network architectures or network communication protocols for network security for supporting key management in a packet data network for key exchange, e.g. in peer-to-peer networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Business, Economics & Management (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • Algebra (AREA)
  • Data Mining & Analysis (AREA)
  • Business, Economics & Management (AREA)
  • Computer Hardware Design (AREA)
  • Computer And Data Communications (AREA)
  • Information Transfer Between Computers (AREA)
  • Amplifiers (AREA)

Abstract

Un método implementado por ordenador para validar una firma digital de al menos un nodo en una red entre pares, en el que cada nodo está configurado para almacenar una base de datos y al menos una puntuación de confianzas de un nodo con respecto a otro nodo de la red entre pares, en el que cada base de datos está configurada para almacenar al menos una aprobación de confianza de otro nodo, comprendiendo el método implementado por ordenador las etapas de, a) ejecutar en la pluralidad de nodos un algoritmo "gossip", obteniendo en cada nodo una versión actualizada de su base de datos, b) calcular localmente en cada nodo, una puntuación de confianza s asignada a otro nodo de la red para cada nodo de su base de datos, c) validar localmente en cada nodo, cada firma digital del al menos un nodo de su base de datos, basándose en el valor de dicha puntuación de confianza s de la red entre pares, d) si hay un cambio en al menos un valor de aprobación de confianza t de una base de datos de un nodo, enviar la aprobación de confianza cambiada a cada nodo vecino y ejecutar la etapa a), o e) si se añade o se elimina un nuevo nodo en la red entre pares, ejecutar la etapa a). También se describen un sistema de procesamiento de datos, un producto de programa informático y un medio de almacenamiento legible por ordenador para llevar a cabo las etapas del método.
MX2020008784A 2018-04-05 2019-04-04 Metodo para validar un nodo. MX2020008784A (es)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP18382231.1A EP3550792A1 (en) 2018-04-05 2018-04-05 Method for validating a node
PCT/EP2019/058465 WO2019193081A1 (en) 2018-04-05 2019-04-04 Method for validating a node

Publications (1)

Publication Number Publication Date
MX2020008784A true MX2020008784A (es) 2020-10-01

Family

ID=62046838

Family Applications (1)

Application Number Title Priority Date Filing Date
MX2020008784A MX2020008784A (es) 2018-04-05 2019-04-04 Metodo para validar un nodo.

Country Status (10)

Country Link
US (1) US20210036868A1 (es)
EP (2) EP3550792A1 (es)
CN (1) CN112020849A (es)
AR (1) AR115332A1 (es)
CO (1) CO2021011932A2 (es)
ES (1) ES2937008T3 (es)
MX (1) MX2020008784A (es)
PE (1) PE20210145A1 (es)
UY (1) UY38170A (es)
WO (1) WO2019193081A1 (es)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10785125B2 (en) * 2018-12-03 2020-09-22 At&T Intellectual Property I, L.P. Method and procedure for generating reputation scores for IoT devices based on distributed analysis
US11606426B1 (en) * 2019-10-23 2023-03-14 Architecture Technology Corporation Database access gateway through distributed network nodes
SG10202000215RA (en) * 2020-01-09 2020-07-29 Alipay Labs Singapore Pte Ltd Methods and devices for providing decentralized identity verification

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5434919A (en) * 1994-01-11 1995-07-18 Chaum; David Compact endorsement signature systems
EP0869637A3 (en) * 1997-04-02 2000-12-06 Arcanvs Digital certification system
US7222187B2 (en) 2001-07-31 2007-05-22 Sun Microsystems, Inc. Distributed trust mechanism for decentralized networks
US7213047B2 (en) 2002-10-31 2007-05-01 Sun Microsystems, Inc. Peer trust evaluation using mobile agents in peer-to-peer networks
KR101237175B1 (ko) * 2008-04-30 2013-02-25 엔이씨 유럽 리미티드 통신 파트너의 아이덴티티를 검증하는 방법 및 시스템
CN102571983B (zh) * 2012-02-23 2015-06-03 浙江工商大学 一种对等网络存储数据信任模型建立方法
WO2014051430A1 (en) * 2012-09-26 2014-04-03 Off The Grid B.V. Method and apparatus for transmitting, receiving and forwarding a gossip message using a gossip network
US9503365B2 (en) * 2014-08-11 2016-11-22 Palo Alto Research Center Incorporated Reputation-based instruction processing over an information centric network

Also Published As

Publication number Publication date
EP3777074B1 (en) 2022-11-09
EP3550792A1 (en) 2019-10-09
UY38170A (es) 2019-10-31
US20210036868A1 (en) 2021-02-04
PE20210145A1 (es) 2021-01-22
WO2019193081A1 (en) 2019-10-10
CO2021011932A2 (es) 2021-09-30
EP3777074A1 (en) 2021-02-17
AR115332A1 (es) 2020-12-23
CN112020849A (zh) 2020-12-01
ES2937008T3 (es) 2023-03-23

Similar Documents

Publication Publication Date Title
US20210304071A1 (en) Systems and methods for generating machine learning applications
US11132602B1 (en) Efficient online training for machine learning
CN110168523B (zh) 改变监测跨图查询
CN107895038B (zh) 一种链路预测关系推荐方法及装置
MX2020008784A (es) Metodo para validar un nodo.
US10103942B2 (en) Computer processing method and system for network data
US20160316014A1 (en) Distributed processing of shared content
US9535954B2 (en) Join processing device, data management device, and string similarity join system
US11985253B2 (en) Non-fungible token authentication
US10642912B2 (en) Control of document similarity determinations by respective nodes of a plurality of computing devices
JP2020501254A (ja) データストックを匿名化するための方法およびシステム
EP4236242A3 (en) Determining dependent causes of a computer system event
Karimov et al. High quality clustering of big data and solving empty-clustering problem with an evolutionary hybrid algorithm
CN110019205B (zh) 一种数据存储、还原方法、装置及计算机设备
Wijayanto et al. Implementation of multi-criteria collaborative filtering on cluster using Apache Spark
Haslegrave et al. Preferential attachment with choice
CN104102748B (zh) 文件映射方法及装置和文件推荐方法及装置
Zadorozhnyi et al. Analytical and numerical methods of calibration for preferential attachment randon graphs
US11943277B2 (en) Conversion system, method and program
US9135300B1 (en) Efficient sampling with replacement
JP5983333B2 (ja) 検索処理方法、データ生成方法及び情報処理装置
WO2011016281A2 (ja) ベイジアンネットワーク構造学習のための情報処理装置及びプログラム
CN115757384A (zh) 一种基于大数据的政务数据处理方法
Jiao et al. An effective branch and bound algorithm for minimax linear fractional programming
CN109962942B (zh) 副本更新方法和装置以及计算机可读存储介质