Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Jisuanji gongcheng

Universally Composable Secure Just Fast Keying Protocol

Wang Yi-fang

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

Aiming at the redundancy of Just Fast Keying(JFKi) and the absence of its forma proof,a new Lightly Just Fast Keying(LJFKi) is proposed.Through the contrast analysis,it is found that the protocol proved is one-third shorter than the natural protocol,which has higher communication efficiency and is more convenient for the sensitive network to communication payload.The proposed protocol can realize secure session ideal function and afford Universally Composable(UC) security by proving with universally composable secure model.

Related papers

Universally Composable Secure Group Communication.

Youliang Tian, Changgen Peng

Abstract. This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion mod-el and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM, FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption protocol πIDSC. Moreover, we shows that the identity-based signcryption πIDSC securely realizes the ideal functionality FIDSC if and only if the corresponding protocol ID-SC is secure. Finally, based on the identity-based protocol, we propose a group communica-tion scheme πSAGCOM, which can securely realizes the ideal functionality FSAGCOM in the (FIDSC,FGKD)-hybrid model.

•Jan 1, 2014•2 citations

Universally Composable Notions of Key Exchange and Secure Channels (Extended Abstract)

Ran Canetti, Hugo Krawczyk

Recently, Canetti and Krawczyk (Eurocrypt'2001) formu- lated a notion of security for key-exchange (ke) protocols, called SK- security, and showed that this notion suffices for constructing secure channels. However, their model and proofs do not suffice for proving more general composability properties of SK-secure ke protocols. We show that while the notion of SK-security is strictly weaker than a fully-idealized notion of key exchange security, it is sufficiently robust for providing secure composition with arbitrary protocols. In particular, SK-security guarantees the security of the key for any application that desires to set-up secret keys between pairs of parties. We also provide new definitions of secure-channels protocols with similarly strong com- posability properties, and show that SK-security suffices for obtaining these definitions. To obtain these results we use the recently proposed framework of uni- versally composable (UC) security. We also use a new tool, called non- information oracles, which will probably find applications beyond the present case. These tools allow us to bridge between seemingly limited indistinguishability-based definitions such as SK-security and more pow- erful, simulation-based definitions, such as UC security, where general composition theorems can be proven. Furthermore, based on such compo- sition theorems we reduce the analysis of a full-fledged multi-session key- exchange protocol to the (simpler) analysis of individual, stand-alone, key-exchange sessions.

•Jan 1, 2002•19 citations

Universally Composable Secure Commitment Protocol Based on Tamper-proof Hardware Model

Yu Zhang, Yin Jian-qiang, Jie Hu

Beginning with the research of the basic concepts of Universally Composable(UC) framework,the requirement of UC security on commitment protocols is analyzed in this paper,and the reason of the problem that all UC commitment protocols do not exist in the plain model is pointed out that the security requirement of commitment protocol and the requirement of UC security are contradictory.On the basis of this,a UC secure commitment protocol UCCOM using tamper-proof hardware is proposed.Analysis result shows that UCCOM does not depend on any trusted third-party and uses fewer cryptographic operations compared with the related works,so it has higer efficiency.

•Jan 1, 2013•0 citations

Universally composable secure Internet key exchange protocol

Jianfeng Ma

The new Internet key exchange protocol(IKEv2) is analyzed,and it is found that the protocol can not achieve active identity protection to the initiator and has the security flaw of authentication failure in its initial exchange.However,it is necessary to protect the identity information to the initiator under the environment of a wireless access network.In this paper,a novel key exchange protocol for the wireless network based on IKEv2 initial exchange is proposed,which realizes active identity protection to the initiator by the responder explicitly proving his true identity,and achieves successful authentication by reconstructing the authentication payload.With the Universally Composable(UC) security model,this new protocol is analyzed in detail,with the analytical results showing that it affords provably UC security.Performance analysis and simulation results show that the proposed protocol has less computation and communication overhead.

Journal of Xidian University•Jan 1, 2009•0 citations

Universally composable asymmetric group key agreement protocol

Yong Chen, Mingxing He, Shengke Zeng +1 more

We analyze the security of asymmetric group key agreement (ASGKA) protocol in the universal composability (UC) framework. An ideal functionality that is suitable for ASGKA protocol is proposed. And we show that the ASGKA protocol securely realizes the proposed ideal functionality that can resist attacks by malicious insiders. The UC framework allows the protocols to guarantee their security under arbitrary protocol environment.

International Conference on Information, Communications & Signal Processing (ICICS)•Dec 1, 2015•1 citation

Universally Composable Three-Party Key Distribution.

Zhou Jin, TingMao Chang, Yajuan Zhang +1 more

In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal functionality that captures the basic security requirements of three-party key distribution is formulated. We show that UC definition of security for three-party key distribution protocol is strictly more stringent than a previous definition of security which is termed AKE-security. Finally, we present a real-life protocol that securely realizes the formulated ideal functionality with respect to non-adaptive adversaries. Keywords—Key distribution, Universally composable, AKEsecurity

•Jan 1, 2006•1 citation
Aiming at the redundancy of Just Fast Keying(JFKi) and the absence of its forma proof,a new Lightly Just Fast Keying(LJFKi) is proposed.Through the contrast analysis,it is found that the protocol proved is one-third shorter than the natural protocol,which has higher communication efficiency and is more convenient for the sensitive network to communication payload.The proposed protocol can realize secure session ideal function and afford Universally Composable(UC) security by proving with universally composable secure model.
Abstract. This paper analyzes group communication within the universally composable framework. We first propose the group communication model, identity-based signcrytion mod-el and group key distribution model in the UC framework by designing the ideal functionality FSAGCOM, FIDSC and FGKD, respectively. Then, we construct a UC secure identity-based signcryption protocol πIDSC. Moreover, we shows that the identity-based signcryption πIDSC securely realizes the ideal functionality FIDSC if and only if the corresponding protocol ID-SC is secure. Finally, based on the identity-based protocol, we propose a group communica-tion scheme πSAGCOM, which can securely realizes the ideal functionality FSAGCOM in the (FIDSC,FGKD)-hybrid model.
Recently, Canetti and Krawczyk (Eurocrypt'2001) formu- lated a notion of security for key-exchange (ke) protocols, called SK- security, and showed that this notion suffices for constructing secure channels. However, their model and proofs do not suffice for proving more general composability properties of SK-secure ke protocols. We show that while the notion of SK-security is strictly weaker than a fully-idealized notion of key exchange security, it is sufficiently robust for providing secure composition with arbitrary protocols. In particular, SK-security guarantees the security of the key for any application that desires to set-up secret keys between pairs of parties. We also provide new definitions of secure-channels protocols with similarly strong com- posability properties, and show that SK-security suffices for obtaining these definitions. To obtain these results we use the recently proposed framework of uni- versally composable (UC) security. We also use a new tool, called non- information oracles, which will probably find applications beyond the present case. These tools allow us to bridge between seemingly limited indistinguishability-based definitions such as SK-security and more pow- erful, simulation-based definitions, such as UC security, where general composition theorems can be proven. Furthermore, based on such compo- sition theorems we reduce the analysis of a full-fledged multi-session key- exchange protocol to the (simpler) analysis of individual, stand-alone, key-exchange sessions.
Beginning with the research of the basic concepts of Universally Composable(UC) framework,the requirement of UC security on commitment protocols is analyzed in this paper,and the reason of the problem that all UC commitment protocols do not exist in the plain model is pointed out that the security requirement of commitment protocol and the requirement of UC security are contradictory.On the basis of this,a UC secure commitment protocol UCCOM using tamper-proof hardware is proposed.Analysis result shows that UCCOM does not depend on any trusted third-party and uses fewer cryptographic operations compared with the related works,so it has higer efficiency.
The new Internet key exchange protocol(IKEv2) is analyzed,and it is found that the protocol can not achieve active identity protection to the initiator and has the security flaw of authentication failure in its initial exchange.However,it is necessary to protect the identity information to the initiator under the environment of a wireless access network.In this paper,a novel key exchange protocol for the wireless network based on IKEv2 initial exchange is proposed,which realizes active identity protection to the initiator by the responder explicitly proving his true identity,and achieves successful authentication by reconstructing the authentication payload.With the Universally Composable(UC) security model,this new protocol is analyzed in detail,with the analytical results showing that it affords provably UC security.Performance analysis and simulation results show that the proposed protocol has less computation and communication overhead.
In this paper, we formulate and realize a definition of security for three-party key distribution within the universally composable (UC) framework. That is, an appropriate ideal functionality that captures the basic security requirements of three-party key distribution is formulated. We show that UC definition of security for three-party key distribution protocol is strictly more stringent than a previous definition of security which is termed AKE-security. Finally, we present a real-life protocol that securely realizes the formulated ideal functionality with respect to non-adaptive adversaries. Keywords—Key distribution, Universally composable, AKEsecurity