H04L9/30

SECURING CONNECTIONS TO UNSECURE INTERNET RESOURCES

A computer program product having a computer readable non-transitory storage medium. The storage medium having encoded thereon a computer code for instructing at least one hardware processor to automatically: (a) intercept a plurality of data packets transported over a computer network; (b) analyze said plurality of data packets to identify at least one secure connection request to an unsecure domain hosted on at least one web server; (c) retrieve a digital security certificate for the unsecure domain from a trusted certification authority; (d) associate the digital security certificate with the unsecure domain, thereby converting the unsecure domain to a secure domain; (e) send the digital security certificate to at least one second client terminal. Thereby the computer program product facilitates a secure connection between the at least one second client terminal and the secure domain.

Method and system for key agreement utilizing semigroups
11711208 · 2023-07-25 · ·

A method for key agreement between a first party and a second party over a public communications channel, the method including selecting, by the first party, from a semigroup, a first value “a”; multiplying the first value “a” by a second value “b” to create a third value “d”, the second value “b” being selected from the semigroup; sending the third value “d” to the second party; receiving, from the second party, a fourth value “e”, the fourth value comprising the second value “b” multiplied by a fifth value “c” selected by the second party from the semigroup; and creating a shared secret by multiplying the first value “a” with the fourth value “e”, wherein the shared secret matches the third value “d” multiplied by the fifth value “c”.

Method and system for key agreement utilizing semigroups
11711208 · 2023-07-25 · ·

A method for key agreement between a first party and a second party over a public communications channel, the method including selecting, by the first party, from a semigroup, a first value “a”; multiplying the first value “a” by a second value “b” to create a third value “d”, the second value “b” being selected from the semigroup; sending the third value “d” to the second party; receiving, from the second party, a fourth value “e”, the fourth value comprising the second value “b” multiplied by a fifth value “c” selected by the second party from the semigroup; and creating a shared secret by multiplying the first value “a” with the fourth value “e”, wherein the shared secret matches the third value “d” multiplied by the fifth value “c”.

BYPASSING CERTIFICATE PINNING
20180013754 · 2018-01-11 ·

A client application performs certificate pinning as a means of authenticating the identity of a server. A proxy is interposed in the communications path of the client and the hosting server and provides a proxy security certificate to the client. In response to the client extracting a proxy authentication component from the proxy security certificate, operation of the client is paused and a hosting server authentication component is extracted from a hosting server security certificate. The client operation is resumed, providing the extracted hosting server authentication component to the client, in substitution for the proxy authentication component. Based on receiving the extracted hosting server authentication component, the client authenticates the proxy to receive communications directed to the hosting server.

EFFICIENT DYNAMIC PROOFS OF RETRIEVABILITY
20180013828 · 2018-01-11 · ·

The present invention relates to a data storage and retrieval system. The system includes a at least one client device; and at least one-server. The server includes at least one memory, a processor and a log store. The client data is divided into different blocks and stored in the server. Different logs are generated for each block and stored in the log store. The storage in the server are audited for ensuring their integrity. The present invention also relates to a method used to store and retrieve data form the above system. The present invention also relates to a method used to initialize empty buffers in a storage of a system.

EFFICIENT DYNAMIC PROOFS OF RETRIEVABILITY
20180013828 · 2018-01-11 · ·

The present invention relates to a data storage and retrieval system. The system includes a at least one client device; and at least one-server. The server includes at least one memory, a processor and a log store. The client data is divided into different blocks and stored in the server. Different logs are generated for each block and stored in the log store. The storage in the server are audited for ensuring their integrity. The present invention also relates to a method used to store and retrieve data form the above system. The present invention also relates to a method used to initialize empty buffers in a storage of a system.

Non-3GPP device access to core network

A non-SI device (120) is arranged for wireless communication (130) and cooperates with an SI device (110) having access to a subscriber identity. The non-SI device has a transceiver (121) to communicate in a local network and a processor (122) to establish an association with the SI. A non-SI public key is provided to the SI device via a first communication channel. A verification code is shared with the SI device via a second communication channel. The channels are different and include an out-of-band channel (140). Proof of possession of a non-SI private key is provided to the SI device via the first or the second communication channel. From the SI device, security data is received that is related to the SI and is computed using the non-SI public key. The security data reliably enables the non-SI device to access the core network via the local network and a gateway between the local network and the core network.

Quantum safe key exchange scheme

Aspects of the invention include a computer-implemented method of executing a hybrid quantum safe key exchange system. The computer-implemented method includes initially retrieving an authenticated random value from a trusted source, generating a first Z value using a first elliptic curve (EC) private key and a first certified form of an EC public key with an EC Diffie-Hellman (ECDH) algorithm, deriving a shared key using the authenticated random value and the first Z value with a key derivation function, decrypting the authenticated random value using a quantum safe algorithm (QSA) private key, generating a second Z value using a second EC private key and a second certified form of the EC public key with the ECDH algorithm and deriving the shared key using the authenticated random value and the second Z value with the key derivation function.

Fast unbreakable cipher
11711364 · 2023-07-25 · ·

An authentication and encryption protocol is provided that can be implemented within a single clock cycle of an integrated circuit chip while still providing unbreakable encryption. The protocol of the present invention is so small that it can co-exist on any integrated circuit chip with other functions, including a general purpose central processing unit, general processing unit, or application specific integrated circuits with other communication related functionality.

DOMAIN NAME BLOCKCHAIN USER ADDRESSES
20230239140 · 2023-07-27 · ·

Techniques for DNS registry facilitated assignment of a DNS domain name registered to a registrant as a blockchain user address in a blockchain network are presented. The techniques can include providing, by a DNS registry, a public key and a computer executable registry signature verification program configured to use the public key to validate signatures made using the private key for addition to a block in a blockchain of the blockchain network. The techniques can also include receiving a request for a proof of registrar of record, and providing a proof of registration message, such that the registry signature verification program validates the signature using the public key, and the blockchain network receives and stores in the blockchain an association between the domain name and an existing blockchain user address for the registrant.