![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
A series of algorithms for evaluation of multi-exponentiation are proposed based on the binary greatest common divisor algorithm. The proposed algorithms are inversion free and have the capability to evaluate ...
-
Article
Universally composable one-time signature and broadcast authentication
Broadcast authentication is a vital security primitive for the management of a copious number of parties. In the universally composable framework, this paper investigates broadcast authentication using one-tim...
-
Article
Universally composable secure TNC model and EAP-TNC protocol in IF-T
This paper analyzes trusted network connect (TNC) protocols within the universally composable (UC) framework. We propose the first TNC model in the UC framework by first designing the TNC ideal functionality ℱTNC
-
Article
Open AccessConstructing UC Secure and Constant-Round Group Key Exchange Protocols via Secret Sharing
Group key exchange (GKE) is one of the basic building blocks in securing group communication. A number of solutions to GKE problem have been proposed, but most of them are not scalable and require a number of ...
-
Article
A new approach for UC security concurrent deniable authentication
Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. When we consider a...
-
Article
Universally composable anonymous Hash certification model
Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity au...
-
Article
Provable efficient certificateless group key exchange protocol
Certificateless public key cryptography (CL-PKC) avoids the inherent escrow of identity-based cryptography and does not require certificates to guarantee the authenticity of public keys. Based on CL-PKC, we pr...
-
Article
Security extension for the Canetti-Krawczyk model in identity-based systems
The Canetti-Krawczyk (CK) model is a formalism for the analysis of key-exchange protocols, which can guarantee many security properties for the protocols proved secure by this model. But we find this model lac...