EP4548618A1 - System und verfahren zur validierung von zugangstoken bei einer netzwerkspeicherfunktion - Google Patents

System und verfahren zur validierung von zugangstoken bei einer netzwerkspeicherfunktion

Info

Publication number
EP4548618A1
EP4548618A1 EP23830635.1A EP23830635A EP4548618A1 EP 4548618 A1 EP4548618 A1 EP 4548618A1 EP 23830635 A EP23830635 A EP 23830635A EP 4548618 A1 EP4548618 A1 EP 4548618A1
Authority
EP
European Patent Office
Prior art keywords
token
processor
resource server
users
predetermined period
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.)
Pending
Application number
EP23830635.1A
Other languages
English (en)
French (fr)
Inventor
Aditya Gupta
Mukta Shetty
Apoorva Khamesra
Milankumar Kalavadiya
Yugandhara Joshi
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jio Platforms Ltd
Original Assignee
Jio Platforms Ltd
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 Jio Platforms Ltd filed Critical Jio Platforms Ltd
Publication of EP4548618A1 publication Critical patent/EP4548618A1/de
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/08Access security
    • H04W12/084Access security using delegated authorisation, e.g. open authorisation [OAuth] protocol
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic 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/321Cryptographic 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 a third party or a trusted authority
    • H04L9/3213Cryptographic 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 a third party or a trusted authority using tickets or tokens, e.g. Kerberos
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/04Key management, e.g. using generic bootstrapping architecture [GBA]
    • H04W12/043Key management, e.g. using generic bootstrapping architecture [GBA] using a trusted network node as an anchor
    • H04W12/0431Key distribution or pre-distribution; Key agreement
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W12/00Security arrangements; Authentication; Protecting privacy or anonymity
    • H04W12/60Context-dependent security
    • H04W12/61Time-dependent
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/80Wireless

Definitions

  • a portion of the disclosure of this patent document contains material, which is subject to intellectual property rights such as but are not limited to, copyright, design, trademark, integrated circuit (IC) layout design, and/or trade dress protection, belonging to Jio Platforms Limited (JPL) or its affiliates (hereinafter referred as owner).
  • JPL Jio Platforms Limited
  • owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all rights whatsoever. All rights to such intellectual property are fully reserved by the owner.
  • the embodiments of the present disclosure generally relate to systems and methods for authorization in a network repository function. More particularly, the present disclosure relates to a system and a method for access token validation at a network repository function.
  • third generation partnership project provides a standard authorization using an open authorization (OAUTH) token, where a network repository function (NRF) acts as an “Authorization Server,” consumers act as a “OAUTH client,” and a producer acts as an “OAUTH Resource Server.”
  • OAUTH client a network repository function
  • the consumer on receiving the token from the NRF, sends the token towards the producer (OATH Resource Server), which possesses a responsibility of validating the token.
  • OAUTH client on receiving the token from the NRF, sends the token towards the producer (OATH Resource Server), which possesses a responsibility of validating the token.
  • a key may be preexchanged between the Resource Server and Authorization Server for which clear flows are not standardized.
  • the key is deployment specific that further results in use of key pairs (Symmetric/Asymmetric Keys) which are generally shared between nodes via non-secure practices.
  • the present disclosure relates to a system for token validation at a network repository function (NRF).
  • the system includes a processor and a memory operatively coupled to the processor, where the memory stores instructions to be executed by the processor.
  • the processor receives a token from one or more users via a computing device.
  • the token is based on a network function (NF) request generated by the one or more users.
  • the processor decodes the token received from the one or more users and determines if the decoded token is valid.
  • NF network function
  • the processor in response to a positive determination, sends the decoded token to a resource server within a predetermined period.
  • the processor receives a token validation request from the resource server within the predetermined time.
  • the processor generates one or more requested services for the one or more users via the resource server within the predetermined period.
  • the processor may, in response to a negative determination, send a failure response to the resource server.
  • the processor may receive a forbidden error response from the resource server upon an expiry of the predetermined period.
  • the processor may receive an access request to the resource server from the one or more users based on the forbidden error response.
  • the processor may send a network function instance identification (NFinstancelD) along with the decoded token to the resource server.
  • NFinstancelD network function instance identification
  • the processor may generate a key based on the token received from the one or more users and use the key for decoding the token and processing the token validation request.
  • the present disclosure relates to a method for token validation at a NRF.
  • the method includes receiving, by a processor associated with a system, a token from one or more users via a computing device.
  • the token is based on a NF request generated by the one or more users.
  • the method includes decoding, by the processor, the token received from the one or more users and determining if the decoded token is valid.
  • the method includes, in response to a positive determination, sending by the processor, the decoded token to a resource server within a predetermined period.
  • the method includes receiving, by the processor, a token validation request from the resource server within the predetermined period.
  • the method includes generating, by the processor, one or more requested services for the one or more users via the resource server within the predetermined period.
  • the method may include sending, by the processor, a failure response to the resource server in response to a negative determination.
  • the method may include receiving, by the processor, a forbidden error response from the resource server upon an expiry of the predetermined period.
  • the method may include receiving, by the processor, an access request to the resource server from the one or more users based on the forbidden error response.
  • the method may include sending, by the processor, a NFinstancelD along with the decoded token to the resource server.
  • a user equipment (UE) for sending tokens includes one or more processors communicatively coupled to a processor in a system.
  • the one or more processors are coupled with a memory, and said memory stores instructions to be executed by the one or more processors.
  • the one or more processors transmit a token to the processor via a network.
  • the token is based on a NF request generated by the one or more users.
  • the processor is configured to receive the token from the UE.
  • the processor is configured to decode the token received from the one or more users and determine if the decoded token is valid.
  • the processor is configured to, in response to a positive determination, send the decoded token to a resource server within a predetermined period.
  • the processor is configured to receive a token validation request from the resource server within the predetermined period.
  • the processor is configured to generate one or more requested services for the UE via the resource server within the predetermined period.
  • a non-transitory computer readable medium includes a processor with executable instructions that cause the processor to receive a token from one or more users via a computing device.
  • the token is based on a NF request generated by the one or more users.
  • the processor decodes the token received from the one or more users and determines if the decoded token is valid.
  • the processor in response to a positive determination, sends the decoded token to a resource server within a predetermined period.
  • the processor receives a token validation request from the resource server within the predetermined period.
  • the processor generates one or more requested services for the one or more users via the resource server within the predetermined period.
  • FIG. 1 illustrates an exemplary network architecture (100) for implementing a proposed system (108), in accordance with an embodiment of the present disclosure.
  • FIG. 2 illustrates an exemplary block diagram (200) of a proposed system (108), in accordance with an embodiment of the present disclosure.
  • FIG. 3 illustrates an exemplary flow diagram (300) for token validation, in accordance with an embodiment of the present disclosure.
  • FIG. 4 illustrates an exemplary flow diagram (400) for token validation by a network repository function (NRF), in accordance with an embodiment of the present disclosure.
  • NRF network repository function
  • FIG. 5 illustrates an exemplary computer system (500) in which or with which embodiments of the present disclosure may be implemented.
  • individual embodiments may be described as a process that is depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, or a block diagram. Although a flowchart may describe the operations as a sequential process, many of the operations can be performed in parallel or concurrently. In addition, the order of the operations may be re-arranged. A process is terminated when its operations are completed but could have additional steps not included in a figure. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination can correspond to a return of the function to the calling function or the main function.
  • exemplary and/or “demonstrative” is used herein to mean serving as an example, instance, or illustration.
  • the subject matter disclosed herein is not limited by such examples.
  • any aspect or design described herein as “exemplary” and/or “demonstrative” is not necessarily to be construed as preferred or advantageous over other aspects or designs, nor is it meant to preclude equivalent exemplary structures and techniques known to those of ordinary skill in the art.
  • the terms “includes,” “has,” “contains,” and other similar words are used in either the detailed description or the claims, such terms are intended to be inclusive in a manner similar to the term “comprising” as an open transition word without precluding any additional or other elements.
  • FIG. 1 illustrates an exemplary network architecture (100) for implementing a proposed system (108), in accordance with an embodiment of the present disclosure.
  • the network architecture (100) may include a system (108).
  • the system (108) may be connected to one or more computing devices (104-1, 104- 2. . . 104-N) via a network (106).
  • the one or more computing devices (104-1, 104-2. . . 104-N) may be interchangeably specified as a user equipment (UE) (104) and be operated by one or more users (102-1, 102-2...102-N).
  • the one or more users (102-1, 102-2. . . 102-N) may be interchangeably referred as a user (102) or users (102).
  • the system (108) may be interchangeably referred as an authorization server or a network resource function (NRF).
  • NRF network resource function
  • the computing devices (104) may include, but not be limited to, a mobile, a laptop, etc. Further, the computing devices (104) may include a smartphone, virtual reality (VR) devices, augmented reality (AR) devices, a general-purpose computer, desktop, personal digital assistant, tablet computer, and a mainframe computer. Additionally, input devices for receiving input from the user (102) such as a touch pad, touch-enabled screen, electronic pen, and the like may be used. A person of ordinary skill in the art will appreciate that the computing devices (104) may not be restricted to the mentioned devices and various other devices may be used.
  • the network (106) may include, by way of example but not limitation, at least a portion of one or more networks having one or more nodes that transmit, receive, forward, generate, buffer, store, route, switch, process, or a combination thereof, etc. one or more messages, packets, signals, waves, voltage or current levels, some combination thereof, or so forth.
  • the network may also include, by way of example but not limitation, one or more of a wireless network, a wired network, an internet, an intranet, a public network, a private network, a packet- switched network, a circuit-switched network, an ad hoc network, an infrastructure network, a Public-Switched Telephone Network (PSTN), a cable network, a cellular network, a satellite network, a fiber optic network, or some combination thereof.
  • PSTN Public-Switched Telephone Network
  • the system (108) may receive a token from the one or more users (102) via the computing device (104).
  • the token may be based on a network function (NF) request generated by the one or more users (102).
  • the system (108) may decode the token received from the one or more users (102) and determine if the decoded token is valid.
  • the system (108) in response to a positive determination, may send the decoded token to a resource server within a predetermined period. Further, the system (108) may send a network function instance identification (NFinstancelD) along with the decoded token to the resource server.
  • the system (108) may generate a key based on the token received from the one or more users and use the key for decoding the token and processing the token validation request.
  • the system (108) may receive a forbidden error response from the resource server upon an expiry of the predetermined period.
  • the one or more users (102) may request an access to the resource server based on the forbidden error response.
  • the resource server may also be referred as a producer or an open authorization (OAUTH) resource server.
  • the system (108) may receive a token validation request from the resource server within the predetermined period.
  • the system (108) may generate one or more requested services for the one or more users (102) via the resource server within the predetermined period.
  • the resource server may send a NF service response to the one or more users (102) based on a response from the processor (202).
  • FIG. 1 shows exemplary components of the network architecture (100)
  • the network architecture (100) may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 1. Additionally, or alternatively, one or more components of the network architecture (100) may perform functions described as being performed by one or more other components of the network architecture (100).
  • FIG. 2 illustrates an exemplary block diagram (200) of a proposed system (108), in accordance with an embodiment of the present disclosure.
  • the system (108) may comprise one or more processor(s) (202) that may be implemented as one or more microprocessors, microcomputers, microcontrollers, digital signal processors, central processing units, logic circuitries, and/or any devices that process data based on operational instructions.
  • the one or more processor(s) (202) may be configured to fetch and execute computer-readable instructions stored in a memory (204) of the system (108).
  • the memory (204) may be configured to store one or more computer-readable instructions or routines in a non-transitory computer readable storage medium, which may be fetched and executed to create or share data packets over a network service.
  • the memory (204) may comprise any non-transitory storage device including, for example, volatile memory such as random-access memory (RAM), or non-volatile memory such as erasable programmable read only memory (EPROM), flash memory, and the like.
  • the processing engine(s) (208) may be implemented as a combination of hardware and programming (for example, programmable instructions) to implement one or more functionalities of the processing engine(s) (208). In examples described herein, such combinations of hardware and programming may be implemented in several different ways.
  • the programming for the processing engine(s) (208) may be processor-executable instructions stored on a non-transitory machine -readable storage medium and the hardware for the processing engine(s) (208) may comprise a processing resource (for example, one or more processors), to execute such instructions.
  • the machine-readable storage medium may store instructions that, when executed by the processing resource, implement the processing engine(s) (208).
  • the system (108) may comprise the machine -readable storage medium storing the instructions and the processing resource to execute the instructions, or the machine-readable storage medium may be separate but accessible to the system (108) and the processing resource.
  • the processing engine(s) (208) may be implemented by electronic circuitry.
  • the system (108) may include an interface(s) (206).
  • the interface(s) (206) may comprise a variety of interfaces, for example, interfaces for data input and output (VO) devices, storage devices, and the like.
  • the interface(s) (206) may also provide a communication pathway for one or more components of the system (108). Examples of such components include, but are not limited to, processing engine(s) (208) and a database (210), where the processing engine(s) (208) may include, but not be limited to, a data ingestion engine (212).
  • the processor (202) may receive a token via the data ingestion engine (212).
  • the token may be received from one or more users (102) via a computing device (104).
  • the processor (202) may store the token in the database (210).
  • the token may be based on a NF request generated by the one or more users (102).
  • the processor (202) may decode the token received from the one or more users (102) and determine if the decoded token is valid.
  • the processor (202) in response to a positive determination, may send the decoded token to a resource server within a predetermined period. Further, the processor (202) may send an NFinstancelD along with the decoded token to the resource server.
  • the processor (202) may generate a key based on the token received from the one or more users and use the key for decoding the token and processing the token validation request.
  • the processor (202) may receive a forbidden error response from the producer upon an expiry of the predetermined period.
  • the one or more users (102) may request an access to the resource server based on the forbidden error response.
  • the processor (202) may receive a token validation request from the resource server within the predetermined period.
  • the processor (202) may generate one or more requested services for the one or more users (102) via the resource server within the predetermined period.
  • the producer may send a NF service response to the one or more users (102) based on the positive determination or a negative determination from the processor (202).
  • FIG. 2 shows exemplary components of the system (108)
  • the system (108) may include fewer components, different components, differently arranged components, or additional functional components than depicted in FIG. 2. Additionally, or alternatively, one or more components of the system (108) may perform functions described as being performed by one or more other components of the system (108).
  • FIG. 3 illustrates an exemplary flow diagram (300) for token validation, in accordance with an embodiment of the present disclosure.
  • the standard flow diagram (300) for token validation may include the following steps.
  • a consumer/client (302) may send a NF service request/access token to a producer/resource server (306).
  • the producer/resource server (306) may validate the NF service request based on a local key generated due to an agreement with an NRF/authorization server (304).
  • the producer/resource server (306) may send a NF service response to the consumer/client (302) based on a success or failure of the agreement with the NRF/ authorization server (304).
  • FIG. 4 illustrates an exemplary flow diagram (400) for token validation by a NRF, in accordance with an embodiment of the present disclosure.
  • the flow diagram (400) for token validation by the authorization server/NRF (404) may include the following steps.
  • a consumer/client (402) may send a NF service request/access token to a producer/resource server (406).
  • the NF service request may include an access token provided by the consumer/client (402).
  • the producer/resource server (406) may send a validate access token request to the authorization server/NRF (404). The validate access token request may be based on the NF service request initiated by the consumer/client (402).
  • the authorization server/NRF (404) may decode the success token and validate the access token based on the validate access token request from the producer/resource server (406)
  • the authorization server/NRF (404) may send a success/failure response to the producer/resource server (406) based on the validation of the token.
  • the producer/resource server (406) may accept or reject the NF service request from the consumer/client (402) based on the success/failure response from the authorization server/NRF (404).
  • the producer/resource server (406) may send a NF service response to the consumer/client (402) based on the success/failure response from the authorization server/NRF (404).
  • FIG. 5 illustrates an exemplary computer system (500) in which or with which embodiments of the present disclosure may be implemented.
  • the computer system (500) may include an external storage device (510), a bus (520), a main memory (530), a read-only memory (540), a mass storage device (550), a communication port(s) (560), and a processor (570).
  • the processor (570) may include various modules associated with embodiments of the present disclosure.
  • the communication port(s) (560) may be any of an RS- 232 port for use with a modem-based dialup connection, a 10/100 Ethernet port, a Gigabit or 10 Gigabit port using copper or fiber, a serial port, a parallel port, or other existing or future ports.
  • the communication ports(s) (560) may be chosen depending on a network, such as a Local Area Network (LAN), Wide Area Network (WAN), or any network to which the computer system (500) connects.
  • LAN Local Area Network
  • WAN Wide Area Network
  • the main memory (530) may be Random Access Memory (RAM), or any other dynamic storage device commonly known in the art.
  • the read-only memory (540) may be any static storage device(s) e.g., but not limited to, a Programmable Read Only Memory (PROM) chip for storing static information e.g., start-up or basic input/output system (BIOS) instructions for the processor (570).
  • the mass storage device (550) may be any current or future mass storage solution, which can be used to store information and/or instructions.
  • Exemplary mass storage solutions include, but are not limited to, Parallel Advanced Technology Attachment (PATA) or Serial Advanced Technology Attachment (SATA) hard disk drives or solid-state drives (internal or external, e.g., having Universal Serial Bus (USB) and/or Firewire interfaces).
  • PATA Parallel Advanced Technology Attachment
  • SATA Serial Advanced Technology Attachment
  • USB Universal Serial Bus
  • the bus (520) may communicatively couple the processor(s) (570) with the other memory, storage, and communication blocks.
  • the bus (520) may be, e.g. a Peripheral Component Interconnect PCI) / PCI Extended (PCI-X) bus, Small Computer System Interface (SCSI), (USB), or the like, for connecting expansion cards, drives, and other subsystems as well as other buses, such a front side bus (FSB), which connects the processor (570) to the computer system (500).
  • PCI Peripheral Component Interconnect
  • PCI-X PCI Extended
  • SCSI Small Computer System Interface
  • USB Small Computer System Interface
  • FFB front side bus
  • operator and administrative interfaces e.g., a display, keyboard, and cursor control device may also be coupled to the bus (520) to support direct operator interaction with the computer system (500).
  • Other operator and administrative interfaces can be provided through network connections connected through the communication port(s) (560).
  • Components described above are meant only to exemplify various possibilities. In no way should the aforementioned exemplary computer system (500) limit the scope of the present disclosure.
  • the present disclosure provides a system and a method where a non-secure practice for key exchange is provided by a single network repository function (NRF) that incorporates both token generation and validation.
  • NRF network repository function
  • the present disclosure provides a system and a method where various methods differing from regular standards may be used to provide an additional security enhancement without altering the resource server while processing requests from various consumers.
  • the present disclosure provides a system and a method where changes in token generation and validation methods may be performed at an authorization server itself without any modifications in the resource server.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer And Data Communications (AREA)
  • Mobile Radio Communication Systems (AREA)
EP23830635.1A 2022-06-29 2023-06-29 System und verfahren zur validierung von zugangstoken bei einer netzwerkspeicherfunktion Pending EP4548618A1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
IN202221037228 2022-06-29
PCT/IB2023/056776 WO2024003827A1 (en) 2022-06-29 2023-06-29 System and method for access token validation at a network repository function

Publications (1)

Publication Number Publication Date
EP4548618A1 true EP4548618A1 (de) 2025-05-07

Family

ID=89382049

Family Applications (1)

Application Number Title Priority Date Filing Date
EP23830635.1A Pending EP4548618A1 (de) 2022-06-29 2023-06-29 System und verfahren zur validierung von zugangstoken bei einer netzwerkspeicherfunktion

Country Status (3)

Country Link
EP (1) EP4548618A1 (de)
JP (1) JP2025524383A (de)
WO (1) WO2024003827A1 (de)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6857065B2 (ja) * 2017-03-27 2021-04-14 キヤノン株式会社 認証認可サーバー、リソースサーバー、認証認可システム、認証方法及びプログラム
WO2021140272A1 (en) * 2020-01-10 2021-07-15 Nokia Technologies Oy Verification of access tokens with network repository functions in core networks
US11895501B2 (en) * 2020-12-08 2024-02-06 Oracle International Corporation Methods, systems, and computer readable media for automatic key management of network function (NF) repository function (NRF) access token public keys for 5G core (5GC) authorization to mitigate security attacks

