• No results found

The Key Exchange Problem

A  new  key  exchange  protocol  based  on  the  decomposition  problem

A new key exchange protocol based on the decomposition problem

... NEW KEY EXCHANGE PROTOCOL BASED ON THE DECOMPOSITION PROBLEM VLADIMIR SHPILRAIN AND ALEXANDER USHAKOV ...new key establishment protocol based on the decomposition problem in ...

7

A  New  Key  Exchange  Primitive  Based  on  the  Triple  Decomposition  Problem

A New Key Exchange Primitive Based on the Triple Decomposition Problem

... achieve key exchange in a public key ...decomposition problem in a non-commutative group, namely decomposing an element into three pieces satisfying certain ...decomposition problem. ...

14

A  Simple  Provably  Secure  Key  Exchange  Scheme  Based  on  the  Learning  with  Errors  Problem

A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem

... elegant key exchange just like the DH scheme which, however, is not based on the same mathematical principles as that of the LWE encryption ...exchanged key, and we rely also on the commutativity of ...

15

Post-quantum  key  exchange  for  the  TLS  protocol  from  the  ring  learning  with  errors  problem

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem

... Implementation and performance. We implemented the R-LWE algorithms in C. As it has become mandatory to guard cryptographic implementations against physical attacks, such as the leakage of secret material over side ...

29

An  ID-based  Authenticated  Key  Exchange  Protocol  Based  on  Bilinear  Diffie-Hellman  Problem

An ID-based Authenticated Key Exchange Protocol Based on Bilinear Diffie-Hellman Problem

... When the adversary M activates a party whose static key S possesses, S follows the protocol description. The reader may wonder how the simulator respond the adversary’s queries to these sessions owned by B without ...

10

Strongly  Secure  Authenticated  Key  Exchange  Protocol  Based  on  Computational  Diffie-Hellman  Problem

Strongly Secure Authenticated Key Exchange Protocol Based on Computational Diffie-Hellman Problem

... private key and ephemeral private key of parties involved except for both static private key and ephemeral private key of one of parties ...

13

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem

... R-LWE key exchange rather than elliptic curve Diffie–Hellman (ECDH), (ii) providing a proof in a suitable security model [12] that this new TLS ciphersuite is a secure channel, and (iii) integrating our ...

19

Tightly Secure Authenticated Key Exchange without NAXOS’ Approach Based on Decision Linear Problem

Tightly Secure Authenticated Key Exchange without NAXOS’ Approach Based on Decision Linear Problem

... techniques that allow for greatly simplifying the analysis of protocols. Also, they proposed a definition of security of KE protocols rooted in the simulatability approach used to define the security of multiparty ...

16

Authenticated  key  exchange  for  SIDH

Authenticated key exchange for SIDH

... a key with Carol? One of them will use points of order ` e 1 1 while the other will use points of order ` e 2 2 ...a problem when we move to the authenticated ...

17

Deniable  Internet  Key-Exchange

Deniable Internet Key-Exchange

... deniable key-exchange is that if the key-exchange protocol is deniable, then all transactions using the session-key produced by the key-exchange protocol will be ...

19

Predicate-Based  Key  Exchange

Predicate-Based Key Exchange

... secret key with another party, it may not be as simple as Alice saying that she wants to talk to ...the problem in the context of key exchange protocols, which allow two parties to ...

15

Non-Interactive  Key  Exchange

Non-Interactive Key Exchange

... using key estab- lishment methods that minimise the number of bits that need to be transmitted is of fundamental ...a key is particularly ...this problem, since a key can be established with ...

28

Quantum  Key  Distribution  in  the  Classical  Authenticated  Key  Exchange  Framework

Quantum Key Distribution in the Classical Authenticated Key Exchange Framework

... session key which can be used to encrypt messages. But if the session key is compromised, the confidentiality of encrypted messages is typically compromised as ...mechanics, key establishment can ...

17

Authenticated Key Exchange Protocols For   pNFS

Authenticated Key Exchange Protocols For pNFS

... encrypted key exchange protocols based on that of Bellovin and ...encrypted key exchange protocols in the literature, and yet they only require a single random oracle ...Diffe-Hellman ...

8

Authenticated  Key  Exchange  over  Bitcoin

Authenticated Key Exchange over Bitcoin

... practical problem in the real ...Authenticated Key Exchange (AKE) pro- tocols to establish a secure end-to-end (E2E) communication channel between Bitcoin ...

17

Stronger  Security  of  Authenticated  Key  Exchange

Stronger Security of Authenticated Key Exchange

... this problem, in Section 3 we present an attack on the SIG-DH protocol which was proven to achieve Canetti-Krawczyk security in [10] (where the adversary is only allowed to reveal part of the ephemeral secret ...

15

Efficient Cooperative Key Exchange Protocol

Efficient Cooperative Key Exchange Protocol

... To address this problem, Ford and Kaliski introduced a system in which passwords are effectively protected through distribution of trust across multiple servers. Mackenzie, Shrimpton, and Jakobsson extended this ...

11

NOVEL HYBRID KEY EXCHANGE ALGORITHM

NOVEL HYBRID KEY EXCHANGE ALGORITHM

... CAESAR CIPHER ALONG WITH MAC FUNCTION: Caesar cipher is one of the basic encryption and decryption technique and it is placed in the category of substation cipher mechanism. This technique is used to replace the actual ...

8

Generic Compilers for Authenticated Key Exchange

Generic Compilers for Authenticated Key Exchange

... Unknown key share [5] attacks do not threaten the real world security of cryptographic protocols, but invalidate security proofs in the formal models that follow [2]: If the adversary is able to force two protocol ...

18

ch10 KEY EXCHANGE

ch10 KEY EXCHANGE

... relies on elliptic curve logarithm problem fastest method is “Pollard rho method” compared to factoring, can use much smaller key sizes than with RSA etc. for equivalent key lengths com[r] ...

27

Show all 10000 documents...

Related subjects