Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks

DOI10.1007/978-3-642-16280-0_2zbMath1286.94057OpenAlexW1484847234MaRDI QIDQ4933209

Seiko Arita, Hiroaki Anada

Publication date: 12 October 2010

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16280-0_2

zbMATH Keywords

tight reductionidentification schemeconcurrent man-in-the-middle attackgap computational Diffie-Hellman assumption

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (1)

Identification Schemes from Key Encapsulation Mechanisms

Cites Work

• Efficient signature generation by smart cards
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Extractable Perfectly One-Way Functions
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• An efficient and secure two-flow zero-knowledge identification protocol
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks