Multi-Channel Key Agreement Using Encrypted Public Key Exchange (Transcript of Discussion)

Author(s):  
Bruce Christianson
2011 ◽  
Vol 467-469 ◽  
pp. 640-644
Author(s):  
Yong Ding ◽  
Bin Li ◽  
Zheng Tao Jiang

Affiliation-hiding authenticated key exchange protocol, also called secret handshake, makes two parties from the same organization realize mutual authentication and key agreement via public key certificates without leaking the organization information to any others. Moreover, if the peer involved in the protocol is not from the same group, no any information of the affiliation can be known. In previous secret handshakes protocols, there is a problem which is linkability. That is to say, two activities of the same people can be associated by the attackers. It is not desirable for privacy because the association may deduce it’s affiliation with some other information. In this paper, an unlinkable affiliation-hiding authenticated key exchange protocol is brought out to conquer the linkability. Security analysis is given finally.


2015 ◽  
Vol 9 (3) ◽  
Author(s):  
Luigi Accardi ◽  
Massimo Regoli

AbstractIn the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.


2010 ◽  
Vol 44-47 ◽  
pp. 4012-4017
Author(s):  
Peng Cheng Wei ◽  
Hai Xia Wu ◽  
Hua Qian Yang ◽  
Xi Shi

The important properties of permutation ration function are surveyed. Subsequently investigate a new permutation rational functions including the aspect of important algebraic, arithmetic and properties. Finally, application of permutation rational function to public-key cryptosystem and key exchange scheme will also be considered.


2021 ◽  
Vol 11 (12) ◽  
pp. 5540
Author(s):  
Satoshi Iriyama ◽  
Koki Jimbo ◽  
Massimo Regoli

Strongly asymmetric public key agreement (SAPKA) is a class of key exchange between Alice and Bob that was introduced in 2011. The greatest difference from the standard PKA algorithms is that Bob constructs multiple public keys and Alice uses one of these to calculate her public key and her secret shared key. Therefore, the number of public keys and calculation rules for each key differ for each user. Although algorithms with high security and computational efficiency exist in this class, the relation between the parameters of SAPKA and its security and computational efficiency has not yet been fully clarified. Therefore, our main objective in this study was to classify the SAPKA algorithms according to their properties. By attempting algorithm attacks, we found that certain parameters are more strongly related to the security. On this basis, we constructed concrete algorithms and a new subclass of SAPKA, in which the responsibility of maintaining security is significantly more associated with the secret parameters of Bob than those of Alice. Moreover, we demonstrate 1. insufficient but necessary conditions for this subclass, 2. inclusion relations between the subclasses of SAPKA, and 3. concrete examples of this sub-class with reports of implementational experiments.


Author(s):  
Kache Vishwamithra ◽  
G Santhosh Abhinai ◽  
S Aakash ◽  
M Rajvel

In passed-on overseeing, assets are everything considered in the cloud master's connection and dependably got the idea by the cloud clients through open channels. The key system decorations with a got channel foundation over a public channel for the ensured trades between a cloud client and a cloud ace association. The stream key design shows for passed on figuring experience the risky effects of express inconveniences, e.g., seeing low connection delay, disposing of verbalization the central issues, restoring client accreditation, and putting forth an attempt not to stun haphazardness. To manage these heaps, we propose a less testament 0-RTT dull AKA show against baffling eccentricity for secure station foundation in passed-on figuring. As a 0-RTT show, it as a rule speeds up the sensibility of the got channel foundation measure. Further, our show needn't unwind up around with the highlights of an infuriating circumstance a public key with a substance's character and beginning now and for an earnest period of time handles the check of the beginning issue. At long last, a solid security assessment of the show is other than proposed. The show doesn't just fulfill the standard security credits (e.g., known-key security, dull key-share), yet in like manner, solid security ensures, i.e., client certification and puzzling anomaly get.


2020 ◽  
Vol 26 (10) ◽  
pp. 577-585
Author(s):  
R. S. Fahrutdinov ◽  
◽  
A. Yu. Mirin ◽  
D. N. Moldovyan ◽  
A. A. Kostina ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document