2FLIP: A two-factor lightweight privacy-preserving authentication scheme for VANET

F Wang, Y Xu, H Zhang, Y Zhang… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Authentication in a vehicular ad-hoc network (VANET) requires not only secure and efficient
authentication with privacy preservation but applicable flexibility to handle complicated …

LAMANCO: A Lightweight Anonymous Mutual Authentication Scheme for -Times Computing Offloading in IoT

F Wang, Y Xu, L Zhu, X Du… - IEEE Internet of Things …, 2018 - ieeexplore.ieee.org
Nowadays in many application scenarios of Internet of Things (IoT), low latency is achieved
at the cost of computing-complexity which is beyond the capabilities of IoT devices …

Universally composable authentication and key-exchange with global PKI

R Canetti, D Shahaf, M Vald - Public-Key Cryptography–PKC 2016: 19th …, 2016 - Springer
Message authentication and key exchange are two of the most basic tasks of cryptography
and are often basic components in complex and security-sensitive protocols. Thus …

Cryptographically sound security proofs for basic and public-key kerberos

M Backes, I Cervesato, AD Jaggard, A Scedrov… - … –ESORICS 2006: 11th …, 2006 - Springer
We present a computational analysis of basic Kerberos and Kerberos with public-key
authentication (PKINIT) in which we consider authentication and key secrecy properties. Our …

A framework for universally composable Diffie-Hellman key exchange

R Küsters, D Rausch - 2017 IEEE Symposium on Security and …, 2017 - ieeexplore.ieee.org
The analysis of real-world protocols, in particular key exchange protocols and protocols
building on these protocols, is a very complex, error-prone, and tedious task. Besides the …

Cryptographically sound security proofs for basic and public-key Kerberos

M Backes, I Cervesato, AD Jaggard, A Scedrov… - International Journal of …, 2011 - Springer
We present a computational analysis of basic Kerberos with and without its public-key
extension PKINIT in which we consider authentication and key secrecy properties. Our …

Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings

Z Zhang, L Zhu, L Liao, M Wang - Information Sciences, 2012 - Elsevier
The security of the group key exchange protocols has been widely studied in the
cryptographic community in recent years. Current work usually applies either the …

Universally composable symbolic analysis for two-party protocols based on homomorphic encryption

M Dahl, I Damgård - Annual International Conference on the Theory and …, 2014 - Springer
We consider a class of two-party function evaluation protocols in which the parties are
allowed to use ideal functionalities as well as a set of powerful primitives, namely …

Automating computational proofs for public-key-based key exchange

L Ngo, C Boyd, JG Nieto - International Conference on Provable Security, 2010 - Springer
We present an approach to automating computationally sound proofs of key exchange
protocols based on public-key encryption. We show that satisfying the property called …

Decision procedures for simulatability

CS Jutla, A Roy - European Symposium on Research in Computer …, 2012 - Springer
We address the question of automatically proving security theorems in the universally
composable (UC) model for ideal and real functionalities composed of if-then-else programs …