Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
From MaRDI portal
Publication:1761600
DOI10.1016/j.ins.2012.04.029zbMath1251.94040OpenAlexW2025644930MaRDI QIDQ1761600
Liehuang Zhu, Zijian Zhang, Lejian Liao, Mingzhong Wang
Publication date: 15 November 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.04.029
bilinear pairingcomputational soundnessgroup key exchange protocoluniversally composable symbolic analysis
Uses Software
Cites Work
- Unnamed Item
- A round-optimal three-party ID-based authenticated key agreement protocol
- Group-oriented setting's multisigncryption scheme with threshold designcryption
- Provably secure one-round identity-based authenticated asymmetric group key agreement protocol
- A survey of symbolic methods in computational analysis of cryptographic systems
- A computational interpretation of Dolev-Yao adversaries
- Proxy re-encryption with keyword search
- A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Simulatable certificateless two-party authenticated key agreement protocol
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Circular-Secure Encryption from Decision Diffie-Hellman
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness
- Advances in Cryptology - CRYPTO 2003
- Information Security and Cryptology - ICISC 2003
- Automata, Languages and Programming
- Soundness of Formal Encryption in the Presence of Key-Cycles
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings