Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020115265 - CERTIFICATELESS PUBLIC KEY ENCRYPTION USING PAIRINGS

Note: Text based on automatic Optical Character Recognition processes. Please use the PDF version for legal matters

[ EN ]

CERTIFICATELESS PUBLIC KEY ENCRYPTION USING PAIRINGS

TECHNICAL FIELD

The invention generally relates to cryptosystems and in particular to the security of identity-based encryption systems.

BACKGROUND

Cryptographic mechanisms are used in many fields to protect stored, processed, and transferred information against interceptors or eavesdroppers. Several keyed cryptographic algorithms exist. They rely on the use of secret/private information to protect data and provide confidentiality, integrity, authenticity, and non-repudiation services.

In key-based cryptographic systems, cryptographic keys are used to generate ciphertext data from original data through an encryption mechanism and to recover the original data through a decryption mechanism. The encryption mechanism uses an encryption key, while the decryption mechanism uses a decryption key. The encryption key and the decryption key may be either similar or different.

In symmetric-key cryptosystems, the encryption key and the decryption key are the same, the same cryptographic key being used for encryption of original data and decryption of plaintext. The encryption and decryption keys in symmetric-key cryptosystems represent a shared secret between the users that is used to maintain a private information link. Exemplary symmetric-key cryptosystems comprise the Diffie-Hellman key exchange method, and the AES (Advanced Encryption Standard) cryptosystems.

In public-key cryptosystems, the encryption key and the decryption key are different. More specifically, in a public-key cryptosystem, each user of the cryptosystem generates a pair of encryption key/decryption key. The encryption key, also referred to as a public key, is a public value that the user publishes/disseminates to the remaining users of the cryptosystem. The decryption key, also referred to as a private key, is secret and kept known only by the owner.

Any user of a public-key cryptosystem can encrypt a message using the public key of the recipient. The encrypted message can only be decrypted with the private key of the recipient. Public-key cryptosystems allow public key encryption, ensure confidentiality, and allow digital signatures in which a message can be signed with a user’s private key and verified with the user’s public key. Exemplary public-key cryptosystems comprise the RSA (Rivest-Shamir-Adleman) cryptosystems.

A major challenge of public-key cryptosystems is to ensure the authenticity of public keys, which involves ensuring that a particular public key is correct, belongs to the claimed user, and has not been tampered or replaced by a malicious third party. In order to guarantee the authenticity of public keys, existing public-key cryptosystems use a public key infrastructure in which one or more certificate authorities certify ownership of public/private keys.

In “A. Shamir, Identity- Based Cryptosystems and Signature Schemes, In: Blakley G.R., Chaum D. (eds) Advances in Cryptology, CRYPTO 1984”, Shamir proposed a novel type of public cryptographic schemes, referred to as‘identity-based cryptosystems’. The identity-based cryptosystems and signature schemes enable a secure communication of message and verification of signatures between the users of a cryptosystem without exchanging private or public keys. Such cryptosystems comprise a center referred to as a‘trusted center’ or a‘public-key generation center’ and rely on the use of an identity information that uniquely identifies each user in the cryptosystem to generate a public/private key common to each user. The role of the trusted center is to give to each user a private key when the user first joins the system. During a setup step, the trusted center determines, from a given security parameter, global system parameters and a secret master key. The global system parameters are then made public to all the users. Then, during a key generation step, the trusted center receives the identity information of each user, computes a private key in association with the identity information, and sends to each user his private key. The trusted computes the private keys of all the users in the system using the global system parameters and the secret master key it previously determined from the security parameter. Messages are encrypted by the users using the global system parameters and the identity information of the receiver of the encrypted message, used as a public key. Encrypted messages are

decrypted using the global system parameters and the private key associated with the identity information that was used in the encryption step as encryption key.

Several identity-based cryptographic schemes have been developed, including:

-“D. Boneh and M. K. Franklin, Identity-Based Encryption from the Weil

Pairing, In: Kilian J. (eds) Advances in Cryptology, CRYPTO 2001”;

- “C. Cocks, An Identity- Based Encryption Scheme Based on Quadratic Residues, In: Honary B. (eds) Cryptography and Coding. Cryptography and Coding 2001”;

- “S. S. Al-Riyami and K. G. Paterson, Certificateless Public Key

Cryptography, In: Laih CS. (eds) Advances in Cryptology - ASIACRYPT 2003”;

- Patent application No. EP1519530A1 that describes a method for establishing an encrypted communication by means of keys;

- US Patent No. US 7,239,701 B1 ;

- US Patent No. US 2005/0089173 A1 ; and

- Patent No. WO20131 16928A1 that describes the Verifiable Identity Based Encryption Protocol in which a method for sending encrypted messages over possible unsecured channels is developed.

The security of identity-based cryptosystems depends on the security of the cryptographic functions implemented to determine the private keys, on the secrecy of the information stored at the trusted center (e.g. the master key, the private keys of the users), the identity checks performed by the trusted center before delivering private keys to the users based on their identity information, and on the actions taken by the users to safely hold their private keys and prevent their loss, duplication, or unauthorized access/use.

In existing identity-based encryption schemes, the trusted center knows all the private keys of all the users since it determined the private keys from each identity information associated with each user. The knowledge of the private keys allows the trusted center to completely decrypt any encrypted message. This problem is known as the key escrow problem. If an attacker recovers the master key that the trusted center uses to determine the private keys from the identity information associated with each user, the attacker can have access to each sent message. If a corruption of the master key occurs, then the trusted center must generate another master key and must re-compute and re-distribute all the private keys for all the users in the system.

There is accordingly a need for securing identity-based cryptosystems against the key escrow problem and more generally, there is a need for developing secured identity-based cryptosystems.

SUMMARY

In order to address these and other problems, there is provided a transmitter device for sending an encrypted message to a receiver device in an identity-based cryptosystem, the transmitter device being associated with a transmitter identifier. The transmitter device may be configured to receive a transmitter partial private key from a trusted center, the transmitter device being configured to:

- send a request for two public session keys to the receiver device;

- receive from the receiver device a first ciphertext set, the first ciphertext set being derived from an encryption and authentication of two public session keys;

- decrypt and authenticate the two public session keys from the first ciphertext set using a receiver identifier and the transmitter partial private key;

- determine a second ciphertext set from the transmitter partial private key, from the receiver identifier, and from the two public session keys, the second ciphertext comprising an encrypted message;

- send the second ciphertext set to the receiver device.

According to some embodiments, the transmitter partial private key may depend on the transmitter identifier associated with the transmitter device.

According to some embodiments, the identity-based cryptosystem may be associated with system parameters comprising an admissible bilinear map, a first cryptographic hash function, a second cryptographic hash function, a third cryptographic hash function, and a trusted center public key associated with the trusted center, the first ciphertext set comprising a first ciphertext, a second ciphertext, a third ciphertext, a fourth ciphertext, and a fifth ciphertext. The transmitter device may be configured to:

- apply the first cryptographic hash function to the receiver identifier, which provides a receiver public key;

- apply a subtraction operation between (i) the second ciphertext, and (ii) the output of the second cryptographic hash function applied to the bilinear map applied to the transmitter partial private key and to the first ciphertext, which provides a secret key;

- apply a decipher to the third ciphertext, which provides a recovered first public session key, the decipher using the secret key as a decryption key;

- apply the decipher to the fourth ciphertext, which provides a recovered second public session key;

- apply the third cryptographic hash function to the secret key, to the recovered first public session key, and to the recovered second public session key, which provides a recovered intermediate value;

- check if the fifth ciphertext is equal to the output of the second cryptographic hash function applied to an input value, the input value being the output of the bilinear map applied to (iii) the transmitter partial private key, and (iv) to the receiver public key to the power the recovered intermediate value.

According to some embodiments, the transmitter device may be configured to check whether a trusted center identity verification condition and/or a public session keys verification condition are verified, the trusted center identity verification condition being satisfied if the output of the bilinear map applied to the transmitter partial private key and to the trusted center public key is equal to the output of the bilinear map applied to:

- the result of the first cryptographic hash function applied to the transmitter identifier, and

- the result of the first cryptographic hash function applied to the trusted center identifier,

the public session keys comprising a first public session key and a second public session key, the public session keys verification condition being satisfied if the output of the bilinear map applied to the first public session key and to the result of the first cryptographic hash function applied to the transmitter identifier is equal to the output of the bilinear map applied to the second public session key and to the transmitter partial private key.

According to some embodiments, the second ciphertext set may further comprise a first component, a second component, and a third component, the transmitter device being configured to:

- generate a random secret key;

- apply the first cryptographic hash function to the receiver identifier, which provides a receiver public key;

- apply a third cryptographic hash function to the random secret key and to a given message, which provides an auxiliary value;

- apply an exponentiation function of a base equal to a trusted center public key and an exponent equal to the auxiliary value, which provides the first component;

- add the random secret key to the output of the second cryptographic hash function applied to the result of the bilinear map applied to the first public session key to the power the auxiliary value and to the receiver device public key, which provides the second component;

- apply a cipher to a given message using the random secret key, which provides an encrypted message;

- apply a second cryptographic hash function to the result of the bilinear map to the power the auxiliary value, the bilinear map being applied to the transmitter partial private key and to the receiver public key, which provides the third component.

There is also provided a receiver device for receiving an encrypted message from a transmitter device, the transmitter device being associated with a transmitter identifier, the receiver device being configured to determine two public session keys from a receiver partial private key associated with the receiver device and from system parameters, the receiver device being configured to send a first ciphertext set to the transmitter device, the receiver device being configured to determine the first ciphertext set from an encryption of the two public session keys, the receiver device being configured to receive a second ciphertext set from the transmitter device comprising the encrypted message, the second ciphertext set depending on a transmitter partial private key received from a trusted center, a receiver identifier associated with the receiver device, and the two public session keys, the receiver device being configured to recover the original message by decrypting the encrypted message and authenticating the transmitter device.

According to some embodiments, the system parameters may comprise a prime number, two algebraic groups of order equal to the prime number, an admissible bilinear map, a first cryptographic hash function, a second cryptographic hash function, a third cryptographic hash function, and a trusted center public key associated with a trusted center identifier.

According to some embodiments, the receiver partial private key may depend on a receiver identifier associated with the receiver device.

According to some embodiments, the receiver device may be configured to verify a trusted center public key associated with the trusted center using the receiver partial private key and to determine a private session key, two public session keys comprising a first public session key and a second public session key, and a first ciphertext set if a verification condition is satisfied, the verification condition being satisfied if the receiver device determines that a first value is equal to a second value, the first value being determined by applying the bilinear map to the receiver device partial private key and to the trusted center public key, the second value being determined by applying the bilinear map to the output of the first cryptographic hash function applied to the receiver identifier and to the output of the first cryptographic hash function applied to the trusted center identifier.

According to some embodiments, the receiver device may be configured to determine a random value and to determine the private session key by applying an exponentiation function of a base equal to the receiver partial private key and an exponent equal to the random value, the two public session keys comprising a first public session key and a second public session key, the receiver device being configured to determine the first public session key by applying an exponentiation function of a base equal to the output of the application of the first cryptographic hash function to a trusted center identifier and an exponent equal to said random value, and to determine the second public session key by applying an exponentiation function of a base equal to the trusted center public key and an exponent equal to the random value.

According to some embodiments, the first ciphertext set may comprise a first ciphertext, a second ciphertext, a third ciphertext, a fourth ciphertext, and a fifth ciphertext, the receiver device being configured to randomly generate a random secret key, the receiver device being configured to determine a transmitter public key by applying the first cryptographic hash function to the transmitter device identifier, and to determine a first intermediate value by applying the third cryptographic hash function to the random secret key, to the first public session key, and to the second public session key, the receiver device being further configured to:

- determine the first ciphertext by applying an exponentiation function of a basis equal to the trusted user public key and an exponent equal to the first intermediate value;

- add the random secret key to a value, which provides the second ciphertext, the value being the result the second cryptographic hash function applied to the output of the bilinear map applied to a first input and a second input, the first input being the result of an exponentiation function having a basis given by the transmitter device public key and an exponent given by said intermediate value, the second input being of the result of the first cryptographic hash function to applied to the trusted center identifier;

- determine the third ciphertext by applying a cipher algorithm to the first public session key, the cipher algorithm using the random secret key as encryption key;

- determine the fourth ciphertext by applying a cipher algorithm to the second public session key; and

- determine the fifth ciphertext by applying a second cryptographic hash function to the output of the application of the bilinear map exponent the first intermediate value, the output being obtained by applying the bilinear map to the receiver partial private key and the transmitter public key.

According to some embodiments, the second ciphertext set further comprises a first component, a second component, and a third component, the first component, the receiver device being configured to:

- determine a transmitter public key by applying the first cryptographic hash function to the transmitter identifier;

- determine a secret key by applying a subtraction operation to the second component comprised in the second ciphertext set and to the output of the application of the second cryptographic hash function to the result of the application of the bilinear map to the first component comprised in the second ciphertext set and to the private session key;

- determine the original message by decrypting the encrypted message using a decipher that uses the secret key as a decryption key;

- determine an auxiliary value by applying the third cryptographic hash function to the secret key and the original message; and

- verify the identity of the transmitter device by checking if a transmitter identity verification condition is satisfied, the transmitter identity verification condition being satisfied if the receiver device determines that the third component comprised in the second ciphertext set is equal to the output of the second cryptographic hash function applied to an output result to the power of the auxiliary value, the output result being determined by the application of the bilinear map to the transmitter device public key and the receiver device partial private key.

There is also provided an identity-based cryptosystem comprising a trusted center, the trusted center being configured to determine system parameters and a master private key from a trusted center security parameter and a trusted center identifier, the system parameters comprising a prime number, two algebraic groups of order equal to the prime number, an admissible bilinear map, a first cryptographic hash function, a second cryptographic hash function, a third cryptographic hash function, and a trusted center public key associated with the trusted center identifier, the trusted center being configured to:

- generate the prime number, the two algebraic groups and the admissible bilinear map byrunning a Bilinear Diffie-Hellman parameter generator that takes as input the trusted center security parameter;

- select a first cryptographic hash function, a second cryptographic hash function, and a third cryptographic hash function from a predefined set of cryptographic hash functions;

- determine a first value by applying the first cryptographic hash function to the trusted center identifier;

- randomly select a master secret key; and

- determine the trusted center public key by applying an exponentiation function defined by a base and an exponent, the base being equal to the first value, and the exponent being equal to the master private key.

According to some embodiments, the trusted center may be configured to determine a transmitter partial private key and a receiver partial private key from the master secret key, the system parameters, a transmitter identifier and a receiver identifier, the trusted center being configured to determine a transmitter public key by applying the first hash function to a transmitter device identifier and to determine the transmitter partial private key by applying an exponentiation function defined by a base and an exponent, the base being equal to the transmitter public key, and the exponent being equal to the inverse of the master secret key, the trusted center being configured to determine a receiver public key by applying the first hash function to the receiver identifier and to determine the receiver partial private key by applying an exponentiation function defined by a base and an exponent, the base

being equal to the receiver public key, and the exponent being equal to the inverse of the master secret key.

Advantageously, the embodiments of the invention enable resolving the key escrow problem, the trusted center having no access to the messages sent between the users and having only access to partial private keys of the users.

Advantageously, the embodiments of the invention enable assuring the forward secrecy between the users and the protection of the messages sent and to be sent between the users against any corruption occurring on the master key hold by the trusted center.

Advantageously, the identity-based cryptosystem according to the embodiments of the invention provide and guarantee data confidentiality between the users and authentication of the users that the identity of each sender and each recipient can be verified.

Further advantages of the present invention will become clear to the skilled person upon examination of the drawings and detailed description. It is intended that any additional advantages be incorporated herein.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate various embodiments of the invention and, together with the general description of the invention given above, and the detailed description of the embodiments given below, serve to explain the embodiments of the invention.

Figure 1 is a schematic diagram of an exemplary implementation of the invention in a cryptosystem 100;

Figure 2 is a flowchart depicting a method of encrypting and sending a message from a sender to a recipient in a cryptosystem 100, according to some embodiments of the invention;

Figure 3 is a flowchart depicting a method for determining at the trusted center 101 system parameters and a master private key s according to a setup algorithm in accordance with some embodiments of the invention;

Figure 4 is a flowchart depicting a method for determining at the trusted center 101 a sender partial private key and a recipient partial private key according to the KeyGenl algorithm in accordance with some embodiments of the invention;

Figure 5 is a flowchart depicting a method for determining at the recipient 105 a private session key and two public session keys according to the KenGen2 algorithm in accordance with some embodiments of the invention;

Figure 6 is a flowchart depicting a method for determining at the recipient

105 a first ciphertext set according to the Encryptl algorithm in accordance with some embodiments of the invention;

Figure 7 is a flowchart depicting a method for decrypting and authenticating the two public session keys at the sender 103 according to the Decryptl algorithm in accordance with some embodiments of the invention;

Figure 8 is a flowchart depicting a method for computing a second ciphertext set at the sender 103 according to the Encrypt2 algorithm in accordance with some embodiments of the invention;

Figure 9 is a flowchart depicting a method for recovering an original message at the recipient 105 according to the Decrypt2 algorithm in accordance with some embodiments of the invention; and

Figure 10 is a block diagram representing an exemplary hardware/software architecture of a device 1000 operating in the cryptosystem 100 such as the trusted center 101 , the sender 103, or the recipient 105, according to some embodiments of the invention.

DETAILED DESCRIPTION

Embodiments of the invention provide devices and methods for secured, confidential, and authenticated exchange of messages between a pair of users, comprising a sender (also referred to herein as a‘transmitter’, a‘sender device’ or a ‘transmitter device’) and a recipient (also referred to hereinafter as a‘receiver’, a ‘recipient device’ or a ‘receiver device’), in an identity-based encryption cryptosystem (also referred to as a‘cryptographic system’).

Referring to figure 1 , there is shown a cryptosystem 100 in which the embodiments of the invention may be applied. The cryptosystem 100 may comprise a sender 103 and a recipient 105 connected via a link 107 and a trusted center 101 .

The sender 103 and the recipient 105 may be any user, user device, equipment, object, entity, configured to operate in the cryptosystem 100. More specifically, the sender 103 may be any user device, user equipment, user object, or user apparatus configured or configurable to determine an encrypted message from original data and to transmit the encrypted message to the recipient 105. The recipient 105 may be any user device, user equipment, user object, or user apparatus configured or configurable to receive the encrypted message transmitted over the link 107 and to decrypt the encrypted message to recover original data. It should be noted that in the figures, the sender 103 and the recipient 105 are labeled according to the direction of transmission and reception of encrypted messages. However, in practice, the sender 103 and the recipient 105 may be any transceivers devices capable of transmitting and receiving data in any cryptosystem 100.

In some embodiments, the sender 103 and the recipient 105 may be any cryptographic device that implement hardware and/or software cryptographic functions for ensuring data and/or signals security, encryption, authentication, protection, and privacy. As used herein, a‘cryptographic device’ encompasses any device, computer, computing machine, or embedded system, programmed and/or programmable to perform cryptographic functions for the generation and the use of cryptographic keys. Exemplary cryptographic devices include, without limitation:

- smartcards, tokens to store keys such as wallets, smartcards readers such as Automated Teller Machines (ATM) used for example in financial transactions, restricted access, telecommunications, military applications, secure communication equipments, and TV set-top boxes;

- electrical and digital electronic devices such as RFID tags and electronic keys;

- embedded secure elements;

- computers (e.g. desktop computers and laptops), tablets;

- routers, switches, printers;

- mobile phones such as smartphones, base stations, relay stations, satellites;

- Internet of Thing (loT) devices, robots, drones; and

- recorders, multimedia players, mobile storage devices (e.g. memory cards and hard discs) with logon access monitored by cryptographic mechanisms.

The embodiments of the invention may be applied in any a cryptosystem 100, which may be used in different applications in storage, information processing, or communication systems.

For example, in an application of the invention to storage systems, the cryptosystem 100 may represent a storage system, infrastructure, or network, the sender 103 and/or the recipient 105 being part of such cryptosystem and comprising one or more storage devices configured to store oruse encrypted data (e.g. memory cards or hard discs).

In an application of the invention to information processing, the cryptosystem 100 may be for example a computer system (e.g. a small or large area wired or wireless access network), a database, an online sale system or a financial system comprising a sender 103 and a recipient 105 configured to secure the data used and/or stored in the system (such as personal financial or medical data).

In an application of the invention to communication systems, the cryptosystem 100 may be wired/wireless/optical/radio communication network in which at least one sender 103 is configured to transmit, over a medium 107 that can be unsecure, encrypted data to at least one recipient 105.

Original data may correspond to text files, video, audio, or any other media data.

The sender 103 and/or the recipient 105 may be fixed such as a computer operating in a wired communication system, or mobile, such as a user terminal operating in a radio or wireless network.

The link 107 may correspond to a network (e.g. Internet-based network, computer network) or to any communication medium (wired, wireless, or optical).

The sender 103 and the recipient 105 may be configured to select the trusted center 101 in the cryptosystem 100 and to identify the trusted center by its identity information. The sender 103 may be further configured to select the recipient 105 among the users of the cryptosystem 100.

The trusted center 101 may be connected to the sender 103 and the recipient 105. The trusted center 101 may be a device, an entity, or a system such as an organization (e.g. a social public organization, headquarters of a corporation) configured or configurable to generate private keys associated with the identity information of the users when they join the cryptosystem 100.

According to some embodiments, the trusted center 101 may be a system administrator, a dedicated server, or a server that is part of a distributed network.

Each user in the cryptosystem 100 may be associated with an identity information, also referred to as‘an identifier’, that uniquely identifies the user in the cryptosystem 100. In some embodiments, an identifier may be one or a combination of two or more identifiers chosen in a group comprising an identity sequence, a name, a username, a network address, a social security number, a street address, an office number, a telephone number, an electronic mail address associated with a user, a date, an Internet Protocol address belonging to a network host. An identifier associated with each user may be any public, cryptographically unconstrained string that is used in conjunction with public data of the trusted center 101 to perform data encryption or signing.

In the following description of some embodiments, the identity information associated with the sender 103 will also be referred to the‘sender identifier’ or ‘transmitter identifier’, the identity information associated with the recipient 105 will be referred to as the ‘recipient identifier’ or‘receiver identifier’, and the identity information associated with the trusted center will be also referred to as the‘trusted center identifier’.

Each of the sender identifier, the recipient identifier, and the trusted center identifier may be strings that belong to the set {0,1}*.

In order to facilitate the understanding of the various embodiments of the invention, the following definitions are provided:

- n E M designates a non-zero natural number;

- l e Έ+ is a positive value integer number designating a security parameter (also referred to a trusted center security parameter);

- p E M designates a prime number;

- F2 = TLI L designates a Euclidean domain (also called a Euclidean ring) and F2[x] designates the ring of polynomials having coefficients that belong to the Euclidean ring F2;

- G and GT designate two groups of order p;

- e G x G ® GT designates a bilinear map;

- H^. {0,l}n ® G designates a first cryptographic hash function;

- H2 GT ® {0,l}n designates a second cryptographic hash function;

- H3 : {0,l}n x {0,l}n ® Έr designates a third cryptographic hash function;

- M = {0,l}n represents a finite message space, i.e. the space to which belongs each message (also referred to as an‘original message’ or a‘plaintext message’, or a‘plaintext’);

- M E M designates a plaintext message;

- e = G* x {0,l}n represents a finite ciphertext space, i.e. the space to which belongs each encrypted message (also referred to as a‘ciphertext’ or a‘ciphertext message’);

- C(M) e C designates a ciphertext message computed by encrypting the plaintext message M;

IDTC refers to the trusted center identifier;

lDsend refers to the sender identifier (also referred to as a ‘transmitter identifier’);

- Wreci refers to the recipient identifier (also referred to as a ‘receiver identifier’);

gpub refers to a trusted center public key;

- gSend refers to a sender public key (also referred to as a‘transmitter public key’);

greci refers to a recipient public key (also referred to as a‘receiver public key’);

- Prvsend refers to a sender partial private key (also referred to as a ‘transmitter partial private key’) associated with the sender public key gsend

Prvreci refers to a recipient partial private key (also referred to as a

‘receiver partial private key’) associated with the recipient public key greci ,

- s refers to a master secret key;

pub1 refers to a first public session key;

pub2 refers to a second public session key;

sk refers to a private session key;

- Es (. ) designates a cipher (also referred to as a‘ciphertext algorithm’) that uses a cryptographic key s as encryption key and Dff(. ) designates the decipher associated with the cipher Es(. ) such that a message encrypted using the cipher Eg(. ) is successfully recovered only if it is decrypted with the decipher Dff(. ) that uses the cryptographic key s as a decryption key. The cipher is symmetric.

The embodiments of the invention provide a sender 103 operable to transmit an encrypted message C(M) to a recipient 105 in an identity-based cryptosystem

100 that comprises a trusted center 101 , the sender 103 and the recipient 105 being configured to communicate over the link 107 securely, independently, and without accessing the trusted center 101. Accordingly, the transmission of encrypted messages from the sender 103 to the recipient 105 may be completed without contacting the trusted center 101. In the identity-based cryptosystem 100, the sender 103 is associated with a sender identifier IDsend and the recipient is associated with a recipient identifier IDreci , and both the sender 103 and the recipient 105 are connected to the trusted center 101.

The trusted center 101 may be configured to initiate the setup of the cryptosystem 100 and to manage the generation and distribution of the private keys of the users including the sender 103 and the recipient 105. Accordingly, the trusted center 101 may be configured to receive the sender identifier IDsend from the sender 103 and the recipient identifier IDreci from the recipient 105 and to determine a sender partial private key Prvsend from the sender identifier IDsend and a recipient partial private key Prvreci from the recipient identifier IDreci. The trusted center 101 has accordingly only access to a part of the private keys of the sender 103 and the recipient 105. The trusted center 101 may be further configured to distribute the partial private keys, i.e. to send the sender partial private key to the sender 103 and to send the recipient partial private key to the recipient 105. Once the trusted center

101 delivered the partial private keys to the sender 103 and the recipient 105, the sender partial private key and the recipient partial private key may not need to be updated, for example if new users join the cryptosystem 100. The trusted center 101 may be closed after the sender and recipient partial private keys are issued and the cryptosystem 100 may continue to operate in a completely decentralized manner for an indefinite period.

According to the embodiments of the invention, the sender 103 may be configured to send the encrypted message using two exchange steps with the recipient 105 that involve the use and authentication of two additional public session keys, pub-L and pub2.

Accordingly, the sender 103 may be configured to send a request to the recipient 105 asking for two public session keys pub1 and pub2.

Upon reception of the two public session keys request sent from the sender 103, the recipient 105 may be configured to determine a private session key sk and two public session keys pub1 and pub2 from the recipient partial private key Prvreci and system parameters denoted by PK and to determine a first ciphertext set denoted by Ct from encryption and authentication of the two public keys pub1 and pub2. The sender 103 may be configured to receive the first ciphertext set from the recipient 105.

After receiving the first ciphertext set C, the sender 103 may be configured to decrypt and authenticate the two public session keys from the first ciphertext set denoted by Ct using the recipient identifier Wreci and the sender partial private key

P Vsend

The operations performed so far by the sender 103 enable providing two public session keys pub and pub2 to the sender 103, the two public session keys being securely and authentically sent from the recipient 105.

Now, the sender 103 operates in the second phase of the exchange of data to securely and authentically send the encrypted message C(M) to the recipient 105.

Accordingly, the sender 103 may be configured to determine a second ciphertext set denoted by C2 from the sender partial private key Prvsend , the recipient identifier Wreci and the two public keys pub1 and pub2 , the second ciphertext set comprising an encrypted message C(M).

The sender 103 may be configured to send the second ciphertext set C2 to the recipient 105, the recipient 105 being configured to recover the original message M by decrypting the encrypted message C(M) comprised in the received second ciphertext set and authenticating the sender 103.

The trusted center 101 has secret information that enables it to compute the partial private keys of all the users in the cryptosystem 100. More specifically, the trusted center 101 may be configured to hold a security parameter denoted by

l e Ί+ and a trusted center identifier IDTC and to generate system parameters PK and a master private key (also referred to as a‘master secret key’) s from the security parameter l and the trusted center identifier IDTC. The system parameters denoted by PK = {p, G, GT, e, H1, H2, H3, gpub} comprise a prime number p , two algebraic groups G and GT of order equal to the prime number p , an admissible bilinear map e, a first cryptographic hash function Hl t a second cryptographic hash function H2, a third cryptographic hash function H3, and a trusted center public key gpub associated with the trusted center identifier 1DTC.

When computed, the trusted center 101 makes the system parameters known publicly, i.e. to all the users in the cryptosystem including the sender 103 and the recipient 105. The trusted center 101 keeps, however, the master private key sk private and known only to the trusted center 101.

The security parameter l is used to determine the system parameters and the master private key. In particular, the security parameter may allow to determine the size, in bits, of the master private key such that s e Έr, with n being a non-zero natural number. The security parameter may be also used to determine the size of the prime number in bits. For example, the prime number may be selected to be a random 2-bits prime number.

According to some embodiments, the bilinear map e may be based on a Weil pairing or a Tate pairing defined on a subgroup of an elliptic curve. In such embodiments, the elements of the algebraic group G may be points on an elliptic curve.

According to some embodiments, the trusted center 101 may be configured to determine the system parameters and the master private key by applying a setup algorithm that takes as input the security parameter l and the trusted center identifier IDTC and returns as outputs the system parameters PK and a master private key sk. According to the setup algorithm, the trusted center 101 may be configured to generate a prime number p, the two algebraic groups G and GT and an admissible bilinear map e by running a Bilinear Diffie-Hellman parameter generator that takes as input the security parameter l and outputs a prime number p , the

description of two groups G and GT and the description of an admissible bilinear map e\ G x G Gj·.

Given the security parameter, the trusted center 101 may be configured to select, among a predefined set of cryptographic hash functions, a first cryptographic hash function H^. {0,l}n ® G, a second cryptographic hash function H2: GT ® {0,l}n, and a third cryptographic hash function H3 : {0,l}n x {0,l}n ® Έr. The cryptographic hash function H1, H2 and H3 may be random oracles.

The trusted center 101 may be then configured to determine a first value denoted by g by applying the first cryptographic hash function
to the trusted center identifier 1DTC such that g = H^ID-rc).

The trusted center 101 may be further configured to randomly select a master secret key s e p and to determine a trusted center public key gpub by applying an exponentiation function defined by a base and an exponent, the base being equal to the first value g, and the exponent being equal to the master private key s such that gpub = gs.

In embodiments in which the first value g corresponds to a point of an elliptic curve, the exponentiation function may be reduced to a scalar multiplication function according to which the trusted center public key gpub is determined according to

9pub — [s]§·

The sender 103 and the recipient 105 may ask the trusted center 101 to send them their partial private keys. The sender 103 may send the sender identifier lDsend to the trusted center 101 and ask it to receive the sender partial private key Prvsend · The recipient 105 may send the recipient identifier IDreci to the trusted center 101 and ask it to receive the recipient partial private key Prvreci . Upon reception of the requests sent by the sender 103 and the recipient 105, the trusted center 101 may be configured to determine the sender partial private key and the recipient partial private key from the master secret key s, the system parameters PK, and the sender identifier IDsend and the recipient identifier IDreci by applying a KeyGenl algorithm that takes as input the master secret key, the sender identifier, the recipient identifier, and the system parameters, and outputs the sender partial private key and the recipient partial private key. Accordingly, the trusted center 101 may be configured to determine a sender public key gsend by applying the first hash function Ht to the sender identifier IDsend such that gsend Hi(/£Send) and to determine the sender partial private key Prvsend by applying an exponentiation function defined by a base and an exponent, the base being equal to the sender public key ^send, and the exponent being equal to the inverse of the master secret

1 —

key - such that Prvsend gsends· ln embodiments in which the sender public key corresponds to a point of an elliptic curve, the exponentiation function may be replaced with a scalar multiplication function according to which Prvsend =

Similarly, the trusted center 101 may configured to determine a recipient public key greci by applying the first hash function
to the recipient identifier IDreci such that greci Hi(/£reci) and to determine the recipient partial private key Prvreci by applying an exponentiation function defined by a base and an exponent, the base being equal to the recipient public key greci, and the exponent being equal to the inverse of the master secret key such that Prvreci = grecis In embodiments in which the recipient public key corresponds to a point of an elliptic curve, the exponentiation function may be replaced with a scalar multiplication function according to which Prvreci ^] ,grec;.

According to the embodiments of the invention, the sender 103 encrypts an original message M and sends the encrypted message C(M) to the recipient 105 using public session keys that are determined by the recipient 105.

According to some embodiments, before determining the public session keys pub and pub2 , the recipient 105 may be configured to verify the trusted center public key gpub using the recipient partial private key Prvreci. The recipient 105 may be configured to determine a private session key sk, the two public session keys pub1 and pub2, and a first ciphertext set Ct if a verification condition is satisfied by applying a KenGen2 algorithm that takes as inputs the recipient partial private key and the system parameters and outputs a private session key and two public session keys. The verification condition may be satisfied if the recipient 105

determines that a first value e{Prvreci, gpub) is equal to a second value
the first value being determined by the application of the bilinear map e to the recipient partial private key Prvreci and to the trusted center public key gpub, the second value being determined by the application of the bilinear map e to the output (JDreci) of the first cryptographic hash function
applied to the recipient identifier IDreci and to the output H^IDj-c of the first cryptographic hash function Ht applied to the trusted center identifier IDTC . If the verification condition is satisfied, i.e. if the recipient 105 determines that e{Prvreci, gpub) = e^H^IDrec . H^IDTc)), then the recipient 105 computes a private session key and two public session keys. If the verification condition is not satisfied, i.e. if the recipient 105 determines that e{Prvreci, gpub) ¹ bΐH^IΌ^^, H^IΌt )) , then the recipient 105 aborts and does not compute the private and public session keys.

In embodiments in which the verification condition e(Prvreci, gpub ) =
#!(// )) is satisfied, the recipient 105, according to the KeyGen2 algorithm, may be configured to determine a random value denoted by b and to determine a private session key sk by applying an exponentiation function of a base equal to the recipient partial private key Prvreci and an exponent equal to the random value b such that sk = Prv^eci. In embodiments in which the recipient partial private key Prvreci corresponds to a point of an elliptic curve, the exponentiation function may be reduced to a scalar multiplication function according to which the private session key sk is determined according to sk = [b ] Prvreci . In such embodiments, the exponent is a scalar value.

The recipient 105 may be further configured to determine the two public session keys comprising a first public session key pu/^ and a second public session key pub2 by applying exponentiation function. More specifically, the recipient 105 may be configured to determine the first public session key pub1 by applying an exponentiation function of a base equal to the output Ht (IDTC) of the application of the first cryptographic hash function Ht to the trusted center identifier 1DTC and an exponent equal to the random value b such that
. In embodiments in which the output H^IDTC) corresponds to a point of an elliptic

curve, the exponentiation function may be replaced by a scalar multiplication according to which pub = [ ?]#! (7DTC) .

The recipient 105 may be configured to determine the second public session key pub2 by applying an exponentiation function of a base equal to the trusted center public key gpub and an exponent equal to the random value b such that pub2 = gpub = (fli(JDTCy)Ps . In embodiments in which the trusted center public key dpub corresponds to a point of an elliptic curve, the exponentiation function may be reduced to a scalar multiplication function according to which the second public session key pub2 is determined according to pub2 = W]gpUb |n such embodiments, the exponent b is a scalar value.