Also Published As

Publication number Publication date
WO2024003827A1 (en) 2024-01-04
JP2025524383A (ja) 2025-07-30

Similar Documents

Publication Publication Date Title
TWI761745B (zh) 基於銀行卡快捷支付簽約的使用者核驗方法及裝置
US11115459B2 (en) Generic and configurable technique for webhook validation with arbitrary applications
US11218590B2 (en) Systems and methods for providing call verification
CN111865882B (zh) 一种微服务认证方法和系统
KR20160006185A (ko) 이중 인증
WO2021174930A1 (zh) 一种业务处理系统、业务处理的方法、装置及设备
CN107613005B (zh) 反向代理方法及装置、电子设备、存储介质
CN111161085B (zh) 业务请求处理方法、装置、电子设备及计算机可读介质
CN106161367A (zh) 一种动态口令验证方法及系统、客户端和服务器
CN114513350B (zh) 身份校验方法、系统和存储介质
CN101278299A (zh) 计算系统功能部件激活机制
CN114244607B (zh) 单点登录方法、系统、设备、介质和程序
CN112187786B (zh) 网络服务的业务处理方法、装置、服务器及存储介质
KR20220066842A (ko) 블록체인 기반 스미싱 방지 방법 및 장치
EP4548618A1 (de) System und verfahren zur validierung von zugangstoken bei einer netzwerkspeicherfunktion
CN113489726B (zh) 流量限制方法及设备
US10333946B1 (en) Distributing variable entropy ephemeral security credentials across channels of variable assurance
US11223488B2 (en) Client certificate authentication in multi-node scenarios
CN111552985B (zh) 一种信息核验方法和装置
CN105474228A (zh) Io设备与硬件安全元件的自动配对
CN108965108B (zh) 一种消息推送方法及相关设备
WO2024033888A1 (en) System and method for secure communication between a device and an application server
EP4635160A1 (de) System und verfahren zur wiederverwendung von sitzungsparametern über verschiedene netzwerke hinweg
US20250385813A1 (en) System and method for pusch symbol rate processing
WO2023095086A1 (en) A system and method for creating automated internet account(s)

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

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

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20241210

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 ME MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)