The private session key sk may be used for the conversation between the sender 103 and the recipient 105, i.e. the exchange of encrypted messages. The two public session keys may be used to authenticate the sender 103 and the recipient 105.

After generating the public session keys, the recipient 105 may be configured to determine a first ciphertext set Ct to be sent to the sender 103 to communicate the public session keys in an encrypted and authenticated way by applying an Encryptl algorithm that takes as inputs the sender identifier, the sender partial private key, the recipient identifier, the two public session keys and the system parameters, and outputs a first ciphertext set. The first ciphertext set Ct =

{y1; ί/1, n 11, n 12, Ti) comprises a first ciphertext Vx, a second ciphertext Ul a third ciphertext Wlt, a fourth ciphertext W12 , and a fifth ciphertext
The recipient 105 may be configured to first verify the trusted center public key using the recipient partial private key by checking if the verification condition e(Prvreci, gpub) =
is satisfied. If the recipient 105 determines that the verification condition is satisfied, then it generates the first ciphertext set Ct. If the recipient 105 determines that the verification condition is not satisfied, i.e. that e{Prvreci, gpub) ¹ e^H^IDrec^^^ID-rc)), then the recipient 105 aborts and does not compute the first ciphertext set.

In embodiments in which the verification condition is satisfied, i.e. when the recipient 105 determines e(Prvreci,
the recipient 105 may be configured, according to the Encryptl algorithm, to randomly generate a random secret key denoted by s , to determine a sender public key gsend = HiUDsend) by applying the first cryptographic hash function Ht to the sender identifier IDsend , and to determine a first intermediate value denoted by r = H3 (s, pub1, pub2) by applying the third cryptographic hash function H3 to the random secret key s, the first public session key pub1, and to the second public session key pub2. The recipient 105 may be further configured to:

- determine the first ciphertext V1 by applying an exponentiation function of a basis equal to the trusted user public key gpub and an exponent equal to the first intermediate value r such that V1 = gpub . The exponentiation function may be replaced by a scalar multiplication such that V1 = [r]gpub if the trusted center public key gpub corresponds to a point of an elliptic curve;

- determine the second ciphertext ί/c by adding the random secret key s to a value H2 (e(gsrend,


the value being determined by the application of the second cryptographic hash function H2 to the output b^bha, H^IΌto)) of the application of the bilinear map e to a first input gsrend and a second input H^IDTC), the first input gsrend being given by the application of an exponentiation function of a basis given by the sender public key gsend and an exponent given by the intermediate value r, the second input H^IDj-c being determined by the application of the first cryptographic hash function
to the trusted center identifier IDTC, the second ciphertext is according expressed as U1 = s + H2 (e(gsrend, ^(/D^))). The addition operation may be performed over F2 [x] in which case, the addition operation is an XOR operation;

- determine the third ciphertext WXi by applying a cipher algorithm Es(. ) to the first public session key pub1 such that Wlt = Ea(pub1) , the cipher algorithm using the random secret key s as encryption key;

- determine the fourth ciphertext W12 by applying the cipher algorithm Es(. ) to the second public session key pub2 such that W12 = Ea(pub2 ,

- determine the fifth ciphertext Y by applying the second cryptographic hash function H2 to the output of the application of the bilinear map exponent the first intermediate value (e(Prvreci,gsend))r, the output e(Prvreci,gsend) being obtained by applying the bilinear map e to the recipient partial private key Prvreci and the sender public key gsend . Accordingly, the fifth ciphertext is given by Yx =


The encryption of the public session keys by the recipient 105 is not performed to guarantee the data confidentiality, but it is performed to make more difficult the modification of the public session keys during its transfer over the link 107 potentially unsecure, from the recipient 105 to the sender 103.

According to some embodiments, upon reception of the first ciphertext set
from the recipient 105, the sender 103 may be configured to verify the identity of the recipient and to decrypt the two public session keys by applying a Decryptl algorithm that takes as inputs the sender identifier, the sender partial private key, the recipient identifier, the first ciphertext set and the system parameters and outputs decrypted two public session keys. Accordingly, the sender 103 may be configured to:

- determine a recipient public key greci by applying the first cryptographic hash function Ht to the recipient identifier Wreci such that greci = Ht (JDreciy

- determine a secret key s by applying a subtraction operation to the second ciphertext U1 and the output H2(e(Prvsend,V1)) of the application of the second cryptographic hash function H2 to the bilinear map e applied to the sender partial private key Prvsend and the first ciphertext V1 , the secret key s is accordingly expressed as s = U1 - H2{e(Prvsend,V-l ') . The subtraction operation may be performed over F2 [x] in which case, the subtraction operation is an XOR operation;

- decrypt the first public session key by applying a decipher Dff(. ) to the third ciphertext WXi, the decipher using the secret key s as a decryption key, which provides a recovered first public session key given by pub1 = D^W^

- decrypt the second public session key by applying the decipher Dff(. ) to the fourth ciphertext W12, which provides a recovered second public session key given by pub2 Dff(W12 ,

determine a recovered intermediate value r = H3(o, publr pub2) by applying the third cryptographic hash function H3 to the secret key s , the recovered first public session key pub^ and the recovered second public session key pub2 \

The sender 103 may be configured to verify the recipient identity by checking a verification condition, the verification condition being satisfied if the sender 103 determines that the fifth ciphertext Yt is equal to the output H


of the application of the second cryptographic hash function H2 to an input value { e(Prvsend, greci))r, the input value being given by the output e(Prvsend, greci) of the application of the bilinear map e to the sender partial private key Prvsend and the recipient public key greci to the power the recovered intermediate value r . Accordingly, the verification condition is satisfied if the sender 103 determines that

Yi greci))r


If the sender 103 determines that the verification condition Y is not satisfied, then the sender 103 aborts.


According to the embodiments of the invention, the sender 103 is configured to send an encrypted message C(M) to the recipient 105. The sender 103 may be configured to determine the encrypted message C(M) by encrypting an original message M e M using the two public keys such that the encrypted message is sent to the recipient 105 as a part of a second ciphertext set denoted by C2 according to an Encrypt2 algorithm that takes as inputs the recipient identifier, the sender partial private key, the sender identifier, a given message M and the two public session keys, and outputs the second ciphertext set. According to the Encrypt2 algorithm, the sender 103 may be configured to determine the second ciphertext set C2 if the sender 103 checks that two verification conditions are satisfied, the two verification conditions comprising a trusted center identity verification condition and a public session keys verification condition. The trusted center identity verification condition is satisfied if the sender 103 determines that e{Prvsend, gpUb) = e{H1(IDsend), H1(IDTC)) this means that if the sender 103

determines that the output e{Prvsend, gpub) of the application of the bilinear map e to the sender partial private key Prvsend and the trusted center public key gpub is equal to the output
of the application of the bilinear map e to the result H^IDsend) of the application of the first cryptographic hash function Ht to the sender identifier IDsend and to the result H^IDj-c of the application of the first cryptographic hash function
to the trusted center identifier IDTC . The public session keys verification condition is satisfied if the sender 103 determines that e(pub1, H1(IDsend)) = e(pub2, Prvsend) , i.e. if the sender 103 determines that the output
of the application of the bilinear map e to the first public session key pub1 and to the result Hi(/£Send) of the application of the first cryptographic hash function
to the sender identifier IDsend is equal to the output e(pub2, Prvsend) of the application of the bilinear map e to the second public session key pub2 and to sender partial private key Prvsend.

The sender 103 verifies the trusted center public key using the sender partial private key and verifies the two public session keys. If one of the identity authentications, i.e. one of the two verification conditions, is not satisfied, then the sender 103 aborts.

In embodiments, in which the sender 103 verifies successfully the trusted center public key and the two public session keys, the sender 103 may be configured to determine the second ciphertext set C2 = {V, U, C(M), Y} , that comprises, in addition to the encrypted message C(M), a first component denoted by V, a second component denoted by U, and a third component denoted by Y. The sender 103 may be configured to:

- generate a random secret key denoted by s;

- determine a recipient public key greci by applying the first cryptographic hash function Ht to the recipient identifier Wreci such that greci = Hi(/£reci);

- determine an auxiliary value denoted by r = H3(s, M ) by applying the third cryptographic hash function H3 to the random secret key s and to a given message M;

- determine the first component V by applying an exponentiation function of a base equal to the trusted center public key gpub and an exponent equal to the auxiliary value r = H3 (s, M ) such that the first component is given by V = gpub =

H3(s,M) .

Upub

- determine the second component U by adding the random secret key s to the output H2(e(pub{, grecij) of the application of the second cryptographic hash function H2 to the result e pub , greci) of the application of the bilinear map e to the first public session key to the power the auxiliary value and to the recipient public key greci , the second component is accordingly expressed as U = s + H2 (e(publ, grecij) . The addition operation performed to determine the second component may be performed over F2[x] in which case, the addition operation is an XOR operation;

- determine an encrypted message C(M) by applying a cipher Es to the given message M using the random secret key s ;

- determine the third component Y = H2( e(Prvsend, greci))r^ by applying the second cryptographic hash function H2 to the result e(Prvsend, greci) of the application of the bilinear map e to the sender partial private key Prvsend and to the recipient public key greci, to the power the auxiliary value r.

Upon receiving the second ciphertext set C2 from the sender 103, the recipient 105 may be configured to verify the sender identity and to recover the original message M by applying a Decrypt2 algorithm that takes as inputs the private session key, the recipient partial private key, the sender identifier, the second ciphertext set and the system parameters, and outputs a recovered original message. Accordingly, the recipient 105 may be configured to:

- determine a sender public key gsend by applying the first cryptographic hash function Ht to the sender identifier IDsend such that gsend = Hi(/£Send);

- determine a secret key s by applying a subtraction operation to the second component U comprised in the second ciphertext set C2 and to the output H2(e(V, sk )) of the application of the second cryptographic hash function H2 to the result e(V, sk ) of the application of the bilinear map e to the first component V comprised in the second ciphertext set and to the private session key sk , the recipient 105 having the private session key. The secret key is accordingly expressed

- determine the original message M by decrypting the encrypted message C(M) using a decipher Da that uses said secret key as a decryption key;

- determine an auxiliary value denoted by r = H3 (s, M ) by applying the third cryptographic hash function H3 to the secret key s and the original message M recovered by the recipient 105.

According to some embodiments, the recipient 105 may be further configured to verify the identity of the sender by checking if a sender identity verification condition is satisfied, the sender identity verification condition being satisfied if the recipient 105 determines that Y = H2( e(gsend, Prvreci))r^ i.e. if the recipient 105 determines that the third component Y comprised in the received second ciphertext set C2 is equal to the output
of the application of the second cryptographic hash function H2 to an output result e(gSend> Prvred) to the power the auxiliary value r , the output result being determined by the application of the bilinear map e to the sender public key gsend and the recipient partial private key Prvreci.

According to some embodiments, the cipher/decipher Ea/Da may be any symmetric encryption/decryption algorithm/protocol/function such as the AES, the Triple Data Encryption algorithm, the DES (Data Encryption Standard), the Triple DES (3DES), or the RC4 (Rivest Cipher 4). The cipher/decipher Ess may be configured to perform encryption/decryption using non-tweakable or tweakable modes of operation. Exemplary non-tweakable modes of operations comprise the Electronic Codebook mode (ECB), the Cipher Block Chaining mode (CBC), the Propagating Cipher Block Chaining mode (PCBC), the Cipher Feedback mode (CFB), the Output Feedback mode (OFB), and the Counter mode (CTR). Exemplary tweakable modes of operation comprise the XOR-Encrypt-XOR (XEX) mode and the tweakable with ciphertext stealing mode (XTS).

According to some embodiments, the sender 103 and/or the recipient 105 may be configured to generate the secret key used in the cipher algorithm and the decipher algorithm using a random number generator and/or Physically Unclonable Functions. In some embodiments, a random number generator may be chosen in a group comprising a pseudo-random number generator and a true random number generator.

There is also provided a method for sending an encrypted message M(C) from a sender 103 to a recipient 105 in an identity-based cryptosystem. The cryptosystem comprises a trusted center 101 connected to the sender 103 and the recipient 105. In the identity-based cryptosystem 100, the sender 103 is associated with a sender identifier IDsend and the recipient is associated with a recipient identifier IDreci.

Figure 2 is a flowchart depicting a method for sending the encrypted message from the sender 103 to the recipient 105 according to some embodiments of the invention.

At step 201 , system parameters PK = {p, G, GT, e, H1, H2, H3, gpub} and a master private key s may be determined at the trusted center 101 from a security parameter l and the trusted center identifier 1DTC according to a Setup algorithm.

At step 202, a sender partial private key Prvsend may be determined at the trusted center 101 from the sender identifier IDsend and a recipient partial private key Prvreci may be determined at the trusted center 101 from the recipient identifier Wreci , the sender and the recipient partial private keys may be determines according to a KeyGenl algorithm. Step 202 may comprise distributing the partial private keys, i.e. sending the sender partial private key to the sender 103 and sending the recipient partial private key to the recipient 105.

At step 203, a request for two public session keys may be sent from the sender 103 to the recipient 105.

At step 204, a private session key sk and two public session keys pub and pub2 may be determined at the recipient 103 according to a KeyGen2 algorithm.

At step 205, a first ciphertext set may be determined at the recipient 105 and sent to the sender 103, the first ciphertext set being determined from encryption and authentication of the two public keys pub1 and pub2 according to an Encryptl algorithm.

At step 206, the first ciphertext set may be received at the sender 103 and the two public keys may be decrypted and authenticated at the sender 103 using the recipient identifier IDreci and the sender partial private key Prvsend according to a Decryptl algorithm.

At step 207, a second ciphertext set may be computed at the sender 103 and sent to the recipient 105 according to an Encrypt2 algorithm, the second ciphertext set comprising an encrypted message and being determined from the sender partial private key Prvsend, the recipient identifier IDreci and the two public keys pub1 and pub2.

At step 208, an original message M may be recovered at the recipient from the received second ciphertext set and the sender 103 may be authenticated according to a Decrypt2 algorithm.

Figure 3 is a flowchart depicting a method of determining system parameters PK = {p, G, GT, e, H1, H2, H3, gpub} and a master private key s according to a Setup algorithm, the system parameters comprising a prime number p , two algebraic groups G and GT of order equal to the prime number p, an admissible bilinear map e, a first cryptographic hash function Hl t a second cryptographic hash function H2, a third cryptographic hash function H3 , and a trusted center public key gpub associated with the trusted center identifier IDTC.

At step 301 , input parameters of the setup algorithm may be received, including a security parameter denoted by l e Ί+ and a trusted center identifier IDTc-

At step 302, a prime number p , two algebraic groups G and GT and an admissible bilinear map e may be determined by running a Bilinear Diffie-Hellman parameter generator that takes as input the security parameter l and outputs a

prime number p, the description of two groups G and GT and the description of an admissible bilinear map e: G x G ® GT.

At step 303, a first cryptographic hash function H1: {0,l}n ® G , a second cryptographic hash function H2: GT ® {0,l}n, and a third cryptographic hash function H3: { 0,l}n x {0,l}n ® Έr may be selected, for example among a predefined set of cryptographic hash functions. The cryptographic hash function H1, H2 and H3 may be random oracles.

At step 304, a first value g may be determined by applying the first cryptographic hash function Ht to the trusted center identifier 1DTC such that g = H1 DT ).

At step 305, a master secret key s e T may be selected randomly.

At step 306, a trusted center public key gpub may be determined by applying an exponentiation function defined by a base and an exponent, the base being equal to the first value g, and the exponent being equal to the master private key sk such that gpub = gs. In some embodiments in which the first value g corresponds to a point of an elliptic curve, the exponentiation function may be reduced to a scalar multiplication function according to which the trusted center public key gpub is given by the product of the first value and the scalar s according to gpub = [s]#.

At step 307, the system parameters PK = { , G, GT, e, Hlr H2, H3, gpub} and the master secret key s may be output. The system parameters may be disseminated to the sender 103 and the recipient 105, while the master secret key may be kept secret at the trusted center 101.

Figure 4 is a flowchart depicting a method for determining a sender partial private key Prvsend and a recipient partial private key Prvreci according to the KeyGenl algorithm. This algorithm is executed by the trusted center 101 .

At step 401 , the inputs of the KeyGenl algorithm may be received, including the master secret key s, the system parameters PK, the sender identifier Wsend, and the recipient identifier lDreci.

At step 402, a sender public key gsend may be by applying the first hash function Ht to the sender identifier IDsend such that gsend = Hi (/£Send

At step 403, a sender partial private key Prvsend may be determined by applying an exponentiation function defined by a base and an exponent, the base being equal to the sender public key gsend , and the exponent being equal to the

1 i

inverse of the master secret key - such that Prvsend = gsends· In embodiments in which the sender public key corresponds to a point of an elliptic curve, the exponentiation function may be replaced with a scalar multiplication function according to which


At step 404, a recipient public key greci may be determined by applying the first hash function Ht to the recipient identifier Wreci such that greci = Hi (/£reci) ·

At step 405, a recipient partial private key Prvreci may be determined by applying an exponentiation function defined by a base and an exponent, the base being equal to the recipient public key greci , and the exponent being equal to the

1 i

inverse of the master secret key - such that Prvreci = grecis. In embodiments in which the recipient public key corresponds to a point of an elliptic curve, the exponentiation function may be replaced with a scalar multiplication function according to which Prvreci = ^] ,grec;.

At step 406, the sender partial private key and the recipient partial private key may be output. In particular, the sender partial private key may be sent to the sender 103 and the recipient partial private key may be sent to the recipient 105.

Figure 5 is a flowchart depicting a method for determining a private session key sk and two public session keys
and pub2 according to the KenGen2 algorithm. This algorithm is executed by the recipient 105.

At step 501 , the inputs of the KeyGen2 algorithm may be received, including the recipient partial private key Prvreci and the system parameters PK.

At step 502, a verification condition may be checked. The verification condition may compare a first value e(Prvreci,gpub) to a second value


the first value being determined previously at step 502 by the application of the bilinear map e to the recipient partial private key Prvreci and to the trusted center public key gpub , and the second value being previously determined, at step 502, by the application of the bilinear map e to the output i(IDreci) of the first cryptographic hash function
applied to the recipient identifier IDreci and to the output H^IDTC) of the first cryptographic hash function Ht applied to the trusted center identifier IDTC.

If it is determined at step 502 that the verification condition is not satisfied, then the processing may be end at step 503.

If is determined at step 502 that the verification condition is satisfied, then steps 504 to 507 may be performed to determine a private session key and two public session keys.

At step 504, a random value denoted by b may be determined.

At step 505, a private session key sk may be determined by applying an exponentiation function of a base equal to the recipient partial private key Prvreci and an exponent equal to the random value b such that sk = Prv^eci . In embodiments in which the recipient partial private key corresponds to a point of an elliptic curve, the exponentiation function may be replaced by a scalar multiplication function according to which the private session key is given by sk = W]Prvreci .

At step 506, a first public session key pub- may be determined by applying an exponentiation function of a base equal to the output H^IDj-c of the application of the first cryptographic hash function Ht to the trusted center identifier 1DTC and an exponent equal to the random value b such that
. In embodiments in which the output H^IDTC) corresponds to a point of an elliptic curve, the exponentiation function may be replaced by a scalar multiplication according to which pub = [b^^IΌgo) , b being a scalar. At step 507, a second public session key pub2 may be determined by applying an exponentiation function of a base equal to the trusted center public key gpub and an exponent equal to the random value b such that pub2 = gpub. In embodiments in which the trusted center public key gpub corresponds to a point of an elliptic curve, the exponentiation

function may be reduced to a scalar multiplication function according to which the second public session key pub2 is determined according to pub2 = W]gpub In such embodiments, the exponent b is a scalar value.

At step 508, the private session key and the two public keys may be output.

Figure 6 is a flowchart depicting a method for determining a first ciphertext set according to the Encryptl algorithm, the first ciphertext set {V^ U^ W^, Wi2, Y^ comprising a first ciphertext Vx, a second ciphertext Ul t a third ciphertext Wlt, a fourth ciphertext VK12, and a fifth ciphertext
This algorithm is executed by the recipient 105.

At step 601 , input parameters of the Encryptl algorithm may be received, including the sender identifier IDsend , the sender partial private key Prvsend , the recipient identifier Wreci, the two public session keys pub1 and pub2 and the system parameters PK.

At step 602, a verification condition may be checked verify the trusted center public key using the recipient partial private key. The verification condition compares

If it is determined at step 602 that the verification condition is not satisfied, i.e. if it is determined that e(Prvreci, gpub) ¹ bΐH^IΌ^^, H^IΌg )) , then the processing may be end at step 603.

If it is determined at step 602 that the verification condition is satisfied, i.e. if it is determined that e{Prvreci, gvub) =
then steps 604 to

61 1 may be performed to determine the first ciphertext set.

At step 604, a random secret key denoted by s may be generated.

At step 605, a sender public key gsend = Hi(/£Send) may be determined by applying the first cryptographic hush function Ht to the sender identifier IDsend.

At step 606, a first intermediate value r = H3(s, publr pub2) may be determined by applying the third cryptographic hash function H3 to the random

secret key s, the first public session key pub , and to the second public session key pub2.

At step 607, a first ciphertext V1 may be determined by applying an exponentiation function of a basis equal to the trusted user public key gpub and an exponent equal to the first intermediate value r such that V1 = gpub . The exponentiation function may be replaced by a scalar multiplication such that vi = [r]gpub if the trusted center public key gpub corresponds to a point of an elliptic curve.

At step 608, a second ciphertext
may be determined by adding the random secret key s to a value H2


the value being determined by the application of the second cryptographic hash function H2 to the output e dsend> Hi(IDTc )) °f the application of the bilinear map e to a first input g end and a second input H1(IDTC) , the first input g end being given by the application of an exponentiation function of a basis given by the sender public key gsend and an exponent given by the intermediate value r , the second input H^IDj-c being determined by the application of the first cryptographic hash function Ht to the trusted center identifier IDTC , the second ciphertext is according expressed as

Ut = s + H2 (e(gsrend, H1(lDTC )) . The addition operation may be performed over F2 [X] in which case, the addition operation is an XOR operation.

At step 609, a third ciphertext WX1 may be determined by applying a cipher algorithm Es(. ) to the first public session key pub1 such that Wlt = Eaipub^, the cipher algorithm using the random secret key s as encryption key.

At step 610, a fourth ciphertext W12 may be determined by applying the cipher algorithm Es(. ) to the second public session key pub2 such that W12 = Ea(pub2).

At step 61 1 , a fifth ciphertext Y may be determined by applying the second cryptographic hash function H2 to the output of the application of the bilinear map exponent the first intermediate value
the output e(Prvreci, gsend) being obtained by applying the bilinear map e to the recipient partial private key

Prvred and the sender public key gsend. Accordingly, the fifth ciphertext is given by


At step 612, the first ciphertext set
= [Vlr t/1; Wllr W12, Y- may be output.

Figure 7 is a flowchart depicting a method for decrypting and authenticating the two public session keys at the sender 103 according to the Decryptl algorithm. This algorithm is executed by the sender 103.

At step 701 , the inputs of the Decryptl algorithm may be received, including the sender identifier IDsend , the sender partial private key Prvsend , the recipient identifier lDreci, the first ciphertext set Ct and the system parameters PK.

At step 702, a recipient public key greci may be determined by applying the first cryptographic hash function Ht to the recipient identifier Wreci such that dreci — Hi (JDreci) .

At step 703, a secret key s may be determined by applying a subtraction operation to the second ciphertext ί/c and the output H2(<?(’ri send< f i)) of the application of the second cryptographic hash function H2 to the bilinear map e applied to the sender partial private key Prvsend and the first ciphertext Vt , the secret key s is accordingly expressed as s = Ut - H2
The subtraction operation may be performed over F2[x] in which case, the subtraction operation is an XOR operation.

At step 704, a first public session key may be deciphered by applying a decipher Dff(. ) to the third ciphertext Wlt, the decipher using the secret key s as a decryption key, which provides a recovered first public session key given by pub ! = Dff(Wu).

At step 705, a second public session key by deciphered applying the decipher Dff(. ) to the fourth ciphertext W12 , which provides a recovered second public session key given by pub2 = Dff(W12).

At step 706, a recovered intermediate value r = H3fa, publr pub2) may be determined by applying the third cryptographic hash function H3 to the secret key s, the recovered first public session key pub 1 , and the recovered second public session key pub2.

At step 707, the recipient identity may be verified by checking a verification condition comparing the fifth ciphertext Yt to the output H2(( e(Prvsend>9re
the application of the second cryptographic hash function H2 to an input value { e(Prvsend, greci))r , the input value being given by the output e(Prvsend, greci) of the application of the bilinear map e to the sender partial private key Prvsend and the recipient public key greci to the power the recovered intermediate value r.

If it is determined at step 707 that the verification condition is not satisfied, i.e. that Yt


then the processing may be interrupted at step 708.

If it is determined at step 707 that the verification condition is satisfied, i.e. that Yi =


then the recovered first public session key and the recovered second public session key may be output at step 709.

Figure 8 is a flowchart depicting a method for computing a second ciphertext at the sender 103 according to the Encrypt2 algorithm. This algorithm is executed by the sender 103.

At step 801 , the inputs of the Encrypt2 algorithm may be received, including the recipient identifier IDreci , the sender partial private key Prvsend , the sender identifier IDsend , a given message M and the two public session keys pub1, pub2 recovered at the sender 103.

At step 802, a trusted center identity verification condition may be checked by comparing e(Prvsend, gpub ) to efaQ £send),tfi( £>Tc))·

If it is determined at step 802 that the trusted center identity verification condition is not satisfied i.e. e(Prvsend, gpub) ¹
) , then the processing may be interrupted at step 803.

If it is determined at step 802 that the trusted center identity verification condition is satisfied i.e. e(Prvsend, gpub) =
then a public

session keys verification condition may be checked at step 804 comparing e(pub1, H1QDsend)) to e(pub2, Prvsend ).

If it is determined at step 804 that the public session keys verification condition is not satisfied, i.e.
¹ e(pub2, Prvsend) , then the processing may be interrupted at step 805.

If it is determined at step 804 that the public session keys verification condition is satisfied, i.e. e(pub1, H1QDsend')) = e(pub2, Prvsend), then steps 806 to 813 may be performed to determine the second ciphertext set C2 = {V, U , C(M), Y} that comprises in addition to the encrypted message C(M), a first component V, a second component U, and a third component Y.

At step 806, a random secret key denoted by s may be generated.

At step 807, a recipient public key greci may be determined by applying the first cryptographic hash function Ht to the recipient identifier Wreci such that dreci — H, (JDreci) ·

At step 808, an auxiliary value r = H3(s, M ) may be determined by applying the third cryptographic hash function H3 to the random secret key s and to a given message M.

At step 809, a first component V may be determined by applying an exponentiation function of a base equal to the trusted center public key gpub and an exponent equal to the auxiliary value r = H3(s, M ) such that the first component is given

At step 810, a second component U may be determined by adding the random secret key s to the output H2(e(pub{, grecij) of the application of the second cryptographic hash function H2 to the result e(pub{, greci) of the application of the bilinear map e to the first public session key to the power the auxiliary value and to the recipient public key greci, the second component is accordingly expressed as U = s + H2 (e(pub{, greci)) . The addition operation performed to determine the second component may be performed over F2[x] in which case, the addition operation is an XOR operation.

At step 81 1 , an encrypted message C(M) may be determined by applying a cipher Es to the given message M using the random secret key s such that C(M) = Es(M ).

At step 812, a third component Y =
may be determined by applying the second cryptographic hash function H2 to the result e(Prvsend,greci) of the application of the bilinear map e to the sender partial private key Prvsend and to the recipient public key greci, to the power the auxiliary value r.

At step 813, the second ciphertext set C2 = {V, U, C(M),Y } may be output.

Figure 9 is a flowchart depicting a method for recovering an original message at the recipient 105 according to the Decrypt2 algorithm. This algorithm is executed by recipient 105.

At step 901 , the inputs of the Decrypt2 algorithm may be received, including the private session key sk, the recipient partial private key Prvreci, the sender identifier lDsend, the second ciphertext set C2 and the system parameters PK.

At step 902, a sender public key gsend may be determined by applying the first cryptographic hash function
to the sender identifier IDsend such that gsend =

Hl QDsend ·

At step 903, a secret key s may be determined by applying a subtraction operation to the second component U comprised in the second ciphertext set C2 and to the output H2(e(V,sk )) of the application of the second cryptographic hash function H2 to the result e(V,sk ) of the application of the bilinear map e to the first component V comprised in the second ciphertext set and to the private session key sk, the recipient 105 having the private session key. The secret key is accordingly expressed as s U - H2(e(V,sk)). The subtraction operation performed to determine the secret key may be performed over F2[x] in which case, the subtraction operation is an XOR operation.

At step 904, the original message M may be determined/recovered by decrypting the encrypted message C(M) using a decipher Da that uses the secret key s as a decryption key.

At step 905, an auxiliary value r = H3(s, M ) may be determined/computed by applying the third cryptographic hash function H3 to the secret key s and the original message M recovered at step 904.

At step 906, the identity of the sender 103 may be verified by checking if a sender identity verification condition is satisfied, the sender identity verification condition comparing the third component Y to H2({e(gsend, Prvreci))r

If it is determined at step 906 that the sender identity verification condition is not satisfied, i.e. if Y ¹ H2 ({e(gsend, Prvreci))r^ , then the processing may be interrupted at step 907.

If it is determined at step 906 that the sender identity verification condition is satisfied, i.e. if Y =
then the recovered original message M may be output at step 908.

A proof of exchange is presented hereinafter.

For the Encrypt2 algorithm, the following holds:


- U = s + H2 ;

F H2 \ (Rtn8bhά’ Qreci) L ^Od

- V = gprub = Ht [IDTC]rs.

For the Decrypt2 algorithm, the following holds:


- s = U + H2 [ e(V , s/c)] ;

In order to recover the symmetric secret key s, it is obtained e{pub , greci) =


So, the recipient 105 can retrieve the symmetric key s using U + H2 [e(V, sk)].

For the authentication of the sender 103, it is obtained:


Using the sender partial private key, the trusted center 101 has the session public keys determined by the recipient 105 and sent to sender 103. The problem of key escrow is resolved using this method. The trusted center 101 may not be able to retrieve the encrypted message M. The confidentiality of the message M is thus guaranteed.

There are no links between recipient identifier and the two public session keys pub1 and pub2. Data encryption makes it more difficult to attack the sent session public keys. The consistency of both public session keys is verified by the sender 103.

There is also provided a program stored in a computer-readable non-transitory medium for sending an encrypted message from a sender 103 to a recipient 105 in an identity-based cryptosystem 100 comprising a trusted center 101 , a sender private key being determined, at the trusted center 101 from a sender identifier associated with the sender 103, and a recipient private key being determined, at the trusted center 101 from a recipient identifier associated with the recipient 105. The program comprises instructions stored on the computer-readable storage medium, that, when executed by a processor, cause the processor to:

- send a request for two public session keys pub^ and pub2 from the sender 103 to the recipient 105;

- receive, at the sender 103, a first ciphertext set C , the first ciphertext set being determined at the recipient 105 from encryption and authentication of the two public session keys pub and pu&2determined with a private session key s from the recipient partial private key and system parameters PK associated with the cryptosystem 100;

- decrypt and authenticate, by the sender 103, the two public session keys using the recipient identifier and the sender partial private key;

- determine, by the sender 103, a second ciphertext set C2 from the sender partial private key, the recipient identifier, and the two public keys, the second ciphertext comprising an encrypted message C(M);

- send, by the sender 103, the second ciphertext set C2 to the recipient 105;

- recover an original message M at the recipient 105 by decrypting the encrypted message and authenticating the sender 103.

The methods and devices described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing elements of the different devices operating in the system 300 can be implemented for example according to a hardware-only configuration (for example in one or more FPGA, ASIC, or VLSI integrated circuits with the corresponding memory) or according to a configuration using both VLSI and Digital Signal Processor (DSP).

Figure 10 is a block diagram representing an exemplary hardware/software architecture of a device 1000 operating in the cryptosystem 100 such as the sender 103, the recipient 105, or the trusted center 101 , according to some embodiments of the invention.

As illustrated, the architecture may include various computing, processing, storage, communication, sensing, and displaying units comprising:

- communication circuitry comprising a transceiver 1002 and a transmit/receive element 1001 (e.g. one or more antennas) configured to connect the device to corresponding links in the cryptosystem 100 (e.g. connecting the

sender 103 to the trusted center 101 and to the recipient 105 or connecting the recipient 105 to the sender 103 and the trusted center 101 or connecting the trusted center 101 to both the sender 103 and the recipient 105), and to ensure transmission/reception of exchanged data (e.g. the sender identifier sent from the sender 103 to the trusted center 101 , or the recipient identifier sent from the recipient 105 to the trusted center 101 , or the sender partial private key sent from the trusted center 101 to the sender 103, or the recipient partial private key sent from the trusted center 101 to the recipient, or the first ciphertext set sent from the recipient 105 to the sender 103, or the second ciphertext set sent from the sender 103 to the recipient 105). The communication circuitry may support various network and air interface such as wired and wireless networks (e.g. wireless local area networks and cellular networks);

- a processing unit 1002 configured to execute the computer-executable instructions to run the methods and algorithms according to the various embodiments of the invention for to perform the various required functions of the device such as data computation, encryption/decryption operations, generation and processing of random keys and values, and any functionalities required to enable the device to operate in the cryptosystem 100 according to the embodiments of the invention. The processing unit 1002 may be a general purpose processor, a special purpose processor, a DSP, a plurality of microprocessors, a controller, a microcontroller, an ASIC, an FPGA circuit, any type of integrated circuit, and the like;

- a power source 1003 that may be any suitable device providing power to the device 1000 such as dry cell batteries, solar cells, and fuel cells;

- a storage unit 101 1 possibly comprising a random access memory (RAM) or a read-only memory used to store processed data (e.g. the sender identifier, the recipient identifier, the trusted center identifier, the system parameters, the sender public key, the recipient public key, the sender partial private key, the recipient partial private key, the master secret key, .etc.) and any data required to perform the functionalities of the device 1000 according to the embodiments of the invention;

- Input peripherals 1008;

- Output peripherals 1009 comprising communication means such as displays enabling for example man-to-machine interaction with the device 1000 for example for configuration and/or maintenance purposes.

The architecture of the device 1000 may further comprise one or more software and/or hardware units configured to provide additional features, functionalities and/or network connectivity.

Furthermore, the method described herein can be implemented by computer program instructions supplied to the processor of any type of computer to produce a machine with a processor that executes the instructions to implement the functions/acts specified herein. These computer program instructions may also be stored in a computer-readable medium that can direct a computer to function in a particular manner. To that end, the computer program instructions may be loaded onto a computer to cause the performance of a series of operational steps and thereby produce a computer implemented process such that the executed instructions provide processes for implementing the functions specified herein.

It will be understood that the configurations and/or approaches described herein are exemplary in nature, and that these specific embodiments or examples are not to be considered in a limiting sense, because numerous variations are possible. The specific routines or methods described herein may represent one or more of any number of processing strategies. As such, various acts illustrated and/or described may be performed in the sequence illustrated and/or described, in other sequences, in parallel, or omitted. Likewise, the order of the above-described processes may be changed.

The subject matter of the present disclosure includes all novel and non-obvious combinations and sub-combinations of the various processes, systems and configurations, and other features, functions, acts, and/or properties disclosed herein, as well as any and all equivalents thereof